Cartesian authentication codes from functions with optimal nonlinearity.
From MaRDI portal
Publication:1401188
DOI10.1016/S0304-3975(02)00077-4zbMath1044.68050OpenAlexW2081500979MaRDI QIDQ1401188
Cunsheng Ding, Arto Salomaa, Samuel T. Chanson
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00077-4
Related Items (9)
Authentication codes based on resilient Boolean maps ⋮ Authentication schemes from highly nonlinear functions ⋮ The arithmetic of Carmichael quotients ⋮ On the relationships between perfect nonlinear functions and universal hash families ⋮ Logarithm Cartesian authentication codes. ⋮ Authentication codes and bipartite graphs ⋮ Some functions with low differential uniformity ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ Algebraic manipulation detection codes via highly nonlinear functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The combinatorics of authentication and secrecy codes
- Combinatorial characterizations of authentication codes
- Circulant \(GH(p^ 2;Z_ p)\) exist for all primes \(p\)
- A new construction of circulant \(GH(p^ 2; \mathbb{Z}_ p)\)
- On ``bent functions
- Universal hashing and geometric codes
- Some power mappings with low differential uniformity
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Combinatorial characterizations of authentication codes. II
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
- Communication Theory of Secrecy Systems*
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Constructions of authentication codes from algebraic curves over finite fields
- New families of almost perfect nonlinear power mappings
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- On Almost Perfect Nonlinear Permutations
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
This page was built for publication: Cartesian authentication codes from functions with optimal nonlinearity.
