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

DOI10.1109/18.485725zbMath0855.94016OpenAlexW2005297165MaRDI QIDQ4885686

Thomas Johansson, Ben Smeets, 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

authenticationuniversal hash functionserror-correcting codeA-distanceconcatenated Reed-Solomon codes

Mathematics Subject Classification ID

Cryptography (94A60) Cyclic codes (94B15)

Related Items

AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS ⋮ Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings ⋮ A new multi-linear universal hash family ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Authentication codes and bipartite graphs ⋮ Authentication encryption based on authentication code with secrecy ⋮ A coding theory construction of new systematic authentication codes ⋮ Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ Коды аутентификации с секретностью (обзор) ⋮ Unnamed Item

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