کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6935336 | 868794 | 2014 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment MPI-based implementation of an enhanced algorithm to solve the LPN problem in a memory-constrained environment](/preview/png/6935336.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Parallel Computing - Volume 40, Issues 5â6, May 2014, Pages 100-112
Journal: Parallel Computing - Volume 40, Issues 5â6, May 2014, Pages 100-112
نویسندگان
Ivan Teixidó, Francesc Sebé, Josep Conde, Francesc Solsona,