New directions in nearest neighbor searching with applications to lattice sieving

By Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven. IACR Cryptology ePrint Archive, 2016

390 citations recorded by the source corpus.

Subfields: Aerospace Engineering, Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/f9bf9db49104d0e9f0c7354c493da304df814ba8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

1. Daniel J. Bernstein

In Computer Networks and Communications

1. Daniele Micciancio
2. Vinod Vaikuntanathan
3. Léo Ducas
4. Shai Halevi
5. Daniel J. Bernstein
6. Amit Sahai
7. Sergey Gorbunov
8. Shafi Goldwasser

In Computer Vision and Pattern Recognition

1. Vinod Vaikuntanathan
2. Shai Halevi
3. Michael Naehrig
4. Melissa Chase
5. Kristin E. Lauter
6. Hao Chen
7. Jintai Ding
8. Shafi Goldwasser

Citations in the corpus

• Post-quantum cryptography (2008, positive): “As another example, recent attacks [34, 35, 36] that work for arbitrary lattices, without exploiting any polynomial structure, have smaller exponents than the best such attacks known just a few years ago.”
• Homomorphic Encryption Standard (2019, background): “4 based on some experimental evidence in (Becker et al., 2016).”
• Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (2020, neutral): “4 [BDGL16].”
• Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE (2016, methodology): “292, which is provided by the sieve algorithm of [12]; and, in the context of quantum attacks, the best known constant is cQ = log2 √ 13/9 ≈ 0.”