Ring Learning With Errors Problem
The Ring Learning with Errors Problem is a computational hardness assumption in lattice-based cryptography that belongs to the class of learning problems with noise, distinguished by its reliance on polynomial ring structures over finite fields to enhance efficiency and security in cryptographic constructions.
41
Publications
2.7K
Citations
122
Authors
68
Institutions
Publications per year
2017–2026
26
Variants
Ring Lwe Problem
Parents
41
On Ideal Lattices and Learning with Errors over Rings
Vadim Lyubashevsky, Chris Peikert, Oded Regev · Journal of the ACM · 2013 · 823 citations
Joppe W. Bos, Craig Costello, Léo Ducas et al. · 2016 · 300 citations · Full text
1–5 of 41
122
3
h-index
3
h-index
3
h-index
Massachusetts Institute of Technology, United States
3 publications · 177 citations
3
h-index
3
h-index
1–5 of 122
68

Villanova University
Radnor, United States
3 h-index
8 publications
246 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
196 citations
KU Leuven
Leuven, Belgium
3 h-index
10 publications
744 citations
Tsinghua University
Beijing, China
2 h-index
5 publications
144 citations
École Normale Supérieure
Bujumbura, Burundi
2 h-index
2 publications
834 citations
iMinds
Ghent, Belgium
2 h-index
7 publications
591 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
834 citations
Courant Institute of Mathematical Sciences
New York, United States
2 h-index
2 publications
834 citations
1–8 of 68
Repository · 4 publications · 253 citations
4
h-index
3 publications · 128 citations
3
h-index
2 publications · 165 citations
2
h-index
2 publications · 112 citations
2
h-index
2 publications · 47 citations
2
h-index
1–5