A low complexity authentication protocol based on pseudorandomness, randomness and homophonic coding

Abstract

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.