We give a randomized 2n+ o (n)-time and space algorithm for solving the Shortest Vector
Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest …

EagleSin: In this document we present EagleSign signature which can be seen as a variant
of Elgamal signature over structured lattices. It is more simple and faster than Falcon and …

Learning with Errors (LWE) is an important problem for post-quantum cryptography (PQC)
that underlines the security of several NIST PQC selected algorithms. Several recent papers …

We give a 2 n+ o (n)-time and space randomized algorithm for solving the exact Closest
Vector Problem (CVP) on n-dimensional Euclidean lattices. This improves on the previous …

Updatable public key encryption has recently been introduced as a solution to achieve
forward-security in the context of secure group messaging without hurting efficiency, but so …

Lattice-based cryptography has recently emerged as a prime candidate for efficient and
secure post-quantum cryptography. The two main hard problems underlying its security are …

For odd integers p≥ 1 (and p=∞), we show that the Closest Vector Problem in the ℓ p norm
(CVP p) over rank n lattices cannot be solved in 2 (1-ε) n time for any constant ε> 0 unless …

Sampling from the lattice Gaussian distribution plays an important role in various research
fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is …

The two traditional hard problems underlying the security of lattice-based cryptography are
the shortest vector problem (SVP) and the closest vector problem (CVP). For a long time …

Abstract The discrete Gaussian D ℒ–t, s is the distribution that assigns to each vector x in a
shifted lattice ℒ—t probability proportional to. It has long been an important tool in the study …