[PDF][PDF] Status report on the second round of the NIST post-quantum cryptography standardization process
G Alagic, J Alperin-Sheriff, D Apon… - US Department of …, 2020 - nvlpubs.nist.gov
Abstract The National Institute of Standards and Technology is in the process of selecting
one or more public-key cryptographic algorithms through a public, competition-like process …
one or more public-key cryptographic algorithms through a public, competition-like process …
SQISign: compact post-quantum signatures from quaternions and isogenies
We introduce a new signature scheme, SQISign,(for Short Quaternion and Isogeny
Signature) from isogeny graphs of supersingular elliptic curves. The signature scheme is …
Signature) from isogeny graphs of supersingular elliptic curves. The signature scheme is …
CSI-FiSh: efficient isogeny based signatures through class group computations
W Beullens, T Kleinjung, F Vercauteren - … on the theory and application of …, 2019 - Springer
In this paper we report on a new record class group computation of an imaginary quadratic
field having 154-digit discriminant, surpassing the previous record of 130 digits. This class …
field having 154-digit discriminant, surpassing the previous record of 130 digits. This class …
Fiat-shamir transformation of multi-round interactive proofs
Abstract The celebrated Fiat-Shamir transformation turns any public-coin interactive proof
into a non-interactive one, which inherits the main security properties (in the random oracle …
into a non-interactive one, which inherits the main security properties (in the random oracle …
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) …
A Compressed -Protocol Theory for Lattices
We show a lattice-based solution for commit-and-prove transparent circuit zero-knowledge
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
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 …
[HTML][HTML] Post-quantum cryptography Algorithm's standardization and performance analysis
M Kumar - Array, 2022 - Elsevier
Quantum computer is no longer a hypothetical idea. It is the world's most important
technology and there is a race among countries to get supremacy in quantum technology. It …
technology and there is a race among countries to get supremacy in quantum technology. It …
A detailed analysis of Fiat-Shamir with aborts
J Devevey, P Fallahpour, A Passelègue… - Annual International …, 2023 - Springer
Lyubashevky's signatures are based on the Fiat-Shamir with Aborts paradigm. It transforms
an interactive identification protocol that has a non-negligible probability of aborting into a …
an interactive identification protocol that has a non-negligible probability of aborting into a …
Feistel structures for MPC, and more
Efficient PRP/PRFs are instrumental to the design of cryptographic protocols. We investigate
the design of dedicated PRP/PRFs for three application areas-secure multiparty computation …
the design of dedicated PRP/PRFs for three application areas-secure multiparty computation …