Optimization of LPN Solving Algorithms

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. Our results bring improvements over the existing work, i.e. we improve the results of the covering code from ASIACRYPT’14 and EUROCRYPT’16. Furthermore, we propose concrete practical codes and a method to find good codes.


Editor(s):
Cheon, Jung Hee
Takagi, Tsuyoshi
Published in:
Advances in Cryptology - {ASIACRYPT} 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part {I}, 10031
Presented at:
22nd Annual International Conference on the Theory and Applications of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016
Year:
2016
Publisher:
Berlin, Springer-Verlag Berlin
ISBN:
978-3-662-53887-6
978-3-662-53886-9
Keywords:
Laboratories:




 Record created 2016-12-19, last modified 2018-05-09

Additional material:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)