Cryptographic Authentication of Time-Invariant Quantities

Autor: Carl H. W. Meyer, Stephen M. Matyas, Richard Edward Lennon
Rok vydání: 1981
Předmět:
Zdroj: IEEE Transactions on Communications. 29:773-777
ISSN: 0096-2244
DOI: 10.1109/tcom.1981.1095067
Popis: With any strong cryptographic algorithm, such as the data encryption standard (DES), it is possible to devise protocols for authentication. One technique, which allows arbitrary, time-invariant quantities (such as encrypted keys and passwords) to be authenticated, is based upon a secret cryptographic (master) key residing in a host processor. Each quantity to be authenticated has a corresponding precomputed test pattern. At any later time, the test pattern can be used together with the quantity to be authenticated to generate a nonsecret verification pattern. The verification pattern can in turn be used as the basis for accepting or rejecting the quantity to be authenticated.
Databáze: OpenAIRE