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

Radiotekhnika

Classification and analysis of vulnerabilities of modern information systems from classical and quantum attacks

Ye.V. Ostrianska, Serhii Kandii, І.Д. Горбенко, Maryna V. Yesina

Published Dec 30, 2022• 2 citations
Publisher

Abstract

Recent advances in quantum technology and the potential that practical quantum computers may become a reality in the future have led to renewed interest in developing cryptographic technologies that are secure against conventional and quantum attacks. Currently, virtually all asymmetric cryptographic schemes in use are threatened by the potential development of powerful quantum computers. Post-quantum cryptography is one of main the ways to combat this threat. Its security is based on the complexity of mathematical problems that are currently considered unsolvable efficiently, even with the help of quantum computers. The security of information systems is ensured through protection against various threats that use system vulnerabilities. Security protocols are the building blocks of secure communication. They implement security mechanisms to provide security services. Security protocols are considered abstract when analyzed, but may have additional vulnerabilities in implementation. This work contains a holistic study of security protocols. Basics of security protocols, taxonomy of attacks on security protocols and their implementation are considered, as well as various methods and models of protocol security analysis. In particular, the differences between information-theoretic and computational security, computational and symbolic models are specified. In addition, an overview of the computational security models for Authenticated Key Exchange (AKE) and Password Authentication Key Exchange (PAKE) protocols is provided. The most important security models for the AKE and PAKE protocols were also described. With the emergence of new technologies that may have different security requirements, as well as with increased opportunities for competition, there is always a need to develop new protocols. Thus, the purpose of this article is to review, classify, analyze, and research the vulnerabilities of information systems from classical, quantum, and special attacks, performed taking into account the forecast regarding the possibilities of attacks on post-quantum cryptographic transformations; studying security assessment models for existing cryptographic protocols, as well as reviewing and benchmarking security models and providing suggestions for protection against existing potential attacks.

DOI
10.30837/rt.2022.4.211.01

Related papers

A Survey of Quantum Computing Security Protocols: Frameworks and Vulnerabilities

Dr Rajendirakumar S

Abstract Quantum computing promises unprecedented computational power, posing fundamental threats and offering novel solutions to modern cryptography and cybersecurity. This survey paper reviews the rapidly evolving landscape of quantum-resistant and quantum-native security protocols. By analyzing foundational computational security models and the unique vulnerabilities introduced by quantum algorithms, this work proposes a structured evaluation framework for assessing the robustness of cryptographic systems. Ultimately, this survey highlights the critical transition from classical cryptographic infrastructures to quantum-secure paradigms, ensuring data confidentiality and integrity in the post-quantum era. Keywords: Quantum Computing, Security Protocol, Vulnerabilities 1.Introduction The emergence of quantum computing represents a paradigm shift in both computational physics and information technology. Quantum algorithms, particularly Shor's and Grover's algorithms, inherently challenge the mathematical foundations of classical public-key cryptography. As a result, securing communication channels against quantum-empowered adversaries has become an urgent priority for global infrastructure and national security. The motivation for this survey stems from the immediate need to bridge the gap between theoretical quantum mechanics and applied cybersecurity, ensuring that secure communications can withstand the computational leaps expected in the next decade. The core problem addressed in this paper is the comprehensive evaluation of security protocols under the threat model of a fully scalable quantum computer. The scope encompasses both post-quantum cryptographic (PQC) protocols and inherently quantum protocols, such as those relying on physical quantum states for key distribution. Existing classical approaches are insufficient for two main reasons. First, classical computational security models often rely on mathematical hardness assumptions (like integer factorization) that are rapidly undermined by theoretical quantum algorithms. Second, current software tools for designing secure classical protocols fail to account for quantum state phenomena, such as superposition and entanglement, rendering classical verification methods inadequate for quantum threat models. To address these structural challenges, this paper presents the following contributions: We provide a comprehensive taxonomy of vulnerabilities in both classical and quantum security protocols, mapping specific algorithmic advantages to protocol failure points. We propose a structured, multi-module framework for simulating, attacking, and verifying the security of hybrid quantum-classical cryptographic architectures. 2.Foundations of Classical Protocol Analysis The rigorous analysis of security protocols has traditionally relied on well-defined computational and symbolic models (Toorani, 2016). Researchers have extensively mapped out the taxonomy of attacks on authenticated key exchange (AKE) protocols and password-authenticated key exchange (PAKE) systems, establishing the mathematical groundwork for secure communication. The core idea of these foundational works is to establish provable security bounds that distinguish between information-theoretic and computational security. While this traditional paradigm offers strong mathematical guarantees against classical adversaries, its primary weakness is the failure to incorporate quantum attack vectors into the adversary's capability profile. Our work builds upon these classical models by explicitly injecting quantum algorithmic capabilities into standard protocol verification routines. 2.1.Quantum Algorithm Development and Simulation A significant body of literature focuses on the theoretical development and computational simulation of quantum algorithms capable of compromising or enhancing network security. Academic overviews have formalized algorithms like Grover's and Shor's, demonstrating their theoretical efficiency over classical counterparts in breaking cryptographic primitives. Furthermore, researchers have developed advanced design automation tools, such as decision diagrams, to simulate and verify complex quantum circuits. The strength of these simulation tools lies in their ability to model complex quantum states without requiring expensive physical hardware. However, a notable weakness is that they often abstract away the physical noise and hardware constraints that exist in real-world cryptographic deployments. This survey contextualizes these simulation techniques specifically within the framework of adversarial security testing, bridging theoretical algorithms with practical protocol defense. 3.Physical Implementations and Hardware Considerations Beyond algorithmic theory, the physical realization of quantum states directly impacts the practical security of any quantum protocol. Research into cavity quantum electrodynamics (QED) has demonstrated the complete mathematical construction of fundamental quantum gates, such as the controlled-controlled NOT gate, operating in the weak coupling regime (Fujii et al., 2005). Additionally, methods like Quantum Computed Moments (QCM) address the hardware constraints and noise typical of Near-Term Intermediate Scale Quantum (NISQ) devices, estimating ground state properties even with suboptimal trial states. The strength of this hardware-focused research is its realism regarding current technological limits; however, it often lacks a direct bridge to high-level network protocol verification. Compared to these purely physical studies, our survey integrates physical noise models into a generalized, software-driven protocol verification framework. 4.Approach To systematically evaluate quantum computing security protocols, we propose a structured Quantum Protocol Verification Framework (QPVF). The first module is the "Threat Modeling Engine," which defines the adversary's capabilities, ranging from classical data interception to full quantum memory manipulation. The second module is the "Quantum Circuit Synthesizer," which leverages decision diagram-based tools to translate high-level cryptographic operations into verifiable quantum circuits. The final module is the "Vulnerability Analyzer," which subjects the synthesized circuits to simulated quantum attacks, effectively distinguishing between idealized computational security and realistic hardware-constrained security. This modular pipeline allows security engineers to isolate specific vulnerabilities at both the abstract algorithmic layer and the simulated physical implementation layer. A key design choice in the QPVF is the utilization of decision diagrams for circuit simulation. This choice is predicated on the fact that decision diagrams efficiently handle the exponential state space of quantum systems during complex verification tasks (Wille et al., 2021). Furthermore, our framework explicitly incorporates noise models derived from current NISQ hardware limitations, ensuring that the security evaluation reflects realistic physical constraints rather than purely idealized environments (Vallury & Hollenberg, 2023). To evaluate this framework, we propose a hypothetical benchmarking plan using an artificially generated dataset of 10,000 hybrid quantum-classical cryptographic key exchanges. We will measure the success rate of simulated Grover-based brute-force attacks against varying key sizes and simulated environmental noise levels. This evaluation will compare the theoretical vulnerability threshold of a protocol against the practical threshold observed when quantum noise severely degrades the adversary's computational capabilities. The operational flow of the QPVF is designed to provide end-to-end security verification for next-generation networks. It bridges the critical gap between abstract protocol design and simulated hardware execution. The methodology can be summarized by the following numbered pipeline: Protocol Ingestion: The classical or quantum protocol is parsed into a standardized symbolic representation. Adversary Assignment: The user assigns a precise computational profile, selecting between traditional classical algorithms or advanced quantum capabilities. Circuit Generation: Protocol steps are mapped to equivalent quantum decision diagrams for scalable software simulation. Execution & Attack: Simulated quantum algorithms are executed against the mapped circuits to test for cryptographic resilience. Output Generation: The system outputs a vulnerability score and highlights specific failure points caused by either algorithmic weaknesses or simulated hardware noise. 5.Discussion The transition to quantum-secure protocols carries profound practical implications for global information infrastructure and enterprise deployment. Deploying these advanced protocols requires immense updates to existing software toolkits, as current digital systems are not fundamentally designed to handle the complexity of quantum states. Furthermore, organizations must consider the massive educational and workforce development efforts needed to train software engineers in quantum cryptography, a requirement already highlighted by international hackathons and educational initiatives. Integrating quantum-resistant protocols into complex domains like high-energy physics networks or global banking systems will require bridging the gap between theoretical quantum mechanics and applied computer engineering. Consequently, practical deployment must occur in hybrid phases, maintaining classical cryptographic wrappers while dedicated quantum infrastructure matures. Despite the robust theoretical design of proposed quantum security frameworks, several limitations and failure modes persist in practical applications. First, physical implementation attacks, such as side-channel attacks on the lasers and cavities used in physical quantum gates can bypass theoretical software security guarant

•Mar 15, 2025•0 citations

ANALYSIS OF QUANTUM SECURE DIRECT COMMUNICATION PROTOCOLS

Тетяна Охріменко, Serhii Dorozhynskyi, Bohdan Horbakha

The development of modern computer technologies endangers the confidentiality of information, which is usually ensured by traditional cryptographic means. This circumstance forces us to look for new methods of protection. In view of modern trends, quantum cryptography methods can become such alternatives, which allow solving a number of important cryptographic problems, for which the impossibility of solving using only classical (that is, non-quantum) communication has been proven. Quantum cryptography is a branch of quantum informatics that studies methods of protecting information by using quantum carriers. The possibility of such protection is ensured by the fundamental laws of quantum mechanics. One of the promising directions of quantum cryptography is Quantum Secure Direct Communication (QSDC) that offers secure communication without any shared key. A characteristic feature of this method is the absence of cryptographic transformations, accordingly, there is no key distribution problem. The purpose of this work is a general overview of quantum cryptography protocols, finding their weak points for further development and improvement, as well as identifying vulnerabilities to different attacks. The article analyzes new methods and protocols, as well as presents their advantages and disadvantages. Based on partial generalizations of theoretical provisions and practical achievements in the field of quantum cryptography, a generalized classification was developed. By comparing various factors of the protocols, and their resistance to certain cyberattacks, we have the opportunity to identify several problems in this field and expand the possibilities for choosing appropriate methods for building modern quantum information protection systems. In accordance with this, conclusions were presented regarding the use of protocols and increasing the level of their effectiveness.

Computer Systems and Information Technologies•Mar 30, 2023•0 citations

Quantum Safe Cryptography using Modern Hybrid Cryptography Techniques to Secure Data

Gurjit Singh Bhathal, Udaibir Singh Bhathal

Cryptography, the practice of concealing messages for private exchange, has evolved significantly to address the challenges posed by new communication methods. In today`s digital world, cryptography has become the cornerstone of cybersecurity, using advanced mathematics like number theory and computational complexity to protect digital information through algorithms. The upcoming arrival of quantum computers poses a serious threat to traditional cryptographic methods, especially those based on asymmetric key cryptography. Quantum Safe Cryptography (QSC) represents the next step in information security, designed to develop cryptographic systems that can withstand attacks from both quantum and classical computers. As quantum computing moves from theory to reality, it`s becoming clear that current cryptographic methods based on integer factorization and discrete logarithm problems are vulnerable to quantum algorithms like Shor`s algorithm. This study highlights the security risks that quantum computing poses to existing encryption methods and proposes a comprehensive approach to quantum-safe cryptography. The transition to quantum-resistant algorithms involves replacing vulnerable cryptographic systems with alternatives that can resist quantum computational attacks. Current analysis shows that while asymmetric key cryptography faces immediate vulnerability, symmetric key algorithms and hash functions remain relatively secure in the near term with appropriate adjustments. Quantum cryptography, which directly uses quantum mechanical principles, offers highly secure encryption mechanisms, notably Quantum Key Distribution (QKD). This research aims to enhance the security of digital infrastructure against quantum threats by evaluating hybrid cryptographic implementations that combine classical and quantum-resistant approaches for optimal security.

International Journal of Computer Sciences and Engineering•Apr 30, 2025•0 citations

A Systematic Review: Post Quantum Cryptography to Secure Data Transmission

Asma Ibrahim Hussein, Abeer Tariq Maolood, Ekhlas Khalaf Gbashi

A significant topic of contemporary cryptography research and standardization is the development of public key crypto systems that resist attacks from quantum computers. Protocols and applications should start investigating the use of quantum-resistant key exchange and encryption to protect the confidentiality of current communications against future quantum computers utilizing post-quantum cryptography for a particular key exchange. Since they operate harder and need fewer steps compared to conventional computers, quantum algorithms are more secure and robust. Attackers who use quantum computers have powerful computing capabilities, and a quantum allows for simple cryptographic system breaking. Security algorithms that are quantum secure are resistant to attacks from conventional, as well as quantum computers. This work has surveyed, summarized, and analysed previous research to provide readers of this study an integrated understanding of quantum cryptography. It also discusses quantum attacks, which could be used in place of more conventional cryptography techniques, such as quantum key distribution, which takes advantage of quantum mechanics' properties to ensure secure exchanges of the secret keys, and various quantum algorithms. With quantum computation becoming a very real threat, this should motivate more people to show an early interest in the future of cryptography.

Iraqi Journal of Science•Jul 30, 2024•5 citations

A Review of the Present Cryptographic Arsenal to Deal with Post-Quantum Threats

Gagan Yalamuri, Prasad B. Honnavalli, Sivaraman Eswaran

The looming threat of quantum attacks on the digital infrastructure protected by conventional cryptographic protocol has generated urgency in identifying and deploying countermeasures that can mitigate the threat. There is a need for stronger cryptographic schemes that combine the strengths of both classic and quantum technologies. Post-Quantum Cryptography (PQC) has emerged as a potential solution that can withstand the challenges posed by advances in quantum computing. Owing to the increasing importance of PQC, the present research is an attempt to assess the existing research done so far so that the existing gaps can be identified which can then strengthen the existing literature. The systematic literature review presented in this work has outlined six key categories of PQC, namely, lattice-based, code-based, hash-based, multivariate, isogeny-based, symmetric-key-based cryptosystems. The study concluded that the advances made in quantum computing will result in the development of quantum computers with superior computational power. Such highly efficient quantum computers will have the ability to break the currently available cryptography schemes most used in a variety of practical applications. With the advent of quantum computing, the computational capabilities of the potential cyber attackers would grow exponentially, which would render the traditional cyber security measures inadequate. This calls for techniques like PQC to be developed and strengthen.

Procedia Computer Science•Jan 1, 2022•37 citations

Research in the field of quantum-safe cryptography

Т. С. Берестяна

Quantum computing, based on the principles of quantum mechanics, is rapidly gaining momentum as a promising field of information technology.However, with the growing capabilities of quantum computing comes a new level of cybersecurity.Quantum-secure cryptography is emerging as a response to the potential threats posed by quantum computers to traditional cryptographic methods.The main goal of quantum-secure cryptography is to ensure the security of data in information systems, as quantum computing becomes more and more accessible.In this study, we thoroughly studied the essence of quantum-secure cryptography, its fundamental principles and applications.We have explored the advantages and limitations of this new cryptographic paradigm and discussed the potential challenges that arise in the context of its implementation.In addition, we analyzed the current state of research in the field of quantum-secure cryptography and highlighted the prospects for further development of this intriguing technology.We have researched potential threats and possible ways to solve them.Additionally, we reviewed a quantum risk assessment methodology that helps identify and manage threats in the context of quantum security.Finally, we trace existing examples and recent developments in the field of quantum-secure cryptography, revealing their potential to improve information security in the future.Overall, the research allows for a better understanding of the importance and prospects of quantum-secure cryptography in today's digital world.

Modern information security•Jan 1, 2024•0 citations
Recent advances in quantum technology and the potential that practical quantum computers may become a reality in the future have led to renewed interest in developing cryptographic technologies that are secure against conventional and quantum attacks. Currently, virtually all asymmetric cryptographic schemes in use are threatened by the potential development of powerful quantum computers. Post-quantum cryptography is one of main the ways to combat this threat. Its security is based on the complexity of mathematical problems that are currently considered unsolvable efficiently, even with the help of quantum computers. The security of information systems is ensured through protection against various threats that use system vulnerabilities. Security protocols are the building blocks of secure communication. They implement security mechanisms to provide security services. Security protocols are considered abstract when analyzed, but may have additional vulnerabilities in implementation. This work contains a holistic study of security protocols. Basics of security protocols, taxonomy of attacks on security protocols and their implementation are considered, as well as various methods and models of protocol security analysis. In particular, the differences between information-theoretic and computational security, computational and symbolic models are specified. In addition, an overview of the computational security models for Authenticated Key Exchange (AKE) and Password Authentication Key Exchange (PAKE) protocols is provided. The most important security models for the AKE and PAKE protocols were also described. With the emergence of new technologies that may have different security requirements, as well as with increased opportunities for competition, there is always a need to develop new protocols. Thus, the purpose of this article is to review, classify, analyze, and research the vulnerabilities of information systems from classical, quantum, and special attacks, performed taking into account the forecast regarding the possibilities of attacks on post-quantum cryptographic transformations; studying security assessment models for existing cryptographic protocols, as well as reviewing and benchmarking security models and providing suggestions for protection against existing potential attacks.
Abstract Quantum computing promises unprecedented computational power, posing fundamental threats and offering novel solutions to modern cryptography and cybersecurity. This survey paper reviews the rapidly evolving landscape of quantum-resistant and quantum-native security protocols. By analyzing foundational computational security models and the unique vulnerabilities introduced by quantum algorithms, this work proposes a structured evaluation framework for assessing the robustness of cryptographic systems. Ultimately, this survey highlights the critical transition from classical cryptographic infrastructures to quantum-secure paradigms, ensuring data confidentiality and integrity in the post-quantum era. Keywords: Quantum Computing, Security Protocol, Vulnerabilities 1.Introduction The emergence of quantum computing represents a paradigm shift in both computational physics and information technology. Quantum algorithms, particularly Shor's and Grover's algorithms, inherently challenge the mathematical foundations of classical public-key cryptography. As a result, securing communication channels against quantum-empowered adversaries has become an urgent priority for global infrastructure and national security. The motivation for this survey stems from the immediate need to bridge the gap between theoretical quantum mechanics and applied cybersecurity, ensuring that secure communications can withstand the computational leaps expected in the next decade. The core problem addressed in this paper is the comprehensive evaluation of security protocols under the threat model of a fully scalable quantum computer. The scope encompasses both post-quantum cryptographic (PQC) protocols and inherently quantum protocols, such as those relying on physical quantum states for key distribution. Existing classical approaches are insufficient for two main reasons. First, classical computational security models often rely on mathematical hardness assumptions (like integer factorization) that are rapidly undermined by theoretical quantum algorithms. Second, current software tools for designing secure classical protocols fail to account for quantum state phenomena, such as superposition and entanglement, rendering classical verification methods inadequate for quantum threat models. To address these structural challenges, this paper presents the following contributions: We provide a comprehensive taxonomy of vulnerabilities in both classical and quantum security protocols, mapping specific algorithmic advantages to protocol failure points. We propose a structured, multi-module framework for simulating, attacking, and verifying the security of hybrid quantum-classical cryptographic architectures. 2.Foundations of Classical Protocol Analysis The rigorous analysis of security protocols has traditionally relied on well-defined computational and symbolic models (Toorani, 2016). Researchers have extensively mapped out the taxonomy of attacks on authenticated key exchange (AKE) protocols and password-authenticated key exchange (PAKE) systems, establishing the mathematical groundwork for secure communication. The core idea of these foundational works is to establish provable security bounds that distinguish between information-theoretic and computational security. While this traditional paradigm offers strong mathematical guarantees against classical adversaries, its primary weakness is the failure to incorporate quantum attack vectors into the adversary's capability profile. Our work builds upon these classical models by explicitly injecting quantum algorithmic capabilities into standard protocol verification routines. 2.1.Quantum Algorithm Development and Simulation A significant body of literature focuses on the theoretical development and computational simulation of quantum algorithms capable of compromising or enhancing network security. Academic overviews have formalized algorithms like Grover's and Shor's, demonstrating their theoretical efficiency over classical counterparts in breaking cryptographic primitives. Furthermore, researchers have developed advanced design automation tools, such as decision diagrams, to simulate and verify complex quantum circuits. The strength of these simulation tools lies in their ability to model complex quantum states without requiring expensive physical hardware. However, a notable weakness is that they often abstract away the physical noise and hardware constraints that exist in real-world cryptographic deployments. This survey contextualizes these simulation techniques specifically within the framework of adversarial security testing, bridging theoretical algorithms with practical protocol defense. 3.Physical Implementations and Hardware Considerations Beyond algorithmic theory, the physical realization of quantum states directly impacts the practical security of any quantum protocol. Research into cavity quantum electrodynamics (QED) has demonstrated the complete mathematical construction of fundamental quantum gates, such as the controlled-controlled NOT gate, operating in the weak coupling regime (Fujii et al., 2005). Additionally, methods like Quantum Computed Moments (QCM) address the hardware constraints and noise typical of Near-Term Intermediate Scale Quantum (NISQ) devices, estimating ground state properties even with suboptimal trial states. The strength of this hardware-focused research is its realism regarding current technological limits; however, it often lacks a direct bridge to high-level network protocol verification. Compared to these purely physical studies, our survey integrates physical noise models into a generalized, software-driven protocol verification framework. 4.Approach To systematically evaluate quantum computing security protocols, we propose a structured Quantum Protocol Verification Framework (QPVF). The first module is the "Threat Modeling Engine," which defines the adversary's capabilities, ranging from classical data interception to full quantum memory manipulation. The second module is the "Quantum Circuit Synthesizer," which leverages decision diagram-based tools to translate high-level cryptographic operations into verifiable quantum circuits. The final module is the "Vulnerability Analyzer," which subjects the synthesized circuits to simulated quantum attacks, effectively distinguishing between idealized computational security and realistic hardware-constrained security. This modular pipeline allows security engineers to isolate specific vulnerabilities at both the abstract algorithmic layer and the simulated physical implementation layer. A key design choice in the QPVF is the utilization of decision diagrams for circuit simulation. This choice is predicated on the fact that decision diagrams efficiently handle the exponential state space of quantum systems during complex verification tasks (Wille et al., 2021). Furthermore, our framework explicitly incorporates noise models derived from current NISQ hardware limitations, ensuring that the security evaluation reflects realistic physical constraints rather than purely idealized environments (Vallury & Hollenberg, 2023). To evaluate this framework, we propose a hypothetical benchmarking plan using an artificially generated dataset of 10,000 hybrid quantum-classical cryptographic key exchanges. We will measure the success rate of simulated Grover-based brute-force attacks against varying key sizes and simulated environmental noise levels. This evaluation will compare the theoretical vulnerability threshold of a protocol against the practical threshold observed when quantum noise severely degrades the adversary's computational capabilities. The operational flow of the QPVF is designed to provide end-to-end security verification for next-generation networks. It bridges the critical gap between abstract protocol design and simulated hardware execution. The methodology can be summarized by the following numbered pipeline: Protocol Ingestion: The classical or quantum protocol is parsed into a standardized symbolic representation. Adversary Assignment: The user assigns a precise computational profile, selecting between traditional classical algorithms or advanced quantum capabilities. Circuit Generation: Protocol steps are mapped to equivalent quantum decision diagrams for scalable software simulation. Execution & Attack: Simulated quantum algorithms are executed against the mapped circuits to test for cryptographic resilience. Output Generation: The system outputs a vulnerability score and highlights specific failure points caused by either algorithmic weaknesses or simulated hardware noise. 5.Discussion The transition to quantum-secure protocols carries profound practical implications for global information infrastructure and enterprise deployment. Deploying these advanced protocols requires immense updates to existing software toolkits, as current digital systems are not fundamentally designed to handle the complexity of quantum states. Furthermore, organizations must consider the massive educational and workforce development efforts needed to train software engineers in quantum cryptography, a requirement already highlighted by international hackathons and educational initiatives. Integrating quantum-resistant protocols into complex domains like high-energy physics networks or global banking systems will require bridging the gap between theoretical quantum mechanics and applied computer engineering. Consequently, practical deployment must occur in hybrid phases, maintaining classical cryptographic wrappers while dedicated quantum infrastructure matures. Despite the robust theoretical design of proposed quantum security frameworks, several limitations and failure modes persist in practical applications. First, physical implementation attacks, such as side-channel attacks on the lasers and cavities used in physical quantum gates can bypass theoretical software security guarant
The development of modern computer technologies endangers the confidentiality of information, which is usually ensured by traditional cryptographic means. This circumstance forces us to look for new methods of protection. In view of modern trends, quantum cryptography methods can become such alternatives, which allow solving a number of important cryptographic problems, for which the impossibility of solving using only classical (that is, non-quantum) communication has been proven. Quantum cryptography is a branch of quantum informatics that studies methods of protecting information by using quantum carriers. The possibility of such protection is ensured by the fundamental laws of quantum mechanics. One of the promising directions of quantum cryptography is Quantum Secure Direct Communication (QSDC) that offers secure communication without any shared key. A characteristic feature of this method is the absence of cryptographic transformations, accordingly, there is no key distribution problem. The purpose of this work is a general overview of quantum cryptography protocols, finding their weak points for further development and improvement, as well as identifying vulnerabilities to different attacks. The article analyzes new methods and protocols, as well as presents their advantages and disadvantages. Based on partial generalizations of theoretical provisions and practical achievements in the field of quantum cryptography, a generalized classification was developed. By comparing various factors of the protocols, and their resistance to certain cyberattacks, we have the opportunity to identify several problems in this field and expand the possibilities for choosing appropriate methods for building modern quantum information protection systems. In accordance with this, conclusions were presented regarding the use of protocols and increasing the level of their effectiveness.
Cryptography, the practice of concealing messages for private exchange, has evolved significantly to address the challenges posed by new communication methods. In today`s digital world, cryptography has become the cornerstone of cybersecurity, using advanced mathematics like number theory and computational complexity to protect digital information through algorithms. The upcoming arrival of quantum computers poses a serious threat to traditional cryptographic methods, especially those based on asymmetric key cryptography. Quantum Safe Cryptography (QSC) represents the next step in information security, designed to develop cryptographic systems that can withstand attacks from both quantum and classical computers. As quantum computing moves from theory to reality, it`s becoming clear that current cryptographic methods based on integer factorization and discrete logarithm problems are vulnerable to quantum algorithms like Shor`s algorithm. This study highlights the security risks that quantum computing poses to existing encryption methods and proposes a comprehensive approach to quantum-safe cryptography. The transition to quantum-resistant algorithms involves replacing vulnerable cryptographic systems with alternatives that can resist quantum computational attacks. Current analysis shows that while asymmetric key cryptography faces immediate vulnerability, symmetric key algorithms and hash functions remain relatively secure in the near term with appropriate adjustments. Quantum cryptography, which directly uses quantum mechanical principles, offers highly secure encryption mechanisms, notably Quantum Key Distribution (QKD). This research aims to enhance the security of digital infrastructure against quantum threats by evaluating hybrid cryptographic implementations that combine classical and quantum-resistant approaches for optimal security.
A significant topic of contemporary cryptography research and standardization is the development of public key crypto systems that resist attacks from quantum computers. Protocols and applications should start investigating the use of quantum-resistant key exchange and encryption to protect the confidentiality of current communications against future quantum computers utilizing post-quantum cryptography for a particular key exchange. Since they operate harder and need fewer steps compared to conventional computers, quantum algorithms are more secure and robust. Attackers who use quantum computers have powerful computing capabilities, and a quantum allows for simple cryptographic system breaking. Security algorithms that are quantum secure are resistant to attacks from conventional, as well as quantum computers. This work has surveyed, summarized, and analysed previous research to provide readers of this study an integrated understanding of quantum cryptography. It also discusses quantum attacks, which could be used in place of more conventional cryptography techniques, such as quantum key distribution, which takes advantage of quantum mechanics' properties to ensure secure exchanges of the secret keys, and various quantum algorithms. With quantum computation becoming a very real threat, this should motivate more people to show an early interest in the future of cryptography.
The looming threat of quantum attacks on the digital infrastructure protected by conventional cryptographic protocol has generated urgency in identifying and deploying countermeasures that can mitigate the threat. There is a need for stronger cryptographic schemes that combine the strengths of both classic and quantum technologies. Post-Quantum Cryptography (PQC) has emerged as a potential solution that can withstand the challenges posed by advances in quantum computing. Owing to the increasing importance of PQC, the present research is an attempt to assess the existing research done so far so that the existing gaps can be identified which can then strengthen the existing literature. The systematic literature review presented in this work has outlined six key categories of PQC, namely, lattice-based, code-based, hash-based, multivariate, isogeny-based, symmetric-key-based cryptosystems. The study concluded that the advances made in quantum computing will result in the development of quantum computers with superior computational power. Such highly efficient quantum computers will have the ability to break the currently available cryptography schemes most used in a variety of practical applications. With the advent of quantum computing, the computational capabilities of the potential cyber attackers would grow exponentially, which would render the traditional cyber security measures inadequate. This calls for techniques like PQC to be developed and strengthen.
Quantum computing, based on the principles of quantum mechanics, is rapidly gaining momentum as a promising field of information technology.However, with the growing capabilities of quantum computing comes a new level of cybersecurity.Quantum-secure cryptography is emerging as a response to the potential threats posed by quantum computers to traditional cryptographic methods.The main goal of quantum-secure cryptography is to ensure the security of data in information systems, as quantum computing becomes more and more accessible.In this study, we thoroughly studied the essence of quantum-secure cryptography, its fundamental principles and applications.We have explored the advantages and limitations of this new cryptographic paradigm and discussed the potential challenges that arise in the context of its implementation.In addition, we analyzed the current state of research in the field of quantum-secure cryptography and highlighted the prospects for further development of this intriguing technology.We have researched potential threats and possible ways to solve them.Additionally, we reviewed a quantum risk assessment methodology that helps identify and manage threats in the context of quantum security.Finally, we trace existing examples and recent developments in the field of quantum-secure cryptography, revealing their potential to improve information security in the future.Overall, the research allows for a better understanding of the importance and prospects of quantum-secure cryptography in today's digital world.