OpenAlex
Sieving for shortest vectors in ideal lattices: a practical perspective
Work
Year: 2017
Type: article
Abstract: The security of many lattice-based cryptographic schemes relies on the hardness of finding short vectors in integral lattices. We propose a new variant of the parallel Gauss sieve algorithm to compute... more
Source: International Journal of Applied Cryptography
Authors Joppe W. Bos, Michael Naehrig, Joop van de Pol
Institutions NXP (Belgium), Microsoft (United States), University of Bristol
Cites: 51
Cited by: 23
Related to: 10
FWCI: 1.89
Citation percentile (by year/subfield): 88.6
Topic: Cryptography and Data Security
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green