Fast authentication codes based on random polynomial residue classes

Author

Afanassiev, Valentin ; Smeets, Ben ; Gehrmann, Christian

Author_Institution

Inst. of Problems of Inf., Acad. of Sci., Moscow, Russia

fYear

1997

fDate

29 Jun-4 Jul 1997

Firstpage

175

Abstract

The verification of the authenticity of a text document or a datafile is one of the main applications of cryptographic techniques. A common used technique for this purpose is the application of a message authentication code (MAC). Usually the MAC computation has to be done in software. Based on the relationship between error-correcting codes and so-called families of almost universal hash functions, and the error-correcting codes using polynomial residue classes we describe an efficient procedure for a MAC computation which is much faster than the standard MAC constructions using MD5 or SHA and uses much less key bits than the fast MACs based on bucket hashing

Keywords

computational complexity; cryptography; error correction codes; message authentication; polynomials; bucket hashing; computational complexity; cryptographic techniques; datafile; error-correcting codes; fast authentication codes; message authentication code; random polynomial residue classes; software; text document; universal hash functions; Application software; Code standards; Cryptography; Error correction codes; Hydrogen; Information technology; Information theory; Message authentication;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on

Conference_Location

Ulm

Print_ISBN

0-7803-3956-8

Type

conf

DOI

10.1109/ISIT.1997.613090

Filename

613090