A class of authentication codes with secrecy
From MaRDI portal
Publication:2430699
DOI10.1007/s10623-010-9461-1zbMath1221.94058MaRDI QIDQ2430699
Ferruh Özbudak, Zülfükar Saygı, Elif Kurtaran Özbudak
Publication date: 8 April 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9461-1
94A60: Cryptography
14G50: Applications to coding theory and cryptography of arithmetic geometry
94A62: Authentication, digital signatures and secret sharing
Related Items
Cites Work
- Unnamed Item
- Algebraic function fields and codes
- Three constructions of authentication codes with perfect secrecy
- Some Artin-Schreier type function fields over finite fields with prescribed genus and number of rational places
- A construction for authentication/secrecy codes from certain combinatorial designs
- A lower bound on authentication after having observed a sequence of messages
- Bounds and characterizations of authentication/secrecy schemes
- Three constructions of authentication/secrecy codes
- Highly nonlinear mappings
- Curves related to Coulter's maximal curves
- Codes Which Detect Deception