Abstract. In this paper we make a first feasibility analysis for imple-menting lattice reduction algorithms on GPU using CUDA, a program-ming framework for NVIDIA graphics cards. The enumeration phase of the BKZ lattice reduction algorithm is chosen as a good candidate for massive parallelization on GPU. Given the nature of the problem we gain large speedups compared to previous CPU implementations. Our imple-mentation saves more than 50 % of the time in high lattice dimensions. Among other impacts, this result influences the security of lattice based cryptosystems
The Kannan-Fincke-Pohst enumeration algorithm for the shortest and closest lattice vector problems i...
We present four CUDA based parallel implementations of the Space-Saving algorithm for determining fr...
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theor...
Abstract. In this paper we present an algorithm for parallel exhaustive search for short vectors in ...
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. ...
Abstract. Lattice basis reduction is the problem of finding short vec-tors in lattices. The security...
Hard Lattice problems are assumed to be one of the most promising problems for generating cryptosyst...
We present a GPU implementation of the Simple Sampling Reduction (SSR) algorithm that searches for ...
Abstract. This paper describes a parallel Jacobi method for lattice basis reduction and a GPU implem...
Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
We discuss the CUDA approach to the simulation of pure gauge Lattice SU(2). CUDA is a hardware and s...
Abstract—Many general-purpose applications exploit Graphics Processing Units (GPUs) by executing a s...
International audienceWe describe an FPGA accelerator for the Kannan–Fincke–Pohst enumeration algo...
The starting point of any lattice QCD computation is the generation of a Markov chain of gauge field...
The Kannan-Fincke-Pohst enumeration algorithm for the shortest and closest lattice vector problems i...
We present four CUDA based parallel implementations of the Space-Saving algorithm for determining fr...
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theor...
Abstract. In this paper we present an algorithm for parallel exhaustive search for short vectors in ...
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. ...
Abstract. Lattice basis reduction is the problem of finding short vec-tors in lattices. The security...
Hard Lattice problems are assumed to be one of the most promising problems for generating cryptosyst...
We present a GPU implementation of the Simple Sampling Reduction (SSR) algorithm that searches for ...
Abstract. This paper describes a parallel Jacobi method for lattice basis reduction and a GPU implem...
Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
We discuss the CUDA approach to the simulation of pure gauge Lattice SU(2). CUDA is a hardware and s...
Abstract—Many general-purpose applications exploit Graphics Processing Units (GPUs) by executing a s...
International audienceWe describe an FPGA accelerator for the Kannan–Fincke–Pohst enumeration algo...
The starting point of any lattice QCD computation is the generation of a Markov chain of gauge field...
The Kannan-Fincke-Pohst enumeration algorithm for the shortest and closest lattice vector problems i...
We present four CUDA based parallel implementations of the Space-Saving algorithm for determining fr...
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theor...