Post-quantum lattice-based cryptography implementations: A survey
The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …
schemes, leading to innovations in public key cryptography that focus on post-quantum …
A modular analysis of the Fujisaki-Okamoto transformation
Abstract The Fujisaki-Okamoto (FO) transformation (CRYPTO 1999 and Journal of
Cryptology 2013) turns any weakly secure public-key encryption scheme into a strongly (ie …
Cryptology 2013) turns any weakly secure public-key encryption scheme into a strongly (ie …
[PDF][PDF] Status report on the third round of the NIST post-quantum cryptography standardization process
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 …
publickey cryptographic algorithms through a public, competition-like process. The new …
[PDF][PDF] Falcon: Fast-Fourier lattice-based compact signatures over NTRU
PA Fouque, J Hoffstein, P Kirchner… - Submission to the NIST's …, 2018 - di.ens.fr
This document is the supporting documentation of Falcon. It is organized as follows. Chapter
2 explains the overall design of Falcon and its rationale. Chapter 3 is a complete …
2 explains the overall design of Falcon and its rationale. Chapter 3 is a complete …
SeaSign: compact isogeny signatures from class group actions
L De Feo, SD Galbraith - … in Cryptology–EUROCRYPT 2019: 38th Annual …, 2019 - Springer
We give a new signature scheme for isogenies that combines the class group actions of
CSIDH with the notion of Fiat-Shamir with aborts. Our techniques allow to have signatures of …
CSIDH with the notion of Fiat-Shamir with aborts. Our techniques allow to have signatures of …
Security of the Fiat-Shamir transformation in the quantum random-oracle model
Abstract The famous Fiat-Shamir transformation turns any public-coin three-round interactive
proof, ie, any so-called Σ-protocol, into a non-interactive proof in the random-oracle model …
proof, ie, any so-called Σ-protocol, into a non-interactive proof in the random-oracle model …
Verifiable quantum advantage without structure
T Yamakawa, M Zhandry - Journal of the ACM, 2024 - dl.acm.org
We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …
Tightly-secure key-encapsulation mechanism in the quantum random oracle model
T Saito, K Xagawa, T Yamakawa - … on the Theory and Applications of …, 2018 - Springer
Key-encapsulation mechanisms secure against chosen ciphertext attacks (IND-CCA-secure
KEMs) in the quantum random oracle model have been proposed by Boneh, Dagdelen …
KEMs) in the quantum random oracle model have been proposed by Boneh, Dagdelen …
Revisiting post-quantum fiat-shamir
Abstract The Fiat-Shamir transformation is a useful approach to building non-interactive
arguments (of knowledge) in the random oracle model. Unfortunately, existing proof …
arguments (of knowledge) in the random oracle model. Unfortunately, existing proof …
MuSig-L: Lattice-based multi-signature with single-round online phase
Multi-signatures are protocols that allow a group of signers to jointly produce a single
signature on the same message. In recent years, a number of practical multi-signature …
signature on the same message. In recent years, a number of practical multi-signature …