DocumentCode
2625520
Title
Long message authentication using pseudo-random functions
Author
Gehrmann, Christian
Author_Institution
Dept. of Inf. Theory, Lund Univ., Sweden
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
493
Abstract
We give a method, using pseudo-random functions, to construct Cartesian authentication codes, that are close to the asymptotic Varshamov-Gilbert bound for Cartesian A-codes. The proposed method has a better asymptotic behaviour, than the until now best known constructions. The results are also used to analyze the multi-round authentication protocol
Keywords
error correction codes; message authentication; protocols; random functions; Cartesian A-codes; Cartesian authentication codes; asymptotic Varshamov-Gilbert bound; asymptotic behaviour; error correcting codes; long message authentication; multi-round authentication protocol; pseudo-random functions; Cryptography; Error correction codes; Gaussian distribution; Information security; Information theory; Message authentication; Protocols; Random sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.395108
Filename
395108
Link To Document