Authentication schemes from highly nonlinear functions
From MaRDI portal
Publication:851735
DOI10.1007/s10623-005-6407-0zbMath1192.94113OpenAlexW2036200396MaRDI QIDQ851735
Harald Niederreiter, Claude Carlet, Cunsheng Ding
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-6407-0
Related Items (10)
Authentication codes based on resilient Boolean maps ⋮ On the relationships between perfect nonlinear functions and universal hash families ⋮ Some functions with low differential uniformity ⋮ A Class of Nonbinary Codes and Sequence Families ⋮ Algebraic manipulation detection codes via highly nonlinear functions ⋮ Systematic authentication codes using additive polynomials ⋮ Unnamed Item ⋮ A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields ⋮ Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields ⋮ Quadratic zero-difference balanced functions, APN functions and strongly regular graphs
Cites Work
- Unnamed Item
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Cartesian authentication codes from functions with optimal nonlinearity.
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
- Systematic Authentication Codes From Highly Nonlinear Functions
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
This page was built for publication: Authentication schemes from highly nonlinear functions
