Fast authentication codes based on random polynomial residue classes
(1997) 1997 IEEE International Symposium on Information Theory, ISIT 1997 In IEEE International Symposium on Information Theory - Proceedings p.175-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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/cf0e3287-d366-461a-9683-26a1c585198d
- author
- Afanassiev, Valentin ; Smeets, Ben LU and Gehrmann, Christian LU
- organization
- publishing date
- 1997
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Proceedings 1997 IEEE International Symposium on Information Theory
- series title
- IEEE International Symposium on Information Theory - Proceedings
- article number
- 613090
- pages
- 1 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 1997 IEEE International Symposium on Information Theory, ISIT 1997
- conference location
- Ulm, Germany
- conference dates
- 1997-06-29 - 1997-07-04
- external identifiers
-
- scopus:0030683033
- ISSN
- 2157-8095
- ISBN
- 0780339568
- 9780780339569
- DOI
- 10.1109/ISIT.1997.613090
- language
- English
- LU publication?
- yes
- id
- cf0e3287-d366-461a-9683-26a1c585198d
- date added to LUP
- 2021-11-05 02:34:38
- date last changed
- 2022-02-02 01:10:57
@inproceedings{cf0e3287-d366-461a-9683-26a1c585198d, abstract = {{<p>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.</p>}}, author = {{Afanassiev, Valentin and Smeets, Ben and Gehrmann, Christian}}, booktitle = {{Proceedings 1997 IEEE International Symposium on Information Theory}}, isbn = {{0780339568}}, issn = {{2157-8095}}, language = {{eng}}, pages = {{175--175}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE International Symposium on Information Theory - Proceedings}}, title = {{Fast authentication codes based on random polynomial residue classes}}, url = {{http://dx.doi.org/10.1109/ISIT.1997.613090}}, doi = {{10.1109/ISIT.1997.613090}}, year = {{1997}}, }