<--- Back to Details
First PageDocument Content
Cryptography / Mathematics / Post-quantum cryptography / Lattice-based cryptography / Lie groups / Computational hardness assumptions / Lattice problem / Lattice / Euclidean algorithm / LenstraLenstraLovsz lattice basis reduction algorithm / Ideal lattice cryptography / Short integer solution problem
Date: 2018-05-28 18:07:35
Cryptography
Mathematics
Post-quantum cryptography
Lattice-based cryptography
Lie groups
Computational hardness assumptions
Lattice problem
Lattice
Euclidean algorithm
LenstraLenstraLovsz lattice basis reduction algorithm
Ideal lattice cryptography
Short integer solution problem

Gauss Sieve Algorithm on GPUs Shang-Yi Yang1 , Po-Chun Kuo1(B) , Bo-Yin Yang2 , and Chen-Mou Cheng1 1 Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan {ilway25,kbj,doug}@crypto.tw

Add to Reading List

Source URL: precision.moscito.org

Download Document from Source Website

File Size: 387,43 KB

Share Document on Facebook

Similar Documents

Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN  Joint work with:

Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with:

DocID: 1r2Hf - View Document

Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6

Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6

DocID: 1qjra - View Document

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

DocID: 1q2Qr - View Document

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger

Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger

DocID: 1pMu4 - View Document

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

DocID: 1mJoe - View Document