Parallel Improved Schnorr-Euchner Enumeration SE++ for the CVP and SVP (original) (raw)
Related papers
J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2016
Exploring parallel enumeration algorithms to improve efficiency to solve the SVP
Hélder Gonçalves, Alberto Proença
Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice
Lecture Notes in Computer Science, 2014
Parallel Gauss Sieve Algorithm: Solving the SVP in the Ideal Lattice of 128 dimensions
IACR Cryptology ePrint Archive, 2013
Lock-free GaussSieve for Linear Speedups in Parallel High Performance SVP Calculation
Sieve algorithms for the shortest vector problem are practical
Journal of Mathematical Cryptology, 2000
Solving BDD by Enumeration: An Update
Lecture Notes in Computer Science, 2013
Towards Faster Polynomial-Time Lattice Reduction
Lecture Notes in Computer Science, 2021
Mathematics of Computation, 1985
Towards an efficient lattice basis reduction implementation
Alberto Proença, Hélder Gonçalves
Parallelization on Gauss Sieve Algorithm over Ideal Lattice
2021
Lattice Based Tools in Cryptanalysis for Public Key Cryptography
International Journal of Network Security & Its Applications, 2012
A sieve algorithm for the shortest lattice vector problem
2001
Efficient Estimation of Number of Short Lattice Vectors in Search Space under Randomness Assumption
Proceedings of the 6th on ASIA Public-Key Cryptography Workshop - APKC '19
Lower Bounds on Lattice Enumeration with Extreme Pruning
Lecture Notes in Computer Science, 2018
Sampling short lattice vectors and the closest lattice vector problem
2002
Lecture Notes in Computer Science, 2010
Quantum Lattice Enumeration and Tweaking Discrete Pruning
Lecture Notes in Computer Science, 2018
Faster Rotation-Based Gauss Sieve for Solving the SVP on General Ideal Lattices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2021
A Parallel Algorithm for Lattice Construction
2005
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
Lecture Notes in Computer Science, 2015
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms, 2009
A Complete Analysis of the BKZ Lattice Reduction Algorithm
IACR Cryptol. ePrint Arch., 2020
The closest vector problem in some lattices of type A
Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography
2018 IEEE International Symposium on Circuits and Systems (ISCAS), 2018
A Parallel Evolutionary Search for Shortest Vector Problem
International Journal of Information Technology and Computer Science, 2019
Thomas Prest, Vadim Lyubashevsky
Lecture Notes in Computer Science, 2015
Techniques for Solving Shortest Vector Problem
International Journal of Advanced Computer Science and Applications, 2021
LLL for ideal lattices: re-evaluation of the security of Gentry–Halevi’s FHE scheme
Designs, Codes and Cryptography, 2014
SOME FAST ELLIPTIC SOLVERS ON PARALLEL ARCHITECTURES AND THEIR COMPLEXITIES
International Journal of High Speed Computing, 1989
A complexity analysis of a Jacobi method for lattice basis reduction
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering - C3S2E '12, 2012
Reduction-Respecting Parameters for Lattice-Based Cryptosystems
2018
A note on the shortest lattice vector problem
1999
Performance of VLSI Engines for Lattice Computations
1987
Complexity of the closest vector problem in a lattice generated by (0, 1)-matrix
1992