By applying a quantum search algorithm to various heuristic and provable sieve algorithms
from the literature, we obtain improved asymptotic quantum results for solving the shortest …

Search problems in cryptography Page 1 Search problems in cryptography: from fingerprinting
to lattice sieving Citation for published version (APA): Laarhoven, T. (2016). Search problems …

This paper presents the design of ring learning with errors (LWE) cryptoprocessors using
number theoretic transform (NTT) cores and Gaussian samplers based on the inverse …

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 …

This paper is a tutorial introduction to the present state-of-the-art in the field of security of
lattice-based cryptosystems. After a short introduction to lattices, we describe the main hard …

By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and
Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehlé, we obtain improved …

This paper describes the lattice problems that are key in the study of lattice-based
cryptography, identifies and categorizes methods for solving these problems, analyzes …

In this paper, we propose a lattice-based encryption scheme for Identity-Based Encryption
(IBE) which is secure against Chosen-Ciphertext Attacks (CCA), and it is deduced from a …

The exact manner of BKZ algorithm for higher block sizes cannot be studied by practical
running, so simulation of BKZ can be used to predict the total cost and output quality of BKZ …

BKZ 2.0 algorithm is one of the claimant lattice reduction algorithms which incorporates
extreme pruning as its main phase. The non-extreme pruning and extreme pruning in the …