MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment
Issue date
2014Metadata
Show full item recordAbstract
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 ParallelLPN
performance and its serial version.