Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract)

Zvi Galil, Stuart Haber, Moti M. Yung

Published Jan 1, 1988• 49 citations
Publisher
DOI
10.1007/3-540-48184-2_10

Related papers

Designing and Delivering a Post-Quantum Cryptography Course

Thomas J. Borrelli, Monika Polak, Stanisław Radziszowski

The security of many commonly used cryptographic protocols, especially public-key cryptosystems, would be compromised if general-purpose, large-scale, fault-tolerant quantum computers become a reality. In this paper we present our experience developing and launching a course in Post-Quantum Cryptography (PQC). PQC refers to cryptographic systems that are secure against both quantum and classical computers. Such systems may be achieved through classical (i.e. non-quantum) means.

ACM Technical Symposium on Computer Science Education (SIGCSE)•Mar 7, 2024•7 citations

Approaches to Efficient and Robust Cryptographic Protocols

Bartosz Przydatek

•Jan 1, 2007•0 citations

A model for secure protocols and its application to systematic design of cryptographic protocols

Carsten Rudolph

•Jan 1, 2001•5 citations

The quantum circuit implementation and feasibility analysis of quantum public-key cryptosystem based on the $$QSCD_{ff}$$ problem

Anyi Li, Qiqing Xia, Qianru Zhu +1 more

Abstract The development of quantum computation enables exponential time complexity problems on classical computers to be solved in polynomial time on quantum computers. However, it also poses a threat to the security of classical cryptographic schemes based on integer factorization and discrete logarithms. In response to this challenge, quantum cryptographic schemes based on quantum computation and quantum communication environments have become a focal point of research. The quantum public-key cryptosystem based on the QSCDff problem stands as one of the influential schemes in the realm of quantum public-key cryptography, yet its feasibility remains unexplored in current literature. Our specific focus lies in the quantum circuit implementations and fault-tolerant construction, which serve as essential prerequisites for the physical feasibility of quantum cryptographic schemes. We provide quantum circuit implementations along with rigorous theoretical proofs for the computation of the permutation product operation and the permutation sign operation in quantum public-key cryptographic schemes. Based on the fault-tolerant quantum computation process of the aforementioned quantum circuit implementations, we propose two error-correction strategies and provide a theoretical feasibility analysis within a specified range in the ion-trap quantum computation environment, adhering to the theoretical limits of quantum computation. Rigorous proofs are presented to demonstrate the correctness and reliability of the proposed methods. Our contribution provides a theoretical foundation for the physical feasibility analysis of quantum cryptographic algorithms, offering insights into the challenges and prospects of implementing these algorithms in quantum computation environments.

Cybersecurity•Dec 1, 2024•1 citation

Quantum-Resistant Cryptography

John Mattsson, Ben Smeets, Erik Thormarker

Quantum-resistant cryptography is cryptography that aims to deliver cryptographic functions and protocols that remain secure even if large-scale fault-tolerant quantum computers are built. NIST will soon announce the first selected public-key cryptography algorithms in its Post-Quantum Cryptography (PQC) standardization which is the most important current effort in the field of quantum-resistant cryptography. This report provides an overview to security experts who do not yet have a deep understanding of quantum-resistant cryptography. It surveys the computational model of quantum computers; the quantum algorithms that affect cryptography the most; the risk of Cryptographically Relevant Quantum Computers (CRQCs) being built; the security of symmetric and public-key cryptography in the presence of CRQCs; the NIST PQC standardization effort; the migration to quantum-resistant public-key cryptography; the relevance of Quantum Key Distribution as a complement to conventional cryptography; and the relevance of Quantum Random Number Generators as a complement to current hardware Random Number Generators.

arXiv:2112.00399•Dec 1, 2021•10 citations

The Design and Analysis of Cryptographic Protocols.

Richard A. DeMillo, Nancy Ann Lynch, Michael Merritt

International Cryptology Conference•Jan 1, 1981•0 citations
The quantum circuit implementation and feasibility analysis of quantum public-key cryptosystem based on the QSCDffQSCD_{ff}QSCDff​ problem
Abstract The development of quantum computation enables exponential time complexity problems on classical computers to be solved in polynomial time on quantum computers. However, it also poses a threat to the security of classical cryptographic schemes based on integer factorization and discrete logarithms. In response to this challenge, quantum cryptographic schemes based on quantum computation and quantum communication environments have become a focal point of research. The quantum public-key cryptosystem based on the QSCDff problem stands as one of the influential schemes in the realm of quantum public-key cryptography, yet its feasibility remains unexplored in current literature. Our specific focus lies in the quantum circuit implementations and fault-tolerant construction, which serve as essential prerequisites for the physical feasibility of quantum cryptographic schemes. We provide quantum circuit implementations along with rigorous theoretical proofs for the computation of the permutation product operation and the permutation sign operation in quantum public-key cryptographic schemes. Based on the fault-tolerant quantum computation process of the aforementioned quantum circuit implementations, we propose two error-correction strategies and provide a theoretical feasibility analysis within a specified range in the ion-trap quantum computation environment, adhering to the theoretical limits of quantum computation. Rigorous proofs are presented to demonstrate the correctness and reliability of the proposed methods. Our contribution provides a theoretical foundation for the physical feasibility analysis of quantum cryptographic algorithms, offering insights into the challenges and prospects of implementing these algorithms in quantum computation environments.
Quantum-resistant cryptography is cryptography that aims to deliver cryptographic functions and protocols that remain secure even if large-scale fault-tolerant quantum computers are built. NIST will soon announce the first selected public-key cryptography algorithms in its Post-Quantum Cryptography (PQC) standardization which is the most important current effort in the field of quantum-resistant cryptography. This report provides an overview to security experts who do not yet have a deep understanding of quantum-resistant cryptography. It surveys the computational model of quantum computers; the quantum algorithms that affect cryptography the most; the risk of Cryptographically Relevant Quantum Computers (CRQCs) being built; the security of symmetric and public-key cryptography in the presence of CRQCs; the NIST PQC standardization effort; the migration to quantum-resistant public-key cryptography; the relevance of Quantum Key Distribution as a complement to conventional cryptography; and the relevance of Quantum Random Number Generators as a complement to current hardware Random Number Generators.