Faster Rotation-Based Gauss Sieve for Solving the SVP on General Ideal Lattices

The hardness in solving the shortest vector problem (SVP) is a fundamental assumption for the security of lattice-based cryptographic algorithms. In 2010, Micciancio and Voulgaris proposed an algorithm named the Gauss Sieve, which is a fast and heuristic algorithm for solving the SVP. Schneider pres...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2021/01/01, Vol.E104.A(1), pp.79-88
Hauptverfasser:	NARISADA, Shintaro, OKADA, Hiroki, FUKUSHIMA, Kazuhide, KIYOMOTO, Shinsaku
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Cryptography Gauss Sieve generalization Heuristic methods ideal lattice Lattices Properties (attributes) Rotation shortest vector problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!