@inproceedings{cf0e3287d366461a968326a1c585198d,
title = "Fast authentication codes based on random polynomial residue classes",
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.",
author = "Valentin Afanassiev and Ben Smeets and Christian Gehrmann",
year = "1997",
doi = "10.1109/ISIT.1997.613090",
language = "English",
isbn = "0780339568",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",
pages = "175",
booktitle = "Proceedings 1997 IEEE International Symposium on Information Theory",
address = "United States",
note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",
}