Authentication codes based on resilient Boolean maps
From MaRDI portal
Publication:2630717
DOI10.1007/s10623-015-0121-3zbMath1348.94075OpenAlexW1900593650MaRDI QIDQ2630717
Juan Carlos Ku-Cauich, Guillermo Morales Luna
Publication date: 21 July 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0121-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Bent functions on a Galois ring and systematic authentication codes
- Authentication schemes from highly nonlinear functions
- Analysis and design of stream ciphers
- Combinatorial characterizations of authentication codes
- Cartesian authentication codes from functions with optimal nonlinearity.
- A coding theory construction of new systematic authentication codes
- Combinatorial characterizations of authentication codes. II
- Some constructions of systematic authentication codes using Galois rings
- \(p\)-ary and \(q\)-ary versions of certain results about bent functions and resilient functions
- Systematic Authentication Codes From Highly Nonlinear Functions
- Privacy Amplification by Public Discussion
- Cryptographically resilient functions
- Bent polynomials over finite fields