Reduce and Prange: Revisiting Prange's Information Set Decoding for LPN and RSD

ePrint Report: Reduce and Prange: Revisiting Prange's Information Set Decoding for LPN and RSD

Jiseung Kim, Changmin Lee

The learning parity with noise (LPN) problem has been widely utilized in classical cryptography to construct cryptographic primitives. Various variants of LPN have been proposed, including LPN over large fields and LPN with regular noise, depending on the underlying space and the noise regularity. These LPN variants have proven to be useful in constructing cryptographic primitives.


We propose an improvement to the …

cryptographic cryptography decoding eprint report information kim large lee noise problem report