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

Abstract Interpretation over Non-Lattice Abstract Domains Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey Department of Computing and Information Systems, The University of Melbour

Abstract Interpretation over Non-Lattice Abstract Domains Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey Department of Computing and Information Systems, The University of Melbour

DocID: 1xUNu - View Document

Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIP

Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIP

DocID: 1xUmT - View Document

CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has bee

DocID: 1xUb2 - View Document

Fast Ideal Lattice-Based KEMs on ARM Cortex-M4 Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe  September 03, 2018

Fast Ideal Lattice-Based KEMs on ARM Cortex-M4 Matthias J. Kannwischer, Joost Rijneveld, Peter Schwabe September 03, 2018

DocID: 1xU1Q - View Document

arXiv:1805.03418v1 [cs.SC] 9 MayComputing an LLL-reduced basis of the orthogonal lattice Jingwei Chen Chongqing Key Lab of Automated Reasoning & Cognition,

arXiv:1805.03418v1 [cs.SC] 9 MayComputing an LLL-reduced basis of the orthogonal lattice Jingwei Chen Chongqing Key Lab of Automated Reasoning & Cognition,

DocID: 1xU0M - View Document