The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …

In this paper, we introduce Saber, a package of cryptographic primitives whose security
relies on the hardness of the Module Learning With Rounding problem (Mod-LWR). We first …

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 consider all LWE-and NTRU-based encryption, key encapsulation, and digital signature
schemes proposed for standardisation as part of the Post-Quantum Cryptography process …

The candidates for the NIST Post-Quantum Cryptography standardization have undergone
extensive studies on efficiency and theoretical security, but research on their side-channel …

We propose an instantiation of public key encryption scheme based on the ring learning with
error problem, where the modulus is at a byte level and the noise is at a bit level, achieving …

Among the National Institute for Standards and Technology (NIST) postquantum
cryptography (PQC) standardization Round 3 finalists (announced in 2020 and anticipated …

While error correcting codes (ECC) have the potential to significantly reduce the failure
probability of post-quantum schemes, they add an extra ECC decoding step to the algorithm …

In this paper we investigate the impact of decryption failures on the chosen-ciphertext
security of lattice-based primitives. We discuss a generic framework for secret key recovery …

NIST's post-quantum standardization effort very recently entered its final round. This makes
studying the implementation-security aspect of the remaining candidates an increasingly …