Post-Quantum Cryptography (PQC) Archivi - Page 2 of 2

The Mathematics behind PQC: hash functions

Introduction After analyzing in detail the Post Quantum algorithms that base their security on mathematical problems defined over lattices (Kyber, Dilithium, Falcon) and on error correcting codes (Classic McEliece), we...

The math behind the PQC: Syndrome Decoding Problem

11 Dec

Introduction Cryptographic schemes starring in the NIST standardization process belonging to the code-based cryptography family are constructed from a problem called the Decoding Problem. Given a code and a vector,...

The mathematics behind PQC: the codes

03 Nov

Introduction In addition to lattices, the foundation of lattice-based cryptography, another mathematical structure used to construct post-quantum cryptography schemes is error-correcting codes, more briefly codes. The codes originated in the...

The Math Behind PQC: Learning With Errors

27 Mar

[latexpage] Introduction Some of the cryptographic schemes that emerged as winners of the NIST standardization process and belong to the lattice-based cryptography family are built upon a problem known as Learning With Errors (LWE)....

The mathematics behind PQC: lattices

15 Feb

[latexpage] Introduction A large number of post-quantum cryptographic schemes are based on a mathematical structure known as a lattice. Within this framework, it is possible to define problems that are...

Quantum Key Distribution (QKD) and Post-Quantum Cryptography (PQC)

14 Nov

Today the quantum attacks threat is a real danger. The protection of data and communications is linked to technologies that give future-proof answers, capable of thwarting threats with still partially...