Add to ORKGAbstract. Building upon a famous result due to Ajtai, we propose a sequence of lattice bases with growing dimension, which can be expected to be hard instances of the shortest vector problem (SVP) and which can therefore be used to benchmark lattice reduction algorithms. The SVP is the basis of security for potentially post-quantum cryptosys-tems. We use our sequence of lattice bases to create a challenge, which may be helpful in determining appropriate parameters for these schemes
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a p...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
The lattice hortest vector problem, or lattice SVP, has gained a lot of attention in the field of qu...
Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally con...
Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally con...
Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally con...
This paper is a tutorial introduction to the present state-of-the-art in the field of security of la...
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approxi-ma...
The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upo...
Lattice reduction algorithms are notoriously hard to predict, both in terms of running time and outp...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
Over the past decade, lattice-based cryptography has emerged as one of the most promising candidates...
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a p...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
The lattice hortest vector problem, or lattice SVP, has gained a lot of attention in the field of qu...
Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally con...
Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally con...
Lattice-based cryptography which holds a great promise for post-quantum cryptographyis naturally con...
This paper is a tutorial introduction to the present state-of-the-art in the field of security of la...
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approxi-ma...
The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upo...
Lattice reduction algorithms are notoriously hard to predict, both in terms of running time and outp...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
Over the past decade, lattice-based cryptography has emerged as one of the most promising candidates...
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a p...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...