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

Post-Quantum Provable Security in Symmetric-Key Cryptography

光倫 細山田, Akinori Hosoyamada

Published Sep 27, 2021• 0 citations
OpenAlex

Related papers

Post-Quantum Provable Security in Symmetric-Key Cryptography

Akinori Hosoyamada

•Sep 27, 2021•0 citations

A Note on Quantum Security for Post-Quantum Cryptography

Fang Song

Lecture notes in computer science•Jan 1, 2014•73 citations

Kvanttiavainjakelujärjestelmän käytännön testaus

Teemu Manninen

The development of quantum computers presents a threat to the security of modern communication systems; with Shor’s algorithm, all currently used asymmetric cryptography schemes can be broken. Fortunately, secure communication is still possible in the post-quantum era using symmetric encryption algorithms, such as the Advanced Encryption Standard (AES) or the provably secure one-time pad (OTP). However, the main problem of symmetric cryptography, the key distribution, has to be solved. Quantum key distribution (QKD) uses the fundamental properties of quantum mechanics to distribute encryption keys in a provably secure manner. In this thesis, the practical applicability of QKD is examined. This is achieved by testing the performance, stability, and usability of one of the few commercially available QKD platforms, ID Quantique’s Clavis 2. The tested system was stable for multiple months in normal operation and did not require any intervention from the user. The maximum distance with the test platform was 54 km. However, at these distances, the secret key rate was only tens of bits per second. For distances below 25 km, secret key rates in the kilobits per second range were achieved. Thus, if high data rates or communication distances close to 50 km are desired, ciphers less secure than OTP have to be used. Additionally, two flaws were discovered in the tested system, one making the system unstable, and the other preventing the key distribution process from starting. Fortunately, neither issue reduces the security of the system, and both could be fixed by modifying the software. Our results show that QKD can be considered as a mature technology that is ready for practical applications and even for commercial use.

•Mar 13, 2017•0 citations

Post-Quantum Security of Block Cipher Constructions

Gorjan Alagic, Chen Bai, Christian Majenz +1 more

Block ciphers are versatile cryptographic ingredients that are used in a wide range of applications ranging from secure Internet communications to disk encryption. While post-quantum security of public-key cryptography has received significant attention, the case of symmetric-key cryptography (and block ciphers in particular) remains a largely unexplored topic. In this work, we set the foundations for a theory of post-quantum security for block ciphers and associated constructions. Leveraging our new techniques, we provide the first post-quantum security proofs for the key-length extension scheme FX, the tweakable block ciphers LRW and XEX, and most block cipher encryption and authentication modes. Our techniques can be used for security proofs in both the plain model and the quantum ideal cipher model. Our work takes significant initial steps in establishing a rigorous understanding of the post-quantum security of practical symmetric-key cryptography.

arXiv:2510.08725•Oct 9, 2025•0 citations

Post-quantum Cryptography: An Overview

Syed Ismail Abdul Lathif, Priya Saxena, Priyanshi Singh

Blockchain technologies•Jan 1, 2025•0 citations

Lattice-Based Cryptography: The Post-Quantum Imperative for Public-Key Security

Revista, Zen, MATH, 10

The imminent threat posed by the development of cryptographically relevant quantum computers necessitates a paradigm shift in public-key cryptography. Traditional cryptosystems like RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security, are vulnerable to quantum algorithms such as Shor's algorithm. This vulnerability mandates a proactive migration to post-quantum cryptography (PQC) to secure long-term sensitive data. Among the various candidates for post-quantum security, lattice-based cryptography has emerged as a particularly promising and robust solution. This paper explores the fundamental principles of lattice-based cryptography, detailing its security foundations rooted in the presumed hardness of lattice problems like the Short Integer Solution (SIS) and Learning With Errors (LWE) problems. We review the significant progress in the field, including its selection as a primary candidate in the NIST Post-Quantum Cryptography standardization process. We discuss its advantages in terms of provable security, versatility, and potential for efficient implementation across diverse platforms, from cloud infrastructure to the Internet of Things (IoT). We also address the practical implications and challenges of its deployment, asserting its indispensable role in fortifying public-key security against future quantum attacks, thereby establishing it as a post-quantum imperative.

•Nov 25, 2025•0 citations
The development of quantum computers presents a threat to the security of modern communication systems; with Shor’s algorithm, all currently used asymmetric cryptography schemes can be broken. Fortunately, secure communication is still possible in the post-quantum era using symmetric encryption algorithms, such as the Advanced Encryption Standard (AES) or the provably secure one-time pad (OTP). However, the main problem of symmetric cryptography, the key distribution, has to be solved. Quantum key distribution (QKD) uses the fundamental properties of quantum mechanics to distribute encryption keys in a provably secure manner. In this thesis, the practical applicability of QKD is examined. This is achieved by testing the performance, stability, and usability of one of the few commercially available QKD platforms, ID Quantique’s Clavis 2. The tested system was stable for multiple months in normal operation and did not require any intervention from the user. The maximum distance with the test platform was 54 km. However, at these distances, the secret key rate was only tens of bits per second. For distances below 25 km, secret key rates in the kilobits per second range were achieved. Thus, if high data rates or communication distances close to 50 km are desired, ciphers less secure than OTP have to be used. Additionally, two flaws were discovered in the tested system, one making the system unstable, and the other preventing the key distribution process from starting. Fortunately, neither issue reduces the security of the system, and both could be fixed by modifying the software. Our results show that QKD can be considered as a mature technology that is ready for practical applications and even for commercial use.
Block ciphers are versatile cryptographic ingredients that are used in a wide range of applications ranging from secure Internet communications to disk encryption. While post-quantum security of public-key cryptography has received significant attention, the case of symmetric-key cryptography (and block ciphers in particular) remains a largely unexplored topic. In this work, we set the foundations for a theory of post-quantum security for block ciphers and associated constructions. Leveraging our new techniques, we provide the first post-quantum security proofs for the key-length extension scheme FX, the tweakable block ciphers LRW and XEX, and most block cipher encryption and authentication modes. Our techniques can be used for security proofs in both the plain model and the quantum ideal cipher model. Our work takes significant initial steps in establishing a rigorous understanding of the post-quantum security of practical symmetric-key cryptography.
The imminent threat posed by the development of cryptographically relevant quantum computers necessitates a paradigm shift in public-key cryptography. Traditional cryptosystems like RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security, are vulnerable to quantum algorithms such as Shor's algorithm. This vulnerability mandates a proactive migration to post-quantum cryptography (PQC) to secure long-term sensitive data. Among the various candidates for post-quantum security, lattice-based cryptography has emerged as a particularly promising and robust solution. This paper explores the fundamental principles of lattice-based cryptography, detailing its security foundations rooted in the presumed hardness of lattice problems like the Short Integer Solution (SIS) and Learning With Errors (LWE) problems. We review the significant progress in the field, including its selection as a primary candidate in the NIST Post-Quantum Cryptography standardization process. We discuss its advantages in terms of provable security, versatility, and potential for efficient implementation across diverse platforms, from cloud infrastructure to the Internet of Things (IoT). We also address the practical implications and challenges of its deployment, asserting its indispensable role in fortifying public-key security against future quantum attacks, thereby establishing it as a post-quantum imperative.