Worst-case to average-case reductions for module lattices
By Adeline Langlois, Damien Stehlé. Designs, Codes and Cryptography, 2014
717 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/b273ed684404cff89e3536daa60a477a35be8733
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Vadim Lyubashevsky
- Chris Peikert
- Léo Ducas
- Damien Stehlé
- Oded Regev
- Peter Schwabe
- Tancrède Lepoint
- Shai Halevi
In Computational Theory and Mathematics
- Vadim Lyubashevsky
- Chris Peikert
- Damien Stehlé
- Léo Ducas
- Oded Regev
- Tancrède Lepoint
- Peter Schwabe
- Eike Kiltz
Citations in the corpus
- On Ideal Lattices and Learning with Errors over Rings (2010, background): “Also, Langlois and Stehl´e [LS13] extended the pseudorandomness of ring-LWE to essentially all choices of the modulus q .”
- CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017, methodology): “2 If one sets the ring Rq to some polynomial ring of dimension greater than 1 and sets k > 1, then the scheme is based on the hardness of the Module-LWE problem [22, 51].”