Nov 4, 2021 · The algorithm has to run faster than a brute force algorithm which tries all the {n \atopwithdelims ()k} combinations to find the sparse secret.

Jul 28, 2021 · Abstract. We consider the Learning Parity with Noise (LPN) problem with sparse secret, where the secret vector s of dimension n has Hamming ...

Duration: 21:58
Posted: Nov 3, 2021

ACM '03] as well as techniques from Fourier analysis for p-biased distributions. Our algorithm achieves asymptotic improvement in the exponent compared to prior ...

Nov 8, 2021 · We first consider the constant error rate setting, and in this case present a new algorithm that leverages a subroutine from the acclaimed BKW ...

We present a new algorithm in this setting that requires only a polynomial number of samples and achieves asymptotic improvement in the exponent compared to ...

BKW Meets Fourier New Algorithms for LPN with Sparse Parities · Dana Dachman ... sparse secret there is another algorithm that outperforms BKW and its variants.

three new algorithms for the case where the secret is sparse. Our results show that for a sparse secret the BKW family of algorithms is outperformed by an ...

• Quasipolynomial time algorithms for small characteristic fields. Not known ... [6] BKW Meets Fourier: New Algorithms for LPN with Sparse Parities. D ...