The Combinatorics of Perfect Authentication Schemes
- 1 February 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 7 (1) , 102-107
- https://doi.org/10.1137/s0895480190178187
Abstract
The purpose of this paper is to prove the equivalence of perfect authentication schemes and maximum distance separable codes.Keywords
This publication has 4 references indexed in Scilit:
- The combinatorics of authentication and secrecy codesJournal of Cryptology, 1990
- Cartesian Authentication SchemesPublished by Springer Nature ,1990
- Information-theoretic bounds for authentication schemesJournal of Cryptology, 1990
- Finite GeometriesPublished by Springer Nature ,1968