DocumentCode :
2453903
Title :
Search to decision reduction for the learning with errors over rings problem
Author :
Lyubashevsky, Vadim
Author_Institution :
ENS, INRIA, Paris, Italy
fYear :
2011
fDate :
16-20 Oct. 2011
Firstpage :
410
Lastpage :
414
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 (Lyuba-shevsky, Peikert, Regev 2010) for spherical noise distributions.
Keywords :
cryptography; noise; decision reduction; learning with error; rings problem; spherical noise distribution; Encryption; Lattices; Polynomials; Search problems; Silicon; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop (ITW), 2011 IEEE
Conference_Location :
Paraty
Print_ISBN :
978-1-4577-0438-3
Type :
conf
DOI :
10.1109/ITW.2011.6089491
Filename :
6089491
Link To Document :
بازگشت