By Topic

Long message authentication using pseudo-random functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
C. Gehrmann ; Dept. of Inf. Theory, Lund Univ., Sweden

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

Published in:

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

Date of Conference:

27 Jun-1 Jul 1994