Skip to search formSkip to main contentSkip to account menu

Lattice sieving

Lattice sieving is a technique for finding smooth values of a bivariate polynomial over a large region. It is almost exclusively used in conjunction… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Factor baseGeneral number field sieveLattice reduction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
2017
2017
Faster tuple lattice sieving using spherical locality-sensitive filters
To overcome the large memory requirement of classical lattice sieving algorithms for solving hard lattice problems, Bai-Laarhoven… 
2017
2017
A New Lattice Sieving Algorithm Base on Angular Locality-Sensitive Hashing
Currently, the space requirement of sieving algorithms to solve the shortest vector problem (SVP) grows as \(2^{0.2075n+o(n… 
2016
2016
Randomized lattice sieving for the closest vector problem (with preprocessing)
2013
2013
SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
The best known integer-factoring algorithms consist of two stages: the sieving stage and the linear-algebra stage. Efficient… 
2007
2007
CAIRN3: An FPGA Implementation of the Sieving Step with the Lattice Sieving
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the… 
2003
2003
Extended Abstract
In many parts of Europe discussions about the low fertility and the need for governments to do something about it take place on… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)