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

On the Post-quantum Security of Classical Authenticated Encryption Schemes

Nathalie Lang, Stefan Lucks

Published Jan 1, 2023• 3 citations
Publisher
DOI
10.1007/978-3-031-37679-5_4

Related papers

Post-Quantum Security Models for Authenticated Encryption

Vladimir Soukharev, David Jao, Srinath Seshadri

Lecture notes in computer science•Jan 1, 2016•13 citations

Post-Quantum Elliptic Curve Cryptography

Vladimir Soukharev

We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.

•May 16, 2016•1 citation

Authenticated-Encryption in the Quantum Key Distribution Classical Channel Using Post-Quantum Cryptography

Avani Prakasan, Kurunandan Jain, Prabhakar Krishnan

Quantum computers are much faster than traditional computers and can easily break all Asymmetric Cryptographic Algorithms like RSA, Diffie-Hellman, elliptic curve, etc. For the secure transition of data in the future, we should use Quantum Cryptography, which is an emerging cryptographic technique that can be used for the secure transmission of data in a quantum world. Quantum Cryptography provides unconditional security to the data which were transmitted. Quantum Cryptography uses two channels for communication - a classical channel and a quantum channel. However, authentication in the classical channel is currently done by the classical cryptographic algorithms that are not efficient and quantum-safe. In addition to that, the existing QKD schemes do not ensure confidentiality to the data transmitted through the classical channel. PostQuantum Cryptography(PQC) is a computational-security based cryptographic technique that is quantum-resistant. So, as a solution to the authentication and encryption inefficiencies in the classical channel, PQC can be used. Here we are proposing an Authenticated-Encryption Scheme in the classical channel using the PQC algorithms Falcon and NTRU that are Quantum safe.

International Conference on Intelligent Computing and Control Systems (ICICCS)•May 25, 2022•41 citations

A Note on Quantum Security for Post-Quantum Cryptography

Fang Song

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

On Security Notions for Encryption in a Quantum World

Céline Chevalier, Ehsan Ebrahimi, Quoc-Huy Vu

Lecture notes in computer science•Jan 1, 2022•21 citations

Enhancing the Security of Classical Communication with Post-Quantum Authenticated-Encryption Schemes for the Quantum Key Distribution

Farshad Rahimi Ghashghaei, Yussuf Hassan Ahmed, Nebrase Elmrabit +1 more

This research aims to establish a secure system for key exchange by using post-quantum cryptography (PQC) schemes in the classic channel of quantum key distribution (QKD). Modern cryptography faces significant threats from quantum computers, which can solve classical problems rapidly. PQC schemes address critical security challenges in QKD, particularly in authentication and encryption, to ensure the reliable communication across quantum and classical channels. The other objective of this study is to balance security and communication speed among various PQC algorithms in different security levels, specifically CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, which are finalists in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization project. The quantum channel of QKD is simulated with Qiskit, which is a comprehensive and well-supported tool in the field of quantum computing. By providing a detailed analysis of the performance of these three algorithms with Rivest–Shamir–Adleman (RSA), the results will guide companies and organizations in selecting an optimal combination for their QKD systems to achieve a reliable balance between efficiency and security. Our findings demonstrate that the implemented PQC schemes effectively address security challenges posed by quantum computers, while keeping the the performance similar to RSA.

Computers•Jul 1, 2024•42 citations
We propose and develop new schemes for post-quantum cryptography based on isogenies over elliptic curves. First we show that ordinary elliptic curves are have less than exponential security against quantum computers. These results were used as the motivation for De Feo, Jao and Pl\\^ut's construction of public key cryptosystems using supersingular elliptic curve isogenies. We extend their construction and show that isogenies between supersingular elliptic curves can be used as the underlying hard mathematical problem for other quantum-resistant schemes. For our second contribution, we propose is an undeniable signature scheme based on elliptic curve isogenies. We prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. This proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption. Finally, we also propose a security model for evaluating the security of authenticated encryption schemes in the post-quantum setting. Our model is based on a combination of the classical Bellare-Namprempre security model for authenticated encryption together with modifications from Boneh and Zhandry to handle message authentication against quantum adversaries. We give a generic construction based on Bellare-Namprempre for producing an authenticated encryption protocol from any quantum-resistant symmetric-key encryption scheme together with any digital signature scheme or MAC admitting any classical security reduction to a quantum-computationally hard problem. We apply the results and show how we can explicitly construct authenticated encryption schemes based on isogenies.
Quantum computers are much faster than traditional computers and can easily break all Asymmetric Cryptographic Algorithms like RSA, Diffie-Hellman, elliptic curve, etc. For the secure transition of data in the future, we should use Quantum Cryptography, which is an emerging cryptographic technique that can be used for the secure transmission of data in a quantum world. Quantum Cryptography provides unconditional security to the data which were transmitted. Quantum Cryptography uses two channels for communication - a classical channel and a quantum channel. However, authentication in the classical channel is currently done by the classical cryptographic algorithms that are not efficient and quantum-safe. In addition to that, the existing QKD schemes do not ensure confidentiality to the data transmitted through the classical channel. PostQuantum Cryptography(PQC) is a computational-security based cryptographic technique that is quantum-resistant. So, as a solution to the authentication and encryption inefficiencies in the classical channel, PQC can be used. Here we are proposing an Authenticated-Encryption Scheme in the classical channel using the PQC algorithms Falcon and NTRU that are Quantum safe.
This research aims to establish a secure system for key exchange by using post-quantum cryptography (PQC) schemes in the classic channel of quantum key distribution (QKD). Modern cryptography faces significant threats from quantum computers, which can solve classical problems rapidly. PQC schemes address critical security challenges in QKD, particularly in authentication and encryption, to ensure the reliable communication across quantum and classical channels. The other objective of this study is to balance security and communication speed among various PQC algorithms in different security levels, specifically CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, which are finalists in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization project. The quantum channel of QKD is simulated with Qiskit, which is a comprehensive and well-supported tool in the field of quantum computing. By providing a detailed analysis of the performance of these three algorithms with Rivest–Shamir–Adleman (RSA), the results will guide companies and organizations in selecting an optimal combination for their QKD systems to achieve a reliable balance between efficiency and security. Our findings demonstrate that the implemented PQC schemes effectively address security challenges posed by quantum computers, while keeping the the performance similar to RSA.