Data privacy concerns are increasing significantly in the context of the Internet of Things,
cloud services, edge computing, artificial intelligence applications, and other applications …

Abstract We propose the General Sieve Kernel (G6K, pronounced/e. si. ka/), an abstract
stateful machine supporting a wide variety of lattice reduction strategies based on sieving …

We propose a framework for cryptanalysis of lattice-based schemes, when side information—
in the form of “hints”—about the secret and/or error is available. Our framework generalizes …

We propose the signature scheme Hawk, a concrete instantiation of proposals to use the
Lattice Isomorphism Problem (LIP) as a foundation for cryptography that focuses on …

Until recently lattice reduction attacks on NTRU lattices were thought to behave similar as on
(ring-) LWE lattices with the same parameters. However several works (Albrecht-Bai-Ducas …

The current widely used public‐key cryptosystems are vulnerable to quantum attacks. To
prepare for cybersecurity in the quantum era, some projects have been launched to call for …

Since its invention in 1982, the LLL lattice reduction algorithm (Lenstra, Lenstra, Lovasz
1982) has found countless applications. In cryptanalysis, the two most prominent …

Cryptosystems based on the learning with errors (LWE) problem are assigned a security
level that relates to the cost of generic algorithms for solving the LWE problem. This includes …

Lattices lead to promising practical post-quantum digital signatures, combining asymptotic
efficiency with strong theoretical security guarantees. However, tuning their parameters into …

We present the first rigorous dynamic analysis of BKZ, the most widely used lattice reduction
algorithm besides LLL: we provide guarantees on the quality of the current lattice basis …