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

Enterprise Information Systems

An improved anti-quantum MST 3 public key encryption scheme for remote sensing images

Xianmin Wang, Jing Li, Hongyang Yan

Published Apr 8, 2019• 18 citations
Publisher

Abstract

Series of public key encryption (PKE) schemes have been proposed for remote sensing image encryption; however, most of these schemes are not secure against quantum attacks in the new era of quantum computing. In this paper, we present an improved anti-quantum MST3 PKE scheme for remote sensing images. Using the MST3 cryptosystem, the proposed scheme can effectively resist the current quantum attacks. Moreover, with the help of a collision-resistant hash function, the proposed method achieves a nonmalleable property with respect to possible malleable attacks. Compared with the previous MST series encryption schemes, our scheme has a slightly higher efficiency.

DOI
10.1080/17517575.2019.1600040

Related papers

Quantum Safe Cryptography Based on Hash Functions: A Survey

Mateusz Zych

The use of public key cryptosystems range from securely encrypting emails and files to creating digital signatures for non-repudiation. The security of public key cryptosystems is based on computationally "unsolvable" complex mathematical problems. This tends to change with the introduction of quantum computers that undoubtedly pose a threat to the current schemes. In response to that extensive research has been conducted that resulted in several cryptosystems that are believed to be quantum resistant. This thesis presents a concise overview of multiple hash-based signature schemes and provides a comparative description and analysis of them. The comparisons are based on different signature scheme properties, such as key sizes, signature sizes and security level provided. The proposed quantum resistant schemes are also compared to the standard schemes used today, such as RSA and ECDSA.

•Jan 1, 2018•3 citations

Quantum Public Key Encryption Protocol Based on Decoy States and Hash Function

Zedong Li, Jingtao Wang, X Chen

Quantum key distribution provides an effective means for achieving information-theoretically secure communication. Recently, Fu et al. proposed a quantum public key cryptography based on Bell states. However, this protocol cannot guarantee the integrity of information when facing tampering attacks. In this study, we first analyze the security vulnerabilities of the protocol, and then introduces the ideas of decoy states and hash functions to propose an improved quantum public key cryptography protocol. In addition, the use of unordered methods further ensures the security of information. After security analysis, it was found that this protocol can resist tampering attacks and has eavesdropping detection, which has higher security compared to existing protocols.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations

Simple PKE schemes from the TSPEM problem

Limin Zhou, Qiuyang Wang

In the quantum era, the advent of quantum computers poses significant threats to the security of current cryptosystems. Therefore, designing quantum-resistant cryptoschemes becomes important to guarantee information security. This work concentrates on the development of the post-quantum public key encryption (PKE) scheme. Non-commutative cryptography (NCC) has entered the field of post-quantum cryptography. We utilize the TSPEM problem with asymmetric structures (which serve as a potential candiate for resisting quantum attacks) to construct two PKE schemes which are demonstrated to be CPA security under the DTSPEM assumption. By representing the plaintext as a matrix, these schemes can effectively encrypt a significant amount of information in a single operation. Assuming an equal amount of messages for encryption, the proposed schemes acheive superior efficiency compared to existing PKE schemes. Structurally, our systems exhibit a level of synchronization and coexistence due to the distinct public keys $ (P) $ and ciphertexts $ (C_{1}) $. The efficiency analysis is conducted by comparing known schemes from the aspect of specific cryptographic indicators. Generally, the proposed ones offer several advantages including provable security, high efficiency, potential quantum-resistant, and relative ease of implementation; along with synchronization and coexistence. Our investigation has established the feasibility of constructing PKE schemes based on the TSPEM problem, specifically for asymmetric communication scenarios. The preliminary results pave the way for further exploration of the TSPEM problem$ ' $s potential in developing other cryptosystems suitable for quantum computing environments.

AIMS Mathematics•Jan 1, 2024•0 citations

Quantum Public Key Encryption for NISQ Devices

Nishant Rodrigues, Walter O. Krawec, Brad Lackey +2 more

Quantum public-key encryption (PKE), where public-keys and/or ciphertexts can be quantum states, is an important primitive in quantum cryptography. Unlike classical PKE (e.g., RSA or ECC), quantum PKE can leverage quantumsecure cryptographic assumptions or the principles of quantum mechanics for security. It has great potential in providing for secure cryptographic systems under potentially weaker assumptions than is possible classically. In addition, it is of both practical and theoretical interest, opening the door to novel cryptographic systems not possible with classical information alone. While multiple quantum PKE schemes have been proposed, they require a large number of qubits acting coherently, and are not practical on current noisy quantum devices. In this paper, we design a practical quantum PKE scheme, taking into account the constraints of current NISQ devices. Specifically, we design a PKE scheme with quantum-classical public keys and classical ciphertexts, that is noise-resilient and only requires a small number of qubits acting coherently. In addition, our design provides tradeoffs in terms of efficiency and the number of qubits that are required.

arXiv:2509.17758•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation

QCrypt: Advanced Quantum-based Image Encryption for Secure Satellite Data Transmission

Mohamed Ihsan P.M, Arun Amaithi Rajan, V. Vetriselvi +2 more

With the advancements in satellite communication, there arises a demand for the secure transmission of satellite and remote sensing images to the ground monitoring stations which has significant challenges due to the increased threat of cyber-attacks and the sensitive nature of those images. Existing classical cryptography methods fail to meet the advanced security demands. Thus, there arises a need for advanced cryptography techniques which ensure secure transmission of data in satellite communication. Recent advancements in quantum computing and research have shown that leveraging quantum mechanics and principles enhances security. We propose a novel quantum-based image encryption technique for securing satellite and remote sensing images during transmission named QCrypt. QCrypt utilizes the power of quantum chaotic maps, classic chaotic maps, and DNA encoding techniques to ensure the security of the images. QCrypt has been tested using a remote sensing image dataset and achieved increased performance in terms of resistance to histogram analysis, differential attacks, and chosen- plaintext attacks compared to traditional encryption methods. Our approach addresses the critical need for secure satellite data transmission and the use of quantum-based encryption to meet security demands.

International Conference on Electrical, Electronics, Information and Communication Technologies (ICEEICT)•Jul 24, 2024•6 citations

Non-malleability for quantum public-key encryption

Christian Majenz, Christian Schaffner, Jeroen van Wier

Non-malleability is an important security property for public-key encryption (PKE). Its significance is due to the fundamental unachievability of integrity and authenticity guarantees in this setting, rendering it the strongest integrity-like property achievable using only PKE, without digital signatures. In this work, we generalize this notion to the setting of quantum public-key encryption. Overcoming the notorious "recording barrier" known from generalizing other integrity-like security notions to quantum encryption, we generalize one of the equivalent classical definitions, comparison-based non-malleability, and show how it can be fulfilled. In addition, we explore one-time non-malleability notions for symmetric-key encryption from the literature by defining plaintext and ciphertext variants and by characterizing their relation.

arXiv:1905.05490•May 14, 2019•1 citation
Series of public key encryption (PKE) schemes have been proposed for remote sensing image encryption; however, most of these schemes are not secure against quantum attacks in the new era of quantum computing. In this paper, we present an improved anti-quantum MST3 PKE scheme for remote sensing images. Using the MST3 cryptosystem, the proposed scheme can effectively resist the current quantum attacks. Moreover, with the help of a collision-resistant hash function, the proposed method achieves a nonmalleable property with respect to possible malleable attacks. Compared with the previous MST series encryption schemes, our scheme has a slightly higher efficiency.
The use of public key cryptosystems range from securely encrypting emails and files to creating digital signatures for non-repudiation. The security of public key cryptosystems is based on computationally "unsolvable" complex mathematical problems. This tends to change with the introduction of quantum computers that undoubtedly pose a threat to the current schemes. In response to that extensive research has been conducted that resulted in several cryptosystems that are believed to be quantum resistant. This thesis presents a concise overview of multiple hash-based signature schemes and provides a comparative description and analysis of them. The comparisons are based on different signature scheme properties, such as key sizes, signature sizes and security level provided. The proposed quantum resistant schemes are also compared to the standard schemes used today, such as RSA and ECDSA.
Quantum key distribution provides an effective means for achieving information-theoretically secure communication. Recently, Fu et al. proposed a quantum public key cryptography based on Bell states. However, this protocol cannot guarantee the integrity of information when facing tampering attacks. In this study, we first analyze the security vulnerabilities of the protocol, and then introduces the ideas of decoy states and hash functions to propose an improved quantum public key cryptography protocol. In addition, the use of unordered methods further ensures the security of information. After security analysis, it was found that this protocol can resist tampering attacks and has eavesdropping detection, which has higher security compared to existing protocols.
In the quantum era, the advent of quantum computers poses significant threats to the security of current cryptosystems. Therefore, designing quantum-resistant cryptoschemes becomes important to guarantee information security. This work concentrates on the development of the post-quantum public key encryption (PKE) scheme. Non-commutative cryptography (NCC) has entered the field of post-quantum cryptography. We utilize the TSPEM problem with asymmetric structures (which serve as a potential candiate for resisting quantum attacks) to construct two PKE schemes which are demonstrated to be CPA security under the DTSPEM assumption. By representing the plaintext as a matrix, these schemes can effectively encrypt a significant amount of information in a single operation. Assuming an equal amount of messages for encryption, the proposed schemes acheive superior efficiency compared to existing PKE schemes. Structurally, our systems exhibit a level of synchronization and coexistence due to the distinct public keys $ (P) $ and ciphertexts $ (C_{1}) .Theefficiencyanalysisisconductedbycomparingknownschemesfromtheaspectofspecificcryptographicindicators.Generally,theproposedonesofferseveraladvantagesincludingprovablesecurity,highefficiency,potentialquantum−resistant,andrelativeeaseofimplementation;alongwithsynchronizationandcoexistence.OurinvestigationhasestablishedthefeasibilityofconstructingPKEschemesbasedontheTSPEMproblem,specificallyforasymmetriccommunicationscenarios.ThepreliminaryresultspavethewayforfurtherexplorationoftheTSPEMproblem. The efficiency analysis is conducted by comparing known schemes from the aspect of specific cryptographic indicators. Generally, the proposed ones offer several advantages including provable security, high efficiency, potential quantum-resistant, and relative ease of implementation; along with synchronization and coexistence. Our investigation has established the feasibility of constructing PKE schemes based on the TSPEM problem, specifically for asymmetric communication scenarios. The preliminary results pave the way for further exploration of the TSPEM problem.Theefficiencyanalysisisconductedbycomparingknownschemesfromtheaspectofspecificcryptographicindicators.Generally,theproposedonesofferseveraladvantagesincludingprovablesecurity,highefficiency,potentialquantum−resistant,andrelativeeaseofimplementation;alongwithsynchronizationandcoexistence.OurinvestigationhasestablishedthefeasibilityofconstructingPKEschemesbasedontheTSPEMproblem,specificallyforasymmetriccommunicationscenarios.ThepreliminaryresultspavethewayforfurtherexplorationoftheTSPEMproblem ' $s potential in developing other cryptosystems suitable for quantum computing environments.
Quantum public-key encryption (PKE), where public-keys and/or ciphertexts can be quantum states, is an important primitive in quantum cryptography. Unlike classical PKE (e.g., RSA or ECC), quantum PKE can leverage quantumsecure cryptographic assumptions or the principles of quantum mechanics for security. It has great potential in providing for secure cryptographic systems under potentially weaker assumptions than is possible classically. In addition, it is of both practical and theoretical interest, opening the door to novel cryptographic systems not possible with classical information alone. While multiple quantum PKE schemes have been proposed, they require a large number of qubits acting coherently, and are not practical on current noisy quantum devices. In this paper, we design a practical quantum PKE scheme, taking into account the constraints of current NISQ devices. Specifically, we design a PKE scheme with quantum-classical public keys and classical ciphertexts, that is noise-resilient and only requires a small number of qubits acting coherently. In addition, our design provides tradeoffs in terms of efficiency and the number of qubits that are required.
With the advancements in satellite communication, there arises a demand for the secure transmission of satellite and remote sensing images to the ground monitoring stations which has significant challenges due to the increased threat of cyber-attacks and the sensitive nature of those images. Existing classical cryptography methods fail to meet the advanced security demands. Thus, there arises a need for advanced cryptography techniques which ensure secure transmission of data in satellite communication. Recent advancements in quantum computing and research have shown that leveraging quantum mechanics and principles enhances security. We propose a novel quantum-based image encryption technique for securing satellite and remote sensing images during transmission named QCrypt. QCrypt utilizes the power of quantum chaotic maps, classic chaotic maps, and DNA encoding techniques to ensure the security of the images. QCrypt has been tested using a remote sensing image dataset and achieved increased performance in terms of resistance to histogram analysis, differential attacks, and chosen- plaintext attacks compared to traditional encryption methods. Our approach addresses the critical need for secure satellite data transmission and the use of quantum-based encryption to meet security demands.
Non-malleability is an important security property for public-key encryption (PKE). Its significance is due to the fundamental unachievability of integrity and authenticity guarantees in this setting, rendering it the strongest integrity-like property achievable using only PKE, without digital signatures. In this work, we generalize this notion to the setting of quantum public-key encryption. Overcoming the notorious "recording barrier" known from generalizing other integrity-like security notions to quantum encryption, we generalize one of the equivalent classical definitions, comparison-based non-malleability, and show how it can be fulfilled. In addition, we explore one-time non-malleability notions for symmetric-key encryption from the literature by defining plaintext and ciphertext variants and by characterizing their relation.