Authors: Mihaljević, Miodrag J. 
Watanabe, Hajime
Imai, Hideki
Title: A cellular automata based HB#-like low complexity authentication technique
Conference: 2008 International Symposium on Information Theory and its Applications, ISITA2008, 7-10 Dec. 2008
Issue Date: 1-Dec-2008
ISBN: 978-1-424-42069-8
DOI: 10.1109/ISITA.2008.4895617
This paper addresses the problem of developing low-complexity authentication challenge-response protocols based on employment of pseudorandom sequences generated by cellular automata (CA). The proposed protocol is an improved variant of the recently reported HB# protocol. Oppositely from the reported HB-protocols the proposed one is based in the following: (i) The response vector consists of the effective bits and dummy bits embedded in a pseudorandom manner: The effective bits are corrupted parity-check bits, and the dummy ones are pure random bits; (ii) The states of secret key controlled CA are employed for generation of the effective response bits and for the pseudorandom embedding of the effective and the dummy bits. The proposed protocol provides a framework for increasing the security and reducing the implementation complexity and communications overhead in comparison with the previously reported HB# one.
Publisher: IEEE
Project: Advanced methods for cryptology and information processing 

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.