Cartesian authentication codes from functions with optimal nonlinearity.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 54007 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 1303147 (Why is no real title available?)
- scientific article; zbMATH DE number 503195 (Why is no real title available?)
- scientific article; zbMATH DE number 1500491 (Why is no real title available?)
- scientific article; zbMATH DE number 1390148 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- A new construction of circulant \(GH(p^ 2; \mathbb{Z}_ p)\)
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Authentication Theory/Coding Theory
- Circulant \(GH(p^ 2;Z_ p)\) exist for all primes \(p\)
- Codes Which Detect Deception
- Combinatorial characterizations of authentication codes
- Combinatorial characterizations of authentication codes. II
- Communication Theory of Secrecy Systems*
- Constructions of authentication codes from algebraic curves over finite fields
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- New families of almost perfect nonlinear power mappings
- On Almost Perfect Nonlinear Permutations
- On ``bent functions
- Recent results on binary bent functions
- Some power mappings with low differential uniformity
- The combinatorics of authentication and secrecy codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Universal hash functions from exponential sums over finite fields and Galois rings
- Universal hashing and geometric codes
Cited in
(13)- Authentication codes from difference balanced functions
- Authentication codes and bipartite graphs
- Algebraic manipulation detection codes via highly nonlinear functions
- Systematic Authentication Codes From Highly Nonlinear Functions
- On the relationships between perfect nonlinear functions and universal hash families
- scientific article; zbMATH DE number 1810257 (Why is no real title available?)
- Logarithm Cartesian authentication codes.
- Some functions with low differential uniformity
- Optimal authentication codes from difference balanced functions
- Authentication schemes from highly nonlinear functions
- The arithmetic of Carmichael quotients
- New constructions of systematic authentication codes from three classes of cyclic codes
- Authentication codes based on resilient Boolean maps
This page was built for publication: Cartesian authentication codes from functions with optimal nonlinearity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401188)
