A New Instance of a Lightweight Authentication Protocol Based on the LPN Problem.

Authentication is one of the most important issues in the information technology field and, primarily, in Cryptography. With the diffusion of devices for the Internet of things, the interest in efficient and with low computational loads authentication protocols, has increased more and more in the last few years. Indeed, traditional protocols, based on symmetric primitives and, in general, on pseudo-random functions, are not suitable for computationally constrained devices. On the other hand, one of the most interesting families of protocols for such devices seems to be the one based on the learning parity with noise problem. In this paper, building on some previous works, we propose a new instance of a lightweight authentication protocol constructed on this problem. We describe some optimizations which could be employed to improve the efficiency of an implementation, and we give also a look at the real world, discussing the applicability of our proposal to several devices available on the market.