MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment |
| |
| Affiliation: | 1. Department of Computer Science and Industrial Engineering, INSPIRES Research Institute, Universitat de Lleida, Av. Jaume II 69, E-25001 Lleida, Spain;2. Department of Mathematics, INSPIRES Research Institute, Universitat de Lleida, Av. Jaume II 69, E-25001 Lleida, Spain;3. CONICET, University of San Luis, Argentina;6. Center of Biotechnology and Bioengineering, University of Chile, Chile;1. Simula Research Laboratory, Fornebu, Norway;2. Purdue University, West Lafayette, IN, USA;3. Pacific Northwest National Laboratory, Richland, WA, USA;4. University of Bergen, Norway |
| |
| Abstract: | In recent years, several lightweight cryptographic protocols whose security lies in the assumed intractability of the learning parity with noise (LPN) problem have been proposed. The LPN problem has been shown to be solvable in subexponential time by algorithms that have very large (subexponential) memory requirements, which limits their practical applicability. When the memory resources are constrained, a brute-force search is the only known way of solving the LPN problem. In this paper, we propose a new parallel implementation, called Parallel-LPN, of an enhanced algorithm to solve the LPN problem. We implemented the Parallel-LPN in C and MPI (Message Passing Interface), and it was tested on a cluster system, where we obtained a quasi-linear speedup of approximately 90%. We also proposed a new algorithm by using combinatorial objects that enhances the Parallel-LPN performance and its serial version. |
| |
| Keywords: | Brute-force algorithm LPN problem Parallelization MPI |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
