This paper introduces streamlined constant-time variants of Euclid's algorithm, both for
polynomial inputs and for integer inputs. As concrete applications, this paper saves time in …

Abstract© The Institution of Engineering and Technology 2019. The modulus switching
technique has been used in some cryptographic applications as well as in cryptanalysis. For …

We present BAT–an IND-CCA secure key encapsulation mechanism (KEM) that is based on
NTRU but follows an encryption/decryption paradigm distinct from classical NTRU KEMs. It …

This paper describes the limits of various" security proofs", using 36 lattice-based KEMs as
case studies. This description allows the limits to be systematically compared across these …

There are many proposed lattice-based encryption systems. How do these systems compare
in the security that they provide against known attacks, under various limits on …

Polynomial multiplication is one of the most costly operations of ideal lattice-based
cryptosystems. In this work, we study its optimizations when one of the operands has …

A key step in Regev's (2009) reduction of the Discrete Gaussian Sampling (DGS) problem to
that of solving the Learning With Errors (LWE) problem is a statistical test required for …

Regev (2005) introduced the learning with errors (LWE) problem and showed a quantum
reduction from a worst case lattice problem to LWE. Building on the work of Peikert (2009), a …

This paper looks at the submissions for round 2 of a competition held by National Institute of
Standards and Technology (NIST) to find an encryption standard resistant to attacks by post …

The modulus switching technique has been used in some cryptographic applications as well
as in cryptanalysis. For cryptanalysis against the learning with errors (LWE) problem and the …