Name
Abstract | ||
|---|---|---|
In this short note, we give a self-contained proof of equivalence between the search and decision versions of the Learning with Error Problem over Rings problem (Lyubashevsky, Peikert, Regev 2010) for spherical noise distributions. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ITW.2011.6089491 | 2011 IEEE INFORMATION THEORY WORKSHOP (ITW) |
Keywords | Field | DocType |
silicon,polynomials,lattices,cryptography,encryption,noise,vectors | Discrete mathematics,Lattice (order),Polynomial,Computer science,Cryptography,Encryption,Theoretical computer science,Equivalence (measure theory),Learning with errors | Conference |
Citations | PageRank | References |
1 | 0.42 | 9 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vadim Lyubashevsky | 1 | 1174 | 59.91 |