Provably weak instances of Ring-LWE

The ring and polynomial learning with errors problems (Ring-LWE and Poly-LWE) have been proposed as hard problems to form the basis for cryptosystems, and various security reductions to hard lattice problems have been presented. So far these problems have been stated for general (number) rings but h...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Elias, Yara, Lauter, Kristin E, Ozman, Ekin, Stange, Katherine E
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Cryptography and Security Mathematics - Number Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!