Authentication schemes from highly nonlinear functions
From MaRDI portal
Publication:851735
DOI10.1007/S10623-005-6407-0zbMATH Open1192.94113OpenAlexW2036200396MaRDI QIDQ851735FDOQ851735
Authors: Claude Carlet, Cunsheng Ding, Harald Niederreiter 
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
Recommendations
Cites Work
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Title not available (Why is that?)
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- Cartesian authentication codes from functions with optimal nonlinearity.
- Systematic Authentication Codes From Highly Nonlinear Functions
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
Cited In (12)
- On the relationships between perfect nonlinear functions and universal hash families
- Quadratic zero-difference balanced functions, APN functions and strongly regular graphs
- Some functions with low differential uniformity
- A Class of Nonbinary Codes and Sequence Families
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
- Authentication codes based on resilient Boolean maps
- Construction and Analysis of Cryptographic Functions
- Systematic authentication codes using additive polynomials
- Algebraic manipulation detection codes via highly nonlinear functions
- Systematic Authentication Codes From Highly Nonlinear Functions
- Construction of multi-receiver multi-fold authentication codes from singular symplectic geometry over finite fields
- Title not available (Why is that?)
This page was built for publication: Authentication schemes from highly nonlinear functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851735)
