On the cardinality of systematic authentication codes via error-correcting codes

DOI10.1109/18.485725MaRDI QIDQ4885686zbMATH OpenOpenAlexFDO

Authors Ben Smeets, Thomas Johansson, Grigory Kabatiansky

Publication date 28 January 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.485725

zbMATH Keywords

authenticationerror-correcting codeuniversal hash functionsA-distanceconcatenated Reed-Solomon codes

Mathematics Subject Classification ID

Cryptography (94A60) Cyclic codes (94B15)

Recommendations

• Authentication codes: an area where coding and cryptology meet
• scientific article; zbMATH DE number 1394290
• Simple and Efficient Systematic a-Codes from Error Correcting Codes
• Linear authentication codes: bounds and constructions
• scientific article; zbMATH DE number 1857521

Cited in

(18)

• Authentication codes from difference balanced functions
• Authentication codes and bipartite graphs
• scientific article; zbMATH DE number 7310087 (Why is no real title available?)
• Authentication encryption based on authentication code with secrecy
• scientific article; zbMATH DE number 1857521 (Why is no real title available?)
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• scientific article; zbMATH DE number 2170431 (Why is no real title available?)
• A new multi-linear universal hash family
• scientific article; zbMATH DE number 1394290 (Why is no real title available?)
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• A coding theory construction of new systematic authentication codes
• scientific article; zbMATH DE number 5846777 (Why is no real title available?)
• Коды аутентификации с секретностью (обзор)
• Authentication codes: an area where coding and cryptology meet
• Error-correcting codes for authentication and subliminal channels
• New constructions of systematic authentication codes from three classes of cyclic codes
• Simple and Efficient Systematic a-Codes from Error Correcting Codes
• Universal hash functions from exponential sums over finite fields and Galois rings

This page was built for publication: On the cardinality of systematic authentication codes via error-correcting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885686)