On the cardinality of systematic authentication codes via error-correcting codes
From MaRDI portal
Publication:4885686
DOI10.1109/18.485725zbMATH Open0855.94016OpenAlexW2005297165MaRDI QIDQ4885686FDOQ4885686
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
Recommendations
authenticationerror-correcting codeuniversal hash functionsA-distanceconcatenated Reed-Solomon codes
Cited In (17)
- Коды аутентификации с секретностью (обзор)
- Title not available (Why is that?)
- Simple and Efficient Systematic a-Codes from Error Correcting Codes
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Title not available (Why is that?)
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- Title not available (Why is that?)
- Authentication encryption based on authentication code with secrecy
- New constructions of systematic authentication codes from three classes of cyclic codes
- A coding theory construction of new systematic authentication codes
- AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS
- Authentication codes and bipartite graphs
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
- A new multi-linear universal hash family
- Title not available (Why is that?)
- Error-correcting codes for authentication and subliminal channels
- Title not available (Why is that?)
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)
