Cryptology ePrint Archive: Report 2016/288

Optimization of LPN Solving Algorithms

Sonia Bogos and Serge Vaudenay

Abstract: In this article we focus on constructing an algorithm that automatizes the generation of LPN solving algorithms from the considered parameters. When searching for an algorithm to solve an LPN instance, we make use of the existing techniques and optimize their use. We formalize an LPN algorithm as a path in a graph G and our algorithm is searching for the optimal paths in this graph. The results bring improvements over the existing work by a factor from 2^8 to 2^{10}, i.e. we improve the results of the covering code from ASIACRYPT'14. Furthermore, we propose concrete practical codes and a method to find good codes.

Category / Keywords: public-key cryptography /

Date: received 15 Mar 2016

Contact author: soniamihaela bogos at epfl ch

Available format(s): PDF | BibTeX Citation

Version: 20160317:161431 (All versions of this report)

Short URL: ia.cr/2016/288

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]