| Autor: |
Guo, Qian, Johansson, Thomas, Löndahl, Carl |
| Předmět: |
|
| Zdroj: |
Journal of Cryptology; Jan2020, Vol. 33 Issue 1, p1-33, 33p |
| Abstrakt: |
We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a linear code. It outperforms previous methods for many parameter choices. In particular, we can now solve the (512 , 1 8) LPN instance with complexity less than 2 80 operations in expectation, indicating that cryptographic schemes like HB variants and LPN-C should increase their parameter size for 80-bit security. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink