By Topic

A secure authentication system based on variable-length codes

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
$31 $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

2 Author(s)
Speidel, U. ; Dept. of Comput. Sci., Univ. of Auckland, Auckland, New Zealand ; Gulliver, T.A.

This paper proposes an authentication protocol between two parties. The protocol uses a shared secret key, representing a large variable-length code and a lookup table representing a permutation. The authenticating parties exchange randomly generated messages. Both challenge and response messages consist of multiple codewords from the code, and these messages are each truncated to a fixed number of symbols. The actual information to be recovered by the respondent are the codeword lengths used in the challenge message. These lengths are re-encoded to different lengths via the lookup table, and randomly chosen codewords with these re-encoded lengths are used in the response.

Published in:

Information Theory and its Applications (ISITA), 2010 International Symposium on

Date of Conference:

17-20 Oct. 2010