The Learning with Rank Errors problem and an application to symmetric authentication
Slim Bettaieb, Loïc Bidoux, Yann Connan, Philippe Gaborit, Adrien Hauteville · 2018
In this paper, we introduce a new hard problem opening up the construction for new quantum resistant cryptographic schemes. The latter is called Learning Rank with Errors (LRE) and can be seen as an adaptation of the LPN problem to the rank metric setting. In addition, we describe HBLRE, an HB-like authentication protocol that constitutes an application of the aforementioned problem. We also prove that HTLRE is secure against passive attacks and compare its parameters to those of the initial HB scheme.