Solving the SVP in the Ideal Lattice of 128 dimensions Tsukasa Ishiguro KDDI RampD Laboratories Shinsaku Kiyomoto KDDI RampD Laboratories Yutaka Miyake KDDI RampD Laboratories Tsuyoshi Takagi ID: 501465
Download Presentation The PPT/PDF document "Parallel Gauss Sieve Algorithm" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Parallel Gauss Sieve AlgorithmSolving the SVP in the Ideal Lattice of 128 dimensions
Tsukasa Ishiguro (KDDI R&D Laboratories)Shinsaku Kiyomoto (KDDI R&D Laboratories) Yutaka Miyake (KDDI R&D Laboratories)Tsuyoshi Takagi (Kyushu University)
Eurocrypt
2013, Rump SessionMay 28, 2013.
1/6
Parallel Gauss Sieve AlgorithmSlide2
Shortest vector problem (SVP)
Shortest vectors
2/6
Parallel Gauss Sieve AlgorithmSlide3
Algorithms for solving the SVP
We propose the Parallel
Gauss sieve algorithm. (more than
1,000 threads)
3/6
Parallel Gauss Sieve AlgorithmSlide4
Sieving in the Ideal lattice
4/6
Parallel Gauss Sieve AlgorithmSlide5
Parallel Gauss Sieve Algorithm
5/6We Solved the SVP in the Ideal Lattice of 128 dimensions
Darmstadt Ideal Lattice Challenge
http://www.latticechallenge.org/ideallattice-challenge/Slide6
Solution of the Ideal Lattice Challenge
6/6
Parallel Gauss Sieve Algorithm
128 vectors