The learning with errors (LWE) problem has become a central building block of modern
cryptographic constructions. This work collects and presents hardness results for concrete …

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 …

The interest in lattice-based cryptography is increasing due to its quantum resistance and its
provable security under some worst-case hardness assumptions. As this is a relatively new …

Learning with Rounding (LWR) is a lattice-based cryptographically hard problem which
quantum computers find difficult to solve. LWR problem is a derandomized variant of …

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 …

Although rather recent, lattice-based cryptography has stood out on numerous points, be it
by the variety of constructions that it allows, by its expected resistance to quantum …

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 …

In this paper, we assess the practicability of Hash Sieve, a recently proposed sieving
algorithm for the Shortest Vector Problem (SVP) on lattices, on multi-core shared memory …

Motivated by recent results on solving large batches of closest vector problem (CVP)
instances, we study how these techniques can be combined with lattice enumeration to …