Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …

• Increase noise parameter for Kyber512 In the round-2 submission of Kyber, the decryption
error for Kyber512 was rather conservative, while at the same time, there were requests to …

We present an overview of quantum-safe cryptography (QSC) with a focus on post-quantum
cryptography (PQC) and information-theoretic security. From a cryptographic point of view …

We describe two very efficient polynomial-time algorithms for reducing module lattices
defined over arbitrary cyclotomic fields that solve the γ-Hermite Module-SVP problem. They …

The celebrated LLL algorithm for Euclidean lattices is central to cryptanalysis of well-known
and deployed protocols as it provides approximate solutions to the Shortest Vector Problem …

Computational problems on point lattices play a central role in many areas of computer
science including integer programming, coding theory, cryptanalysis, and especially the …

A floating-point fully homomorphic encryption (FPFHE) is proposed, which is based on torus
fully homomorphic encryption equipped with programmable bootstrapping. Specifically …

In this article, we propose a new approach to the study of lattice problems used in
cryptography. We specifically focus on module lattices of a fixed rank over some number …

Fully Homomorphic Encryption (FHE) enables computation directly on encrypted data. This
property is desirable for outsourced computation of sensitive data as it relies solely on the …

We introduce a novel method to derandomize the learning with errors (LWE) problem by
generating deterministic yet sufficiently independent LWE instances that are constructed by …