Three constructions of authentication/secrecy codes
From MaRDI portal
Publication:1770530
DOI10.1016/j.jpaa.2004.08.008zbMath1068.94021MaRDI QIDQ1770530
Cunsheng Ding, Patrick Solé, Arto Salomaa, Xiaojian Tian
Publication date: 7 April 2005
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpaa.2004.08.008
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
94A62: Authentication, digital signatures and secret sharing
Related Items
Systematic authentication codes using additive polynomials, A class of authentication codes with secrecy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three constructions of authentication codes with perfect secrecy
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- A construction for authentication/secrecy codes from certain combinatorial designs
- A lower bound on authentication after having observed a sequence of messages
- A shift register construction of unconditionally secure authentication codes
- Bounds and characterizations of authentication/secrecy schemes
- Highly nonlinear mappings
- Information-theoretic bounds for authentication codes and block designs
- Combinatorial characterizations of authentication codes. II
- Authentication Theory/Coding Theory
- The Combinatorics of Perfect Authentication Schemes
- Codes Which Detect Deception