Logarithm Cartesian authentication codes.
From MaRDI portal
Publication:1398375
DOI10.1016/S0890-5401(03)00053-1zbMath1038.94010OpenAlexW2055369286MaRDI QIDQ1398375
T. W. Sze, Cunsheng Ding, Samuel T. Chanson, Matthew G. Parker, Tor Helleseth
Publication date: 29 July 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00053-1
Related Items (4)
Constructions of external difference families and disjoint difference families ⋮ Two new classes of binary sequence pairs with three-level cross-correlation ⋮ New methods of construction of Cartesian authentication codes from geometries over finite commutative rings ⋮ Highly nonlinear mappings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Combinatorial characterizations of authentication codes
- Universal hashing and geometric codes
- Cartesian authentication codes from functions with optimal nonlinearity.
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Combinatorial characterizations of authentication codes. II
- Codes Which Detect Deception
- Constructions of authentication codes from algebraic curves over finite fields
This page was built for publication: Logarithm Cartesian authentication codes.