Ring Learning With Errors
Ring Learning with Errors is a computational lattice-based cryptographic problem that, as an extension of the Learning with Errors framework, operates over polynomial rings to enable efficient post-quantum cryptosystems with strong security guarantees based on the hardness of approximating short vectors in structured lattices.
75
Publications
6.4K
Citations
225
Authors
125
Institutions
Publications per year
2017–2026
55
75
Efficient Fully Homomorphic Encryption from (Standard) LWE
Zvika Brakerski, Vinod Vaikuntanathan · 2011 · 1.5K citations
On Ideal Lattices and Learning with Errors over Rings
Vadim Lyubashevsky, Chris Peikert, Oded Regev · Journal of the ACM · 2013 · 823 citations
Post-quantum key exchange - a new hope.
Erdem Alkım, Léo Ducas, Thomas Pöppelmann et al. · IACR Cryptology ePrint Archive · 2015 · 419 citations
1–5 of 75
225
6
h-index
6
h-index
Massachusetts Institute of Technology, United States
5 publications · 2.2K citations
5
h-index
4
h-index
3
h-index
1–5 of 225
125

Villanova University
Radnor, United States
6 h-index
23 publications
705 citations
Tsinghua University
Beijing, China
4 h-index
9 publications
296 citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
4 h-index
10 publications
203 citations
KU Leuven
Leuven, Belgium
3 h-index
10 publications
744 citations

Weizmann Institute of Science
Rehovot, Israel
3 h-index
3 publications
2K citations

University of Toronto
Toronto, Canada
3 h-index
4 publications
2.2K citations
Institute of Microelectronics
Beijing, China
3 h-index
5 publications
213 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
196 citations
1–8 of 125
7 publications · 172 citations
7
h-index
Repository · 5 publications · 672 citations
5
h-index
4 publications · 195 citations
4
h-index
3 publications · 132 citations
3
h-index
3 publications · 218 citations
3
h-index
1–5