<--- 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

51  Documenta Math. Linear Programming Stories

51 Documenta Math. Linear Programming Stories

DocID: 1pZQ7 - View Document

Faster LLL-type reduction of lattice bases Arnold Neumaier Damien Stehlé  Universität Wien, Austria

Faster LLL-type reduction of lattice bases Arnold Neumaier Damien Stehlé Universität Wien, Austria

DocID: 1pk3Z - View Document

51  Documenta Math. Linear Programming Stories

51 Documenta Math. Linear Programming Stories

DocID: 1osru - View Document