Authors: Mihaljević, Miodrag J. 
Watanabe, Hajime
Imai, Hideki
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A low complexity authentication protocol based on pseudorandomness, randomness and homophonic coding
Journal: ISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
First page: 690
Last page: 695
Issue Date: 1-Dec-2010
ISBN: 9781424460175
DOI: 10.1109/ISITA.2010.5649666
An authentication protocol is proposed which originates from the elements of the authentication protocols belonging to the HB-family and the protocols based on employment of pseudorandom number generators. Desired features of the proposed protocol have been achieved via combining the pseudorandomnes generated by a compact keystream generator, randomness and dedicated homophonic and error-correction coding. It is shown that implementation complexity of the protocol is low. Security of the proposed protocol is considered from an information-theoretic and a computational-complexity points of view assuming the passive attacking The performed security evaluation yields an indication for a conjecture on the security within certain active attacking scenarios as well.
Keywords: Authentication | Information theory | Network protocols | Number theory | Random processes | Spectroscopy
Publisher: IEEE
Project: Advanced methods for cryptology and information processing 

Show full item record


checked on Dec 7, 2023

Page view(s)

checked on Dec 7, 2023

Google ScholarTM




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