Unfortunately, the creation of the LWE instances was bugged and resulted in unbreakable challenges. We removed all challenges from the web page and are currently rerunning the protocol to create new instances. The available instances are already updated, the missing (grey) instances will be added soon. Sorry for any inconveniences.
Welcome to the Learning With Errors (LWE) challenge.
The LWE problem is to recover s, given an instance (A, b), where A is an m×n matrix over ℤq and b = As + e is a vector of length m over ℤq. Both the matrix A and the target vector s are sampled uniformly random, while the error vector e is sampled from the Gaussian distribution with parameter σ.
This page presents sample instances for testing algorithms that solve the LWE problem. The main goal of this challenge is to help assessing the hardness of the LWE problem in practice. Furthermore, it is designed to provide a comparison of different types of LWE solvers, like Babai's Nearest Plane , BKW , or reduction to the Shortest Vector Problem .
Since current results seem to imply that the hardness of LWE instances mainly depends on the "relative error size" α = σ / q and the dimension n, this page provides LWE instances for a wide range of α and n. All challenges were created using a multi-party computation protocol executed by the Eindhoven University of Technology, the University of California, San Diego and the Technische Universität Darmstadt. The protocol ensures that none of the participating parties has additional information about the solutions.
How to participate
- Select one of the unsolved LWE challenges (by clicking on a green cell) from below and download it.
- Find the secret vector s.
- Submit your solution.
- Babai: On Lovász' lattice reduction and the nearest lattice point problem; Combinatorica (1986)
- Albrecht, Cid, Faugère, Fitzpatrick, Perret: On the complexity of the BKW algorithm on LWE; Designs, Codes and Cryptography (2013)
- Albrecht, Fitzpatrick, Göpfert: On the efficacy of solving LWE by reduction to unique-SVP; ICISC (2013)
Here is an overview of all challenges. By clicking on an a green cell (representing an unsolved challenge), you can either download the instance or go directly to the submission page to submit a solution. Clicking on a red cell (representing a solved instance), on the other hand, allows to either download the instance or see details of the submission. Cells in grey are still under generation and will be updated, once they are generated by the participating parties.
|Date||Dimension||Relative error||Contestant||Error norm||Submission|
|2016-10-24||70||0.005||Yuntao Wang;Yoshinori Aono; Takuya Hayashi; Tsuyoshi Takagi||1731.68||Details|
|2016-08-09||40||0.020||Rui Xu; Kazuhide Fukushima; Shinsaku Kiyomoto; Tsuyoshi Takagi||1302.90||Details|
|2016-08-02||65||0.005||Yuntao Wang; Yoshinori Aono; Takuya Hayashi; Tsuyoshi Takagi||1373.69||Details|
Only the five latest successful submissions are shown here. The full hall of fame can be found here. Toy challenges are excluded from both lists.