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

2022 8th International Conference on Signal Processing and Communication (ICSC)

An Efficient Polynomial based Quantum Key Distribution Approach for Secure Communication

Neha Sharma, Vikas Saxena

Published Dec 1, 2022• 3 citations
Publisher

Abstract

Cryptography is the process of converting information from readable to unreadable form in the world of computer security. However, there are still flaws at the cryptographic, channel, or implementation levels that need the creation or adoption of new and more robust security measures. The purpose of this study is to offer an efficient method for secure communication based on polynomial interpolation. Quantum cryptography ensures secure communication between authentic users by utilising the basic laws of quantum physics. One of the applications of quantum cryptography is quantum key distribution technology. The key used in the present protocol for secure communication is distinguished from the key created using the polynomial for the Quantum key distribution protocol. These two scenarios are performed on the QISKIT simulator, and their outcomes are assessed in a probabilistic manner. Furthermore, the presence and absence of eavesdropping in the channel are analysed. An environmental error, such as increased noise, may affect experiment performance.

DOI
10.1109/icsc56524.2022.10009470

Related papers

The Quantum Cryptography Approach: Unleashing the Potential of Quantum Key Reconciliation Protocol for Secure Communication

Neha Sharma, Vikas Saxena

Quantum cryptography is the study of delivering secret communications across a quantum channel. Recently, Quantum Key Distribution (QKD) has been recognized as the most important breakthrough in quantum cryptography. This process facilitates two distant parties to share secure communications based on physical laws. The BB84 protocol was developed in 1984 and remains the most widely used among BB92, Ekert91, COW, and SARG04 protocols. However the practical security of QKD with imperfect devices have been widely discussed, and there are many ways to guarantee that generated key by QKD still provides unconditional security. This paper proposed a novel method that allows users to communicate while generating the secure keys as well as securing the transmission without any leakage of the data. In this approach sender will never reveal her basis, hence neither the receiver nor the intruder will get knowledge of the fundamental basis.Further to detect Eve, polynomial interpolation is also used as a key verification technique. In order to fully utilize the quantum computing capabilities provided by IBM quantum computers, the protocol is executed using the Qiskit backend for 45 qubits. This article discusses a plot of % error against alpha (strength of eavesdropping). As a result, different types of noise have been included, and the success probability of the desired key bits has been determined. Furthermore, the success probability under depolarizing noise is explained for different qubit counts.Last but not least, even when the applied noise is increased to maximum capacity, a 50% probability of successful key generation is still observed in an experiment.

arXiv:2401.08987•Jan 17, 2024•1 citation

Key reconciliation protocol for quantum key distribution

Neha Vaishnavi Sharma, Vikas Saxena, Vinay Chamola +1 more

Abstract In quantum cryptography, secret communications are delivered through a quantum channel. One of the most important breakthroughs in quantum cryptography has been the quantum key distribution (QKD). This process enables two distant parties to share secure communications based on physical laws. However, eavesdroppers can still interrupt the communication. To overcome this, we propose a different way to detect the presence of Eve through the polynomial interpolation technique. This technique also allows us for key verification. This approach prevents the receiver as well as the intruder from discovering the sender’s fundamental basis. To fully utilize IBM quantum computers’ quantum computing capabilities, this paper attempts to show % error against alpha (strength of eavesdropping) and the impact of noise on the success probability of the desired key bits. Furthermore, the success probability under depolarizing noise is explained for different qubit counts. In the enhanced QKD protocol, using polynomial interpolation for reconciliation shows a 50% probability of successful key generation. This is even when the noise is increased to the maximum capacity.

EPJ Quantum Technology•Feb 10, 2025•6 citations

Secure Quantum Communication: Simulation and Analysis of Quantum Key Distribution Protocols

Mahendra Rasay, Emmanuel D. Sebastian, Subhash Prasad Sah +2 more

Quantum computing poses significant threats to conventional cryptographic techniques such as RSA and AES, motivating the need for quantum secure communication methods. Quantum Key Distribution (QKD) offers information theoretic security based on fundamental quantum principles. This paper presents a simulation-based analysis of well-known QKD protocols, namely BB84, B92, and E91, using the IBM Qiskit framework. Realistic quantum channel effects, including noise, decoherence, and eavesdropping, are modeled to evaluate protocol performance. Key metrics such as error rate, secret key generation, and security characteristics are analyzed and compared. The study highlights practical challenges in QKD implementation, including hardware limitations and channel losses, and discusses insights toward scalable and robust quantum communication systems. The results support the feasibility of QKD as a promising solution for secure communication in the quantum era.

quant-pharXiv:2603.16690•International Scientific Journal of Engineering and Management•Mar 18, 2026•2 citations

Efficient Key Verification for Quantum Communication Using Polynomial Interpolation

Ching‐Nung Yang, Chih-Yueh Tseng, Po-Cheng Yu +1 more

Quantum communication uses photons to transmit quantum bits (qubits) over long distances. By using this quantum technology, quantum key distribution (QKD), a secure communication protocol, ensures the security of encryption key exchange. Due to noise and eavesdropping in the quantum channel, errors can occur in the shared qubits after QKD key agreement phase. Therefore, we need a key verification phase to deal with inconsistent qubits (i.e. the wrong qubits at the receiving end). This key verification is also called information reconciliation. Recently, some reconciliation algorithms in QKD (RQKD) using polynomial consistency have been proposed. These RQKDs use the consistency property to find the correct polynomial (converted from the qubits) and then check the correctness of other qubits based on this polynomial to achieve reconciliation. All previous consistency-based RQKDs required such an extra step to check the correctness of other qubits after finding the correct polynomial. In this paper, we propose Enhanced RQKD (ERQKD), which uses consistency in a new way to improve key verification efficiency without requiring additional checking steps. Theoretical analysis and experiments indeed show that our ERQKD outperforms the two previous RQKDs.

International Conference on Communication Engineering and Technology (ICCET)•May 16, 2025•0 citations

Quantum Cryptography Simulation

R. Goutam, Shwetha S, T R Loukya +2 more

By utilizing concepts from quantum physics like entanglement and superposition, quantum cryptography is revolutionizing data security. This study focuses on the application of classical computational models for simulation-based analysis of Quantum Key Distribution (QKD) protocols, namely BB84 and E91. By taking use of quantum features, QKD makes secure key exchange possible and guarantees that any effort at eavesdropping may be identified because of the disruption of quantum states. In order to assess how quantum communication channels behave under different noise and attack scenarios, the study models and simulates these channels. The study evaluates the efficacy and robustness of BB84 and E91 protocols in practical network settings by contrasting their performance and error tolerance. In order to determine if integrating quantum-secured systems with current classical infrastructures is feasible, scalability issues are also investigated. These simulations’ outcomes shed light on feasible security levels, resource needs, and workable deployment tactics. In the end, this research highlights how quantum cryptography may advance the basis for next-generation secure information networks by bridging the gap between theoretical quantum security models and real-world communication systems with the use of strong simulation frameworks.

International Conference on Advancement in Futuristic Technologies (ICAFT)•Dec 19, 2025•0 citations

Quantum Cryptography and Key Distribution for Secure Communication in the Post Quantum World

Sai Srinivas Vellela, Pothuguntla Anusha, Nagagopi Raju Vullam +3 more

Quantum computing is posing a serious risk to classical cryptographic tools such as RSA and ECC as sophisticated quantum algorithms are able to crack their mathematical foundation in a time bound that is a a polynomial in the number of repetitions. In this paper, we will describe the process of integrating Post-Quantum Cryptography (PQC) and Quantum Key Distribution (QKD) into a hybrid approach to secure communications in the post-quantum world. The suggested methodology is a combination of the computational efficiency and scalability of PQC and the information-theoretic security and eavesdropping detection abilities of QKD. Simulation observations indicate that PQC-only systems are both faster in generating keys and scalable, but do not have a strong eavesdropping detection. On the other hand, non-conditional security is only a feature of systems based on QKD, but it is also highly overhead and slows down key rate. The hybrid PQC-Q KD model provides a balanced performance, high resilience, high authentication, high confidentiality, and realistic deployability. On balance, this discussion demonstrates that the hybrid approach is better than standalone methods and can provide a strong solution to protect against new quantum threats. The large-scale network protocol can be optimized, resources and further integration with other emerging technologies, such as 5G/6G, IoT or cloud computing, can be directed in future research.

International Conference on Sustainable Communication Networks and Application (ICSCNA)•Oct 15, 2025•2 citations
Cryptography is the process of converting information from readable to unreadable form in the world of computer security. However, there are still flaws at the cryptographic, channel, or implementation levels that need the creation or adoption of new and more robust security measures. The purpose of this study is to offer an efficient method for secure communication based on polynomial interpolation. Quantum cryptography ensures secure communication between authentic users by utilising the basic laws of quantum physics. One of the applications of quantum cryptography is quantum key distribution technology. The key used in the present protocol for secure communication is distinguished from the key created using the polynomial for the Quantum key distribution protocol. These two scenarios are performed on the QISKIT simulator, and their outcomes are assessed in a probabilistic manner. Furthermore, the presence and absence of eavesdropping in the channel are analysed. An environmental error, such as increased noise, may affect experiment performance.
Quantum cryptography is the study of delivering secret communications across a quantum channel. Recently, Quantum Key Distribution (QKD) has been recognized as the most important breakthrough in quantum cryptography. This process facilitates two distant parties to share secure communications based on physical laws. The BB84 protocol was developed in 1984 and remains the most widely used among BB92, Ekert91, COW, and SARG04 protocols. However the practical security of QKD with imperfect devices have been widely discussed, and there are many ways to guarantee that generated key by QKD still provides unconditional security. This paper proposed a novel method that allows users to communicate while generating the secure keys as well as securing the transmission without any leakage of the data. In this approach sender will never reveal her basis, hence neither the receiver nor the intruder will get knowledge of the fundamental basis.Further to detect Eve, polynomial interpolation is also used as a key verification technique. In order to fully utilize the quantum computing capabilities provided by IBM quantum computers, the protocol is executed using the Qiskit backend for 45 qubits. This article discusses a plot of % error against alpha (strength of eavesdropping). As a result, different types of noise have been included, and the success probability of the desired key bits has been determined. Furthermore, the success probability under depolarizing noise is explained for different qubit counts.Last but not least, even when the applied noise is increased to maximum capacity, a 50% probability of successful key generation is still observed in an experiment.
Abstract In quantum cryptography, secret communications are delivered through a quantum channel. One of the most important breakthroughs in quantum cryptography has been the quantum key distribution (QKD). This process enables two distant parties to share secure communications based on physical laws. However, eavesdroppers can still interrupt the communication. To overcome this, we propose a different way to detect the presence of Eve through the polynomial interpolation technique. This technique also allows us for key verification. This approach prevents the receiver as well as the intruder from discovering the sender’s fundamental basis. To fully utilize IBM quantum computers’ quantum computing capabilities, this paper attempts to show % error against alpha (strength of eavesdropping) and the impact of noise on the success probability of the desired key bits. Furthermore, the success probability under depolarizing noise is explained for different qubit counts. In the enhanced QKD protocol, using polynomial interpolation for reconciliation shows a 50% probability of successful key generation. This is even when the noise is increased to the maximum capacity.
Quantum computing poses significant threats to conventional cryptographic techniques such as RSA and AES, motivating the need for quantum secure communication methods. Quantum Key Distribution (QKD) offers information theoretic security based on fundamental quantum principles. This paper presents a simulation-based analysis of well-known QKD protocols, namely BB84, B92, and E91, using the IBM Qiskit framework. Realistic quantum channel effects, including noise, decoherence, and eavesdropping, are modeled to evaluate protocol performance. Key metrics such as error rate, secret key generation, and security characteristics are analyzed and compared. The study highlights practical challenges in QKD implementation, including hardware limitations and channel losses, and discusses insights toward scalable and robust quantum communication systems. The results support the feasibility of QKD as a promising solution for secure communication in the quantum era.
Quantum communication uses photons to transmit quantum bits (qubits) over long distances. By using this quantum technology, quantum key distribution (QKD), a secure communication protocol, ensures the security of encryption key exchange. Due to noise and eavesdropping in the quantum channel, errors can occur in the shared qubits after QKD key agreement phase. Therefore, we need a key verification phase to deal with inconsistent qubits (i.e. the wrong qubits at the receiving end). This key verification is also called information reconciliation. Recently, some reconciliation algorithms in QKD (RQKD) using polynomial consistency have been proposed. These RQKDs use the consistency property to find the correct polynomial (converted from the qubits) and then check the correctness of other qubits based on this polynomial to achieve reconciliation. All previous consistency-based RQKDs required such an extra step to check the correctness of other qubits after finding the correct polynomial. In this paper, we propose Enhanced RQKD (ERQKD), which uses consistency in a new way to improve key verification efficiency without requiring additional checking steps. Theoretical analysis and experiments indeed show that our ERQKD outperforms the two previous RQKDs.
By utilizing concepts from quantum physics like entanglement and superposition, quantum cryptography is revolutionizing data security. This study focuses on the application of classical computational models for simulation-based analysis of Quantum Key Distribution (QKD) protocols, namely BB84 and E91. By taking use of quantum features, QKD makes secure key exchange possible and guarantees that any effort at eavesdropping may be identified because of the disruption of quantum states. In order to assess how quantum communication channels behave under different noise and attack scenarios, the study models and simulates these channels. The study evaluates the efficacy and robustness of BB84 and E91 protocols in practical network settings by contrasting their performance and error tolerance. In order to determine if integrating quantum-secured systems with current classical infrastructures is feasible, scalability issues are also investigated. These simulations’ outcomes shed light on feasible security levels, resource needs, and workable deployment tactics. In the end, this research highlights how quantum cryptography may advance the basis for next-generation secure information networks by bridging the gap between theoretical quantum security models and real-world communication systems with the use of strong simulation frameworks.
Quantum computing is posing a serious risk to classical cryptographic tools such as RSA and ECC as sophisticated quantum algorithms are able to crack their mathematical foundation in a time bound that is a a polynomial in the number of repetitions. In this paper, we will describe the process of integrating Post-Quantum Cryptography (PQC) and Quantum Key Distribution (QKD) into a hybrid approach to secure communications in the post-quantum world. The suggested methodology is a combination of the computational efficiency and scalability of PQC and the information-theoretic security and eavesdropping detection abilities of QKD. Simulation observations indicate that PQC-only systems are both faster in generating keys and scalable, but do not have a strong eavesdropping detection. On the other hand, non-conditional security is only a feature of systems based on QKD, but it is also highly overhead and slows down key rate. The hybrid PQC-Q KD model provides a balanced performance, high resilience, high authentication, high confidentiality, and realistic deployability. On balance, this discussion demonstrates that the hybrid approach is better than standalone methods and can provide a strong solution to protect against new quantum threats. The large-scale network protocol can be optimized, resources and further integration with other emerging technologies, such as 5G/6G, IoT or cloud computing, can be directed in future research.