Cryptology ePrint Archive: Report 2018/988

On the Hardness of Learning With Errors with Binary Secrets

Daniele Micciancio

Abstract: We give a simple proof that the decisional Learning With Errors (LWE) problem with binary secrets (and an arbitrary polynomial number of samples) is at least as hard as the standard LWE problem (with unrestricted, uniformly random secrets, and a bounded, quasi-linear number of samples). This proves that the binary-secret LWE distribution is pseudorandom, under standard worst-case complexity assumptions on lattice problems. Our results are similar to those proved by (Brakerski, Langlois, Peikert, Regev and Stehle, STOC 2013), but provide a shorter, more direct proof, and a small improvement in the noise growth of the reduction.

Category / Keywords: foundations / complexity theory, lattice based cryptography, foundations, pseuro-randomness

Original Publication (in the same form): Theory of Computing (to appear, http://theoryofcomputing.org/)

Date: received 14 Oct 2018

Contact author: daniele at cs ucsd edu

Available format(s): PDF | BibTeX Citation

Version: 20181018:122753 (All versions of this report)

Short URL: ia.cr/2018/988


[ Cryptology ePrint archive ]