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

International journal of network security

Quantum Informational Divergence in Quantum Channel Security Analysis

László Gyöngyösi, Sándor Imre

Published Jan 1, 2011• 2 citations
OpenAlex

Abstract

Abstract Computational Geometry is the art of designing efficientalgorithms for answering geometric questions. Computa-tional Geometry involves efficient and elegant solutionsfor difficult algorithmic problems and plays a central rolein many different areas of computer science. Quantumcloning-based attacks have deep relevance to quantumcryptography. In this paper we use the results of clas-sical Computational Geometry to analyze the security ofa quantum channel using current classical computer ar-chitectures. To analyze a quantum channel for a largenumber of input quantum states with classical computerarchitectures, very fast and effective algorithms are re-quired.Keywords: Quantum communication, quantum cryptogra-phy, quantum informational distance 1 Introduction In today’s communication networks, the widespread useof optical fiber and passive optical elements allows to usequantum cryptography in the current standard opticalnetwork infrastructure. In the past few years, quantumkey distribution schemes have attracted much study. Thesecurity of modern cryptographic methods, like asymmet-ric cryptography, relies heavily on the problem of factor-ing large integers [7]. In the future, if quantum computersbecome reality, any information exchange using currentclassical cryptographic schemes will be immediately inse-cure [11, 13]. Current classical cryptographic methods arenot able to guarantee long-term security. Other crypto-graphic methods, with absolute security must be appliedin the future. Cryptography based on the principles ofquantum theory is known as quantum cryptography. Us-ing current network technology, in order to spread quan-tum cryptography, interfaces must be implemented thatare able to manage together the quantum and classicalchannels [10].Many challenging hard algorithmic problems can bestudied with computational geometry and, at present,there exist many geometric algorithms that offer an effi-cient and well implementable solution for hard computa-tional problems. Computational Geometry was originallyfocused on the construction of efficient algorithms and itprovides a very valuable and efficient tool for computinghard tasks [8]. In many cases, the traditional linear pro-gramming methods are not very efficient. The computa-tion of the convex hull between quantum states cannot becomputed efficiently by linear programming, however themethods of computational geometry are better at solvingthese kinds of hard problems [18, 3, 8]. ComputationalGeometry uses the results of classical geometry and thepower of computing. In Figure 1, we illustrate the logicalstructure of the analysis and the cooperation of classi-cal and quantum systems. To this day, the most efficientclassical algorithms for this purpose are computationalgeometric methods. We use these classical computationalgeometrictoolsto analyzethe securityofa quantum chan-nel.

Related papers

Quantum Informational Geometry for Secret Quantum Communication

László Gyöngyösi, Sándor Imre

The problem of quantum cloning is closely connected to quantum cryptography. In quantum cryptography, an eavesdropper on the quantum channel can not copy perfectly the sent quantum states, however in many cases the cloning machine is known to be the most powerful eavesdropping strategy against quantum cryptographic protocols. The geometric interpretation of quantum states investigates distances between two different quantum states. In our method we use quantum relative entropy as an informational distance between quantum states. We show a geometrical approach to analyze the security of quantum cryptography, based on quantum relative entropy and Delaunay triangulation on the Bloch sphere. In our security analysis, we use an approximation algorithm from classical computational geometry to determine the smallest enclosing ball of balls using core-sets.

Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns•Nov 1, 2009•0 citations

Quantum Computing in Cryptographic Systems

Robin Cyriac, Sivaraman Eswaran, Shitharth Selvarajan

Quantum computing represents a transformative advancement in computational power, with profound implications for cryptographic systems. This paper explores the intersection of quantum computing and cryptography, examining the potential for quantum computers to both break traditional cryptographic algorithms and enable new forms of secure communication. Classical cryptographic systems, such as RSA and ECC, rely on the computational difficulty of problems like integer factorization and discrete logarithms. However, quantum algorithms, notably Shor's algorithm, can solve these problems exponentially faster than the best-known classical algorithms, posing a significant threat to the security of current cryptographic practices. This vulnerability necessitates the development and implementation of quantum-resistant algorithms to ensure data security in a post-quantum world. The paper reviews the state-of-the-art in quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. These algorithms are analyzed for their security properties, efficiency, and practicality for real-world deployment. Additionally, the paper discusses the ongoing standardization efforts led by organizations such as NIST, which are crucial for establishing widely accepted quantum-safe cryptographic protocols. Beyond the threat posed by quantum computing, this paper also highlights the potential benefits quantum computing can bring to cryptographic systems. Quantum Key Distribution (QKD) is one such advancement, offering theoretically unbreakable encryption by leveraging the principles of quantum mechanics. QKD enables secure communication channels that are immune to any computational advances, including those of quantum computers, by ensuring that any attempt at eavesdropping can be detected. The practical implementation challenges of QKD and other quantum cryptographic protocols are also addressed, including issues related to transmission distance, error rates, and integration with existing communication infrastructures. Experimental results from recent QKD trials are presented, showcasing significant progress in extending the viability of quantum-secure communication over long distances. Furthermore, the paper delves into the hybrid approaches combining classical and quantum cryptographic techniques. These approaches aim to leverage the strengths of both paradigms to enhance security and performance. For instance, hybrid protocols might use classical encryption for bulk data transfer, supplemented by quantum techniques for key exchange, thereby ensuring robust security even against future quantum adversaries. In conclusion, while quantum computing poses substantial risks to existing cryptographic systems, it also offers novel opportunities for creating highly secure communication protocols. The transition to quantum-safe cryptography is imperative to protect sensitive information in the quantum era. This paper underscores the urgency of advancing quantum-resistant cryptographic research, promoting international collaboration for standardization, and exploring innovative applications of quantum technologies in cryptography. Continued research and development in these areas are essential to stay ahead of the evolving threat landscape and harness the full potential of quantum computing for secure communications.

•Jan 1, 2024•8 citations

Computational geometric analysis of physically allowed quantum cloning transformations for quantum cryptography

László Gyöngyösi, Sándor Imre

Abstract:- The safety of quantum cryptography relies on the no-cloning theorem. In secret quantum communications, an eavesdropper cannot clone the sent qubits perfectly, however the best eavesdropping attacks for quantum cryptography are based on imperfect cloning machines. The eavesdropper’s physically allowed quantum evolutions on the sent qubit can be described in terms of the quantum state’s geometry. We use a fundamentally new computational geometrical method to analyze the informational theoretical impacts of cloning activity on the quantum channel. Our method uses Delaunay tessellation and convex hull calculation, with respect to quantum relative entropy as distance measure. The security analysis is focused on the four state (BB84) and Six state quantum cryptography protocols. The proposed geometrical method can be used to analyze efficiently the informational theoretical impacts of physically allowed quantum cloning transformations.

International Conference on Computer Engineering and Applications•Jan 27, 2010•9 citations

Quantum Information Encryption: A Geometric Optimization Approach

Jincheng Zhang

Quantum information cryptography stands as a critical field, demanding robust and adaptable security measures against evolving computational threats. Traditional cryptographic methods often rely on complex mathematical algorithms, presenting vulnerabilities to sophisticated attacks. This paper proposes a novel approach leveraging geometric optimization to design a quantum information encryption scheme, aiming for enhanced security and efficiency. The core mechanism centers on employing geometric optimization algorithms to create a layered encryption system that offers improved key distribution and communication capabilities. The research explores the potential of this approach to address current limitations in quantum cryptography and paves the way for a more secure and adaptable cryptographic paradigm. We present a preliminary analysis demonstrating the efficacy of this method through simulated scenarios and outline future research directions focusing on scalability and practical implementation.

•Sep 5, 2026•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

An Analysis of Security Threats in Quantum Computing Information Processing

Radhakrishnan Kanthavel, A. Anju, R. Adline Freeda +4 more

Quantum computing, which uses quantum physics’ superposition and entanglement, has the potential to revolutionize a number of disciplines, including material science, cryptography, and optimization. But the emergence of quantum computing also brings serious security risks, putting cryptography measures to the test and opening up new vulnerabilities. This work offers a thorough examination of these security risks in information processing using quantum computing. We investigate quantum-specific attacks that take advantage of quantum systems’ unique properties, going beyond cryptographic flaws. Quantum side-channel attacks on quantum hardware and quantum spying attempts on quantum key distribution (QKD) protocols highlight the practical issues in protecting quantum communication networks. Long-term dangers to data privacy and integrity also arise from the possibility of data gathering for future decryption, in which attackers gather and store encrypted data now in anticipation of being able to decrypt it later with more potent quantum computers. We first investigate the threats that quantum algorithms bring to the security of the cryptographic protocols in use today. Shor’s method jeopardizes the security of popular public-key cryptosystems such as RSA, ECC, and Diffie-Hellman because it can solve discrete logarithms and factor large integers quickly. Grover’s approach, similarly, weakens the security of symmetric-key cryptography systems by essentially halving their key strength while providing a quadratic speedup for brute-force searches. In order to mitigate these risks, we address the creation and application of post-quantum cryptography algorithms that are resistant to quantum assaults. For quantum communication networks, better QKD methods and infrastructure that is resistant to quantum emulation are crucial security considerations. Proactively developing responses and staying ahead of emerging dangers require constant research and observation. In summary, while quantum computing holds immense potential, it also introduces new security challenges that require resolution to protect information processing systems. This analysis emphasizes how critical it is to switch to cryptography techniques that are resistant to quantum computing and to put in place comprehensive security measures in order to protect against the constantly changing danger landscape that this technology poses. This chapter provides a concise overview of the key concepts that a comprehensive study would encompass.

Auerbach Publications eBooks•Mar 3, 2025•0 citations
Abstract Computational Geometry is the art of designing efficientalgorithms for answering geometric questions. Computa-tional Geometry involves efficient and elegant solutionsfor difficult algorithmic problems and plays a central rolein many different areas of computer science. Quantumcloning-based attacks have deep relevance to quantumcryptography. In this paper we use the results of clas-sical Computational Geometry to analyze the security ofa quantum channel using current classical computer ar-chitectures. To analyze a quantum channel for a largenumber of input quantum states with classical computerarchitectures, very fast and effective algorithms are re-quired.Keywords: Quantum communication, quantum cryptogra-phy, quantum informational distance 1 Introduction In today’s communication networks, the widespread useof optical fiber and passive optical elements allows to usequantum cryptography in the current standard opticalnetwork infrastructure. In the past few years, quantumkey distribution schemes have attracted much study. Thesecurity of modern cryptographic methods, like asymmet-ric cryptography, relies heavily on the problem of factor-ing large integers [7]. In the future, if quantum computersbecome reality, any information exchange using currentclassical cryptographic schemes will be immediately inse-cure [11, 13]. Current classical cryptographic methods arenot able to guarantee long-term security. Other crypto-graphic methods, with absolute security must be appliedin the future. Cryptography based on the principles ofquantum theory is known as quantum cryptography. Us-ing current network technology, in order to spread quan-tum cryptography, interfaces must be implemented thatare able to manage together the quantum and classicalchannels [10].Many challenging hard algorithmic problems can bestudied with computational geometry and, at present,there exist many geometric algorithms that offer an effi-cient and well implementable solution for hard computa-tional problems. Computational Geometry was originallyfocused on the construction of efficient algorithms and itprovides a very valuable and efficient tool for computinghard tasks [8]. In many cases, the traditional linear pro-gramming methods are not very efficient. The computa-tion of the convex hull between quantum states cannot becomputed efficiently by linear programming, however themethods of computational geometry are better at solvingthese kinds of hard problems [18, 3, 8]. ComputationalGeometry uses the results of classical geometry and thepower of computing. In Figure 1, we illustrate the logicalstructure of the analysis and the cooperation of classi-cal and quantum systems. To this day, the most efficientclassical algorithms for this purpose are computationalgeometric methods. We use these classical computationalgeometrictoolsto analyzethe securityofa quantum chan-nel.
The problem of quantum cloning is closely connected to quantum cryptography. In quantum cryptography, an eavesdropper on the quantum channel can not copy perfectly the sent quantum states, however in many cases the cloning machine is known to be the most powerful eavesdropping strategy against quantum cryptographic protocols. The geometric interpretation of quantum states investigates distances between two different quantum states. In our method we use quantum relative entropy as an informational distance between quantum states. We show a geometrical approach to analyze the security of quantum cryptography, based on quantum relative entropy and Delaunay triangulation on the Bloch sphere. In our security analysis, we use an approximation algorithm from classical computational geometry to determine the smallest enclosing ball of balls using core-sets.
Quantum computing represents a transformative advancement in computational power, with profound implications for cryptographic systems. This paper explores the intersection of quantum computing and cryptography, examining the potential for quantum computers to both break traditional cryptographic algorithms and enable new forms of secure communication. Classical cryptographic systems, such as RSA and ECC, rely on the computational difficulty of problems like integer factorization and discrete logarithms. However, quantum algorithms, notably Shor's algorithm, can solve these problems exponentially faster than the best-known classical algorithms, posing a significant threat to the security of current cryptographic practices. This vulnerability necessitates the development and implementation of quantum-resistant algorithms to ensure data security in a post-quantum world. The paper reviews the state-of-the-art in quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. These algorithms are analyzed for their security properties, efficiency, and practicality for real-world deployment. Additionally, the paper discusses the ongoing standardization efforts led by organizations such as NIST, which are crucial for establishing widely accepted quantum-safe cryptographic protocols. Beyond the threat posed by quantum computing, this paper also highlights the potential benefits quantum computing can bring to cryptographic systems. Quantum Key Distribution (QKD) is one such advancement, offering theoretically unbreakable encryption by leveraging the principles of quantum mechanics. QKD enables secure communication channels that are immune to any computational advances, including those of quantum computers, by ensuring that any attempt at eavesdropping can be detected. The practical implementation challenges of QKD and other quantum cryptographic protocols are also addressed, including issues related to transmission distance, error rates, and integration with existing communication infrastructures. Experimental results from recent QKD trials are presented, showcasing significant progress in extending the viability of quantum-secure communication over long distances. Furthermore, the paper delves into the hybrid approaches combining classical and quantum cryptographic techniques. These approaches aim to leverage the strengths of both paradigms to enhance security and performance. For instance, hybrid protocols might use classical encryption for bulk data transfer, supplemented by quantum techniques for key exchange, thereby ensuring robust security even against future quantum adversaries. In conclusion, while quantum computing poses substantial risks to existing cryptographic systems, it also offers novel opportunities for creating highly secure communication protocols. The transition to quantum-safe cryptography is imperative to protect sensitive information in the quantum era. This paper underscores the urgency of advancing quantum-resistant cryptographic research, promoting international collaboration for standardization, and exploring innovative applications of quantum technologies in cryptography. Continued research and development in these areas are essential to stay ahead of the evolving threat landscape and harness the full potential of quantum computing for secure communications.
Abstract:- The safety of quantum cryptography relies on the no-cloning theorem. In secret quantum communications, an eavesdropper cannot clone the sent qubits perfectly, however the best eavesdropping attacks for quantum cryptography are based on imperfect cloning machines. The eavesdropper’s physically allowed quantum evolutions on the sent qubit can be described in terms of the quantum state’s geometry. We use a fundamentally new computational geometrical method to analyze the informational theoretical impacts of cloning activity on the quantum channel. Our method uses Delaunay tessellation and convex hull calculation, with respect to quantum relative entropy as distance measure. The security analysis is focused on the four state (BB84) and Six state quantum cryptography protocols. The proposed geometrical method can be used to analyze efficiently the informational theoretical impacts of physically allowed quantum cloning transformations.
Quantum information cryptography stands as a critical field, demanding robust and adaptable security measures against evolving computational threats. Traditional cryptographic methods often rely on complex mathematical algorithms, presenting vulnerabilities to sophisticated attacks. This paper proposes a novel approach leveraging geometric optimization to design a quantum information encryption scheme, aiming for enhanced security and efficiency. The core mechanism centers on employing geometric optimization algorithms to create a layered encryption system that offers improved key distribution and communication capabilities. The research explores the potential of this approach to address current limitations in quantum cryptography and paves the way for a more secure and adaptable cryptographic paradigm. We present a preliminary analysis demonstrating the efficacy of this method through simulated scenarios and outline future research directions focusing on scalability and practical implementation.
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.
Quantum computing, which uses quantum physics’ superposition and entanglement, has the potential to revolutionize a number of disciplines, including material science, cryptography, and optimization. But the emergence of quantum computing also brings serious security risks, putting cryptography measures to the test and opening up new vulnerabilities. This work offers a thorough examination of these security risks in information processing using quantum computing. We investigate quantum-specific attacks that take advantage of quantum systems’ unique properties, going beyond cryptographic flaws. Quantum side-channel attacks on quantum hardware and quantum spying attempts on quantum key distribution (QKD) protocols highlight the practical issues in protecting quantum communication networks. Long-term dangers to data privacy and integrity also arise from the possibility of data gathering for future decryption, in which attackers gather and store encrypted data now in anticipation of being able to decrypt it later with more potent quantum computers. We first investigate the threats that quantum algorithms bring to the security of the cryptographic protocols in use today. Shor’s method jeopardizes the security of popular public-key cryptosystems such as RSA, ECC, and Diffie-Hellman because it can solve discrete logarithms and factor large integers quickly. Grover’s approach, similarly, weakens the security of symmetric-key cryptography systems by essentially halving their key strength while providing a quadratic speedup for brute-force searches. In order to mitigate these risks, we address the creation and application of post-quantum cryptography algorithms that are resistant to quantum assaults. For quantum communication networks, better QKD methods and infrastructure that is resistant to quantum emulation are crucial security considerations. Proactively developing responses and staying ahead of emerging dangers require constant research and observation. In summary, while quantum computing holds immense potential, it also introduces new security challenges that require resolution to protect information processing systems. This analysis emphasizes how critical it is to switch to cryptography techniques that are resistant to quantum computing and to put in place comprehensive security measures in order to protect against the constantly changing danger landscape that this technology poses. This chapter provides a concise overview of the key concepts that a comprehensive study would encompass.