Abstract. The intractability of solving the LPN problem serves as the security source of many lightweight/post-quantum cryptographic.

This paper describes the first efficient algorithm for the single-list k-sum problem which naturally arises from the various BKW reduction settings, ...

Jan 1, 2020 · In this paper, we propose a new LPN solving algorithm using covering codes in the existing algorithmic framework with a new data structure of numerical value.

Abstract. We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to ...

Sep 1, 2014 · We present a new algorithm for solving the RING-LPN problem in the case when the polynomial used is reducible. It greatly outperforms previous ...

Oct 15, 2019 · 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.

In this paper, we propose a new LPN solving algorithm using covering codes in the existing algorithmic framework with a new data structure of numerical value ...

Here, we improve the previous best known algorithm proposed by Blum, Kalai, and Wasserman for solving the LPN problem. This new algorithm yields an attack for ...

We present a new algorithm for solving the Ring-LPN problem in the case when the polynomial used is reducible. It greatly outperforms the previous algorithms ...

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 ...