Fetching the paper…
Reading the bibliography…
One of the founding results of lattice based cryptography is a quantum reduction from the Short Integer Solution problem to the Learning with Errors problem introduced by Regev.
A mathematical theory of communication
Claude E. Shannon · 1948
Earlier work this paper cites.
The use of information sets in decoding cyclic codes
Eugene Prange · 1962
Earlier work this paper cites.
A Public-Key System Based on Algebraic Coding Theory
Robert J. McEliece · 1978
Earlier work this paper cites.
How to share a secret
Adi Shamir · 1979
Earlier work this paper cites.
One way functions and pseudorandom generators
Leonid A Levin · 1987
Earlier work this paper cites.
A method for finding codewords of small weight
Jacques Stern · 1988
Earlier work this paper cites.
Two decoding algorithms for linear codes
Il’ya Dumer · 1989
Earlier work this paper cites.
A new identification scheme based on syndrome decoding
Jacques Stern · 1993
Earlier work this paper cites.
Generating hard instances of lattice problems (extended abstract)
Miklós Ajtai · 1996
Earlier work this paper cites.
An efficient pseudo-random generator provably as secure as syndrome decoding
Jean-Bernard Fischer and Jacques Stern · 1996
Earlier work this paper cites.
Optimum measurements for discrimination among symmetric quantum states and parameter estimation
Masahi Ban, Keiko Kurokawa, Rei Momose, and Osamu Hirota · 1997
Earlier work this paper cites.
Finite fields
Rudolf Lidl and Harald Niederreiter · 1997
Earlier work this paper cites.
Optimum unambiguous discrimination between linearly independent symmetric states
Anthony Chefles and Stephen M. Barnett · 1998
Earlier work this paper cites.
Property testing and its connection to learning and approximation
Oded Goldreich, Shafi Goldwasser, and Dana Ron · 1998
Earlier work this paper cites.
Reversing quantum dynamics with near-optimal quantum and classical fidelity
H. Barnum and E. Knill · 2002
Earlier work this paper cites.
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum, Adam Kalai, and Hal Wasserman · 2003
Earlier work this paper cites.
The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem
Vadim Lyubashevsky · 2005
Cited alongside, same era.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005
Cited alongside, same era.
On the distinguishability of random quantum states
Ashley Montanaro · 2006
Cited alongside, same era.
The PCP theorem by gap amplification
Irit Dinur · 2007
Cited alongside, same era.
Efficient public key encryption based on ideal lattices
Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, and Keita Xagawa · 2009
Cited alongside, same era.
Grover vs. McEliece
Daniel J. Bernstein · 2010
Cited alongside, same era.
On computing nearest neighbors with applications to decoding of binary linear codes
Alexander May and Ilya Ozerov · 2015
Later among the works it cites.
Search problems in cryptography
Thijs Laarhoven · 2016
Later among the works it cites.
Low-complexity cryptographic hash functions
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, and Vinod Vaikuntanathan · 2017
Later among the works it cites.
Optimizing BJMM with Nearest Neighbors: Full Decoding in 2 2 / 21 n 2^{2/21n} and McEliece Security
Leif Both and Alexander May · 2017
Later among the works it cites.
Quantum information set decoding algorithms
Ghazal Kachigar and Jean-Pierre Tillich · 2017
Later among the works it cites.
Worst-case hardness for LPN and cryptographic hashing via code smoothing
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, and Daniel Wichs · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sanjeev Arora and Rong Ge · 2011
Cited alongside, same era.
More on average case vs approximation complexity
Michael Alekhnovich · 2011
Cited alongside, same era.
Efficient fully homomorphic encryption from (standard) LWE
Zvika Brakerski and Vinod Vaikuntanathan · 2011
Cited alongside, same era.
Decoding random linear codes in O ( 2 0.054 n ) O(2^{0.054n})
Alexander May, Alexander Meurer, and Enrico Thomae · 2011
Cited alongside, same era.
Decoding random binary linear codes in 2 n / 20 2^{n/20} : How 1 + 1 = 0 1+1=0 improves information set decoding
Anja Becker, Antoine Joux, Alexander May, and Alexander Meurer · 2012
Cited alongside, same era.
MDPC-McEliece: New McEliece variants from moderate density parity-check codes, 2012
Rafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, and Paulo S. L. M. Barreto · 2012
Cited alongside, same era.
Later among the works it cites.
Collision resistant hashing from sub-exponential learning parity with noise
Yu Yu, Jiang Zhang, Jian Weng, Chun Guo, and Xiangxue Li · 2019
Later among the works it cites.
Lattice sieving via quantum random walks
André Chailloux and Johanna Loyer · 2021
Later among the works it cites.
Classic McEliece (merger of Classic McEliece and NTS-KEM)
Martin Albrecht, Daniel J. Bernstein, Tung Chou, Carlos Cid, Jan Gilcher, Tanja Lange, Varun Maram, Ingo von Maurich, Rafael Mizoczki, Ruben Niederhagen, Edoardo Persichetti, Kenneth Paterson, Christiane Peters, Peter Schwabe, Nicolas Sendrier, Jakub Szefer, Cen Jung Tjhai, Martin Tomlinson, and Wang Wen · 2022
Later among the works it cites.
Statistical decoding 2.0: Reducing decoding to LPN
Kevin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, and Jean-Pierre Tillich · 2022
Later among the works it cites.
Quantum algorithms for variants of average-case lattice problems via filtering
Yilei Chen, Qipeng Liu, and Mark Zhandry · 2022
Later among the works it cites.
Worst and average case hardness of decoding via smoothing bounds
Thomas Debris-Alazard and Nicolas Resch · 2022
Later among the works it cites.
Verifiable quantum advantage without structure
Takahashi Yamakawa and Mark Zhandry · 2022
Later among the works it cites.
Code-based cryptography: Lecture notes, arxiv cs.cr 2304.03541, 2023
Thomas Debris-Alazard · 2023
Closest in time.
Quantum reduction of finding short code vectors to the decoding problem
Thomas Debris-Alazard, Maxime Remaud, and Jean-Pierre Tillich · 2023
Closest in time.