A shift register construction of unconditionally secure authentication codes

DOI10.1007/BF01388561zbMath0790.94011OpenAlexW2147914930MaRDI QIDQ1321559

Thomas Johansson

Publication date: 26 June 1994

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01388561

zbMATH Keywords

finite geometriesauthentication codescombinatorial designsimpersonation attackssubstitution attacksauthentication problemLFSR-sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (6)

Bounds And Constructions For Threshold Shared Generation Of Authenticators ⋮ A new multi-linear universal hash family ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ Authentication codes: An area where coding and cryptology meet ⋮ Fast message authentication using efficient polynomial evaluation ⋮ Three constructions of authentication/secrecy codes

Cites Work

• Some constructions and bounds for authentication codes
• Codes Which Detect Deception
• Unnamed Item
• Unnamed Item

This page was built for publication: A shift register construction of unconditionally secure authentication codes