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 Conference on Modern Sustainable Systems (CMSS)

Quantum-Secure Edge Computing for Internet of Things : A Cryptgraphic Framework

K.Kavitha Devi, Debojeet Kohar, S. Jeeva Mithran, Apurva Kaushik, Dishant Kaushik, Joson Raja

Published Aug 12, 2025• 1 citation
Publisher

Abstract

For a long time, we have used cryptographic methods such as RSA and ECC to protect the information. They rely on hard mathematical problems that are too difficult for normal computers to address alone. Now, because quantum computers are starting to be used, we may need a new kind of security. Quantum computers have the ability to run algorithms like Shor’s algorithm which are much faster at cracking RSA and ECC compared to ordinary computers. If this happens, the security we have used for so long might not function properly anymore. Because of these issues, a novel form of security, called quantum cryptography, has been introduced. Instead of using equations from math, it operates by the odd laws of quantum physics. The rules of quantum physics, like the uncertainty principle and the no-cloning rule, allow sharing secret keys so that any outsider can be detected at once. It relies on Quantum Key Distribution (QKD) and the BB84 and E91 methods are used for this. Even so, quantum cryptography is not fully flawless. You need special computers, it costs a lot to set up and it isn’t available everywhere yet. For this reason, people are also creating post-quantum cryptography which defends against quantum threats using regular computers instead of quantum hardware. In this system, will see how different traditional and quantum cryptography are, where each one excels and what innovations are likely to protect our data in the future, especially as quantum computers get more capable.

DOI
10.1109/cmss66566.2025.11182470

Related papers

Quantum Encryption – Securing the Future

SOLUTION ARCHITECT, DXC Technology, Wing A, 25th floor, Sattva Knowledge Park, Plot No # 16, Sy Number: 83/1, Hi-Tec City, Panmaktha village, Serilingampally Mandal, Raidurg, Hyderabad, Telangana 500081, India, Vijaya Saradhi Nanduri

Abstract— Quantum encryption represents a significant advancement over traditional encryption methods such as RSA and ECC. Unlike conventional algorithms, which can be compromised by quantum computing techniques like Shor’s and Grover’s algorithms, quantum encryption offers a fundamentally stronger security model. At the heart of this technology lies Quantum Key Distribution (QKD), which leverages the laws of physics to ensure secure communication and enables early detection of any eavesdropping attempts. This document outlines the core principles of QKD, including superposition, entanglement, and the no-cloning theorem, along with widely adopted protocols such as BB84, E91, and CV-QKD. It also discusses implementation architectures, including fiber-based and satellite-based QKD systems. To strengthen security further, hybrid models that combine QKD with Post-Quantum Cryptography (PQC) are emerging, offering layered protection for critical sectors. The document also addresses practical challenges such as hardware vulnerabilities, side-channel attacks, and scalability issues, along with recommended mitigation strategies. Global standards from organizations like ETSI and ITU are covering the way for interoperability and secure deployments worldwide. Operating systems such as Microsoft Windows, Red Hat Linux, and cryptographic libraries like OpenSSL are now incorporating quantum-safe cryptography, demonstrating readiness for real-world applications. For researchers, enterprises, and policymakers, this evolution opens exciting opportunities in innovation, migration planning, and future-proof security strategies. Quantum encryption is not just a technological leap, it is a necessity for safeguarding our digital future. [1] [2] [3] [7] [10][11][12]13][14] [21]. Keywords—Quantum cryptography, QKD, BB84, E91, CV‑QKD, multi‑core fiber, PQC, ML‑KEM, ML‑DSA, ITU‑T Y.3800, ETSI GS QKD 014.

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT•Jan 8, 2026•0 citations

Cryptographic Protocols Resilient to Quantum Attacks: Advancements in Post-Quantum Cryptography

Pallavi Niraj Vithalkar

New developments in quantum computing have made people worry that current security methods could be broken by quantum attacks. Some mathematical problems are hard to solve, which is how traditional encryption methods like RSA and ECC keep their secrets safe. However, quantum computers might be able to solve these issues a lot faster than regular computers, which makes these methods less safe. Because of this threat, experts have been working hard to make post-quantum cryptography methods that quantum computers can't break. These methods are made to stand up to the strength of quantum algorithms and protect the privacy, integrity, and validity of private data even when quantum attackers are present. Lattice-based cryptography is a potential method for post-quantum encryption. Its security comes from the difficulty of certain lattice problems. Lattice-based methods are thought to be safe from threats from both traditional and quantum computers because they offer good security promises. Lattice-based cryptography is a flexible way to build different types of cryptographic primitives, like encryption, digital signatures, and key sharing protocols. The study of code-based cryptography, which is based on how hard it is to decode some error-correcting codes, is another important advance. Code-based methods have been around for a long time and have been studied a lot, which makes them a good choice for security after quantum computing. Code-based cryptography is also easy to use and has strong security features, which makes it a good choice for real-world situations. Multivariate polynomial cryptography is another possible choice for cryptography after quantum computing. The safety of this method depends on how hard it is to solve systems of multivariate polynomial problems. Multivariate polynomial methods might not be as secure as lattice-based or code-based cryptography, but they are interesting options for some situations and places with limited resources.

Communications on Applied Nonlinear Analysis•Jun 23, 2024•6 citations

QUANTUM COMPUTING FOR CRYPTOGRAPHY: EXPLORING THE FUTURE OF SECURE COMMUNICATIONS WITH QUANTUM ALGORITHMS

Arslan Nadeem, Aiman Shabbir

Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.

Journal of Engineering Education and Practice•Dec 31, 2023•0 citations

Quantum-Safe Cryptography

Kunal Meher

The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.

Chapman & Hall/CRC eBooks•Aug 9, 2023•3 citations

Quantum Computing Threats to Traditional Encryption Algorithms

Sai Kalyani Rachapalli -

Quantum computing is poised to revolutionize numerous fields, including cryptography. Traditional encryption algorithms that form the backbone of modern digital security, such as RSA and Elliptic Curve Cryptography (ECC), rely on computationally difficult problems—specifically, the factorization of large integers and the solving of discrete logarithms. However, quantum computers, leveraging the principles of quantum mechanics, present the potential to solve these problems in polynomial time through algorithms like Shor’s Algorithm, rendering these encryption methods insecure. The development of sufficiently powerful quantum computers could therefore undermine the confidentiality and integrity of sensitive digital information across the internet. This paper explores the threats posed by quantum computing to traditional cryptographic systems, with a focus on the impact of Shor’s Algorithm and Grover’s Algorithm. In addition, the paper reviews ongoing efforts to develop quantum-resistant cryptographic techniques, particularly in the area of post-quantum cryptography (PQC). It discusses the NIST Post-Quantum Cryptography Standardization project, the promising alternatives to current encryption schemes, and the potential for quantum key distribution (QKD) as a solution. The paper concludes with a reflection on the urgent need to prepare for quantum computing's eventual impact on digital security and the steps that can be taken to mitigate these risks in the transition to quantum-safe cryptography.

International Journal For Multidisciplinary Research•Mar 6, 2021•0 citations

Quantum Cryptography for Securing the Internet of Things: A Comprehensive Literature Survey

Gaurav Makkar, Suman Pant

The Internet of Things (IoT) now underpins critical systems like healthcare monitors, smart home, smart grids, automotive V2V & V2X networks, and industrial controls but it still relies on classical cryptography, whose security assumptions are vulnerable to quantum computers. A large quantum computer could run Shor’s algorithm to break RSA/ECC and use Grover’s algorithm to accelerate brute-forcing of symmetric keys, undermining the confidentiality and authentication of data in these IoT applications. Researchers have proposed quantum cryptographic solutions. Quantum key distribution (QKD) and quantum random number generators (QRNGs) exploit quantum mechanics to detect eavesdropping and deliver provably secure key material. For example, chip-scale QRNGs can be embedded in IoT sensors to generate true random keys, boosting resistance to brute-force attacks. These quantum techniques provide information-theoretic secrecy, for instance, QKD-generated keys have been used to authenticate smart-grid SCADA. However, most IoT devices are resource-constrained, making direct deployment of conventional QKD hardware challenging. Post-quantum cryptography (PQC) complements quantum methods by providing algorithms such as lattice-based, hash-based that resist quantum attacks on existing hardware. Standardized PQC can be deployed via software updates on legacy IoT nodes, enabling scalable and quantum-safe security within current constraints. Researchers are exploring lightweight PQC for connected cars and e-health sensors. Hybrid approaches combining QKD/QRNG with PQC offer a layered defense. Since QKD protocols are regarded as ‘future-proof’ and PQC standards mature, their combined use will be essential for robust, quantum-safe IoT security. Miniaturizing quantum components such as integrated QKD/QRNG modules and optimizing lightweight PQC schemes for low-power IoT devices are future research directions to secure IoT networks.

International Conference on Internet of Things: Smart Innovation and Usages (IoT-SIU)•Nov 27, 2025•0 citations
For a long time, we have used cryptographic methods such as RSA and ECC to protect the information. They rely on hard mathematical problems that are too difficult for normal computers to address alone. Now, because quantum computers are starting to be used, we may need a new kind of security. Quantum computers have the ability to run algorithms like Shor’s algorithm which are much faster at cracking RSA and ECC compared to ordinary computers. If this happens, the security we have used for so long might not function properly anymore. Because of these issues, a novel form of security, called quantum cryptography, has been introduced. Instead of using equations from math, it operates by the odd laws of quantum physics. The rules of quantum physics, like the uncertainty principle and the no-cloning rule, allow sharing secret keys so that any outsider can be detected at once. It relies on Quantum Key Distribution (QKD) and the BB84 and E91 methods are used for this. Even so, quantum cryptography is not fully flawless. You need special computers, it costs a lot to set up and it isn’t available everywhere yet. For this reason, people are also creating post-quantum cryptography which defends against quantum threats using regular computers instead of quantum hardware. In this system, will see how different traditional and quantum cryptography are, where each one excels and what innovations are likely to protect our data in the future, especially as quantum computers get more capable.
Abstract— Quantum encryption represents a significant advancement over traditional encryption methods such as RSA and ECC. Unlike conventional algorithms, which can be compromised by quantum computing techniques like Shor’s and Grover’s algorithms, quantum encryption offers a fundamentally stronger security model. At the heart of this technology lies Quantum Key Distribution (QKD), which leverages the laws of physics to ensure secure communication and enables early detection of any eavesdropping attempts. This document outlines the core principles of QKD, including superposition, entanglement, and the no-cloning theorem, along with widely adopted protocols such as BB84, E91, and CV-QKD. It also discusses implementation architectures, including fiber-based and satellite-based QKD systems. To strengthen security further, hybrid models that combine QKD with Post-Quantum Cryptography (PQC) are emerging, offering layered protection for critical sectors. The document also addresses practical challenges such as hardware vulnerabilities, side-channel attacks, and scalability issues, along with recommended mitigation strategies. Global standards from organizations like ETSI and ITU are covering the way for interoperability and secure deployments worldwide. Operating systems such as Microsoft Windows, Red Hat Linux, and cryptographic libraries like OpenSSL are now incorporating quantum-safe cryptography, demonstrating readiness for real-world applications. For researchers, enterprises, and policymakers, this evolution opens exciting opportunities in innovation, migration planning, and future-proof security strategies. Quantum encryption is not just a technological leap, it is a necessity for safeguarding our digital future. [1] [2] [3] [7] [10][11][12]13][14] [21]. Keywords—Quantum cryptography, QKD, BB84, E91, CV‑QKD, multi‑core fiber, PQC, ML‑KEM, ML‑DSA, ITU‑T Y.3800, ETSI GS QKD 014.
New developments in quantum computing have made people worry that current security methods could be broken by quantum attacks. Some mathematical problems are hard to solve, which is how traditional encryption methods like RSA and ECC keep their secrets safe. However, quantum computers might be able to solve these issues a lot faster than regular computers, which makes these methods less safe. Because of this threat, experts have been working hard to make post-quantum cryptography methods that quantum computers can't break. These methods are made to stand up to the strength of quantum algorithms and protect the privacy, integrity, and validity of private data even when quantum attackers are present. Lattice-based cryptography is a potential method for post-quantum encryption. Its security comes from the difficulty of certain lattice problems. Lattice-based methods are thought to be safe from threats from both traditional and quantum computers because they offer good security promises. Lattice-based cryptography is a flexible way to build different types of cryptographic primitives, like encryption, digital signatures, and key sharing protocols. The study of code-based cryptography, which is based on how hard it is to decode some error-correcting codes, is another important advance. Code-based methods have been around for a long time and have been studied a lot, which makes them a good choice for security after quantum computing. Code-based cryptography is also easy to use and has strong security features, which makes it a good choice for real-world situations. Multivariate polynomial cryptography is another possible choice for cryptography after quantum computing. The safety of this method depends on how hard it is to solve systems of multivariate polynomial problems. Multivariate polynomial methods might not be as secure as lattice-based or code-based cryptography, but they are interesting options for some situations and places with limited resources.
Quantum computing holds an enormous power to transform cryptography because it protects secured communication. RSA together with elliptic curve cryptography functions based on mathematical challenges like integer factorization and discrete logarithms until quantum computers present security risks to these traditional systems. Such problems become solvable with efficiency through Shor's algorithm running on quantum computers which threatens the security of multiple widely used cryptographic protocols. The document examines quantum computing effects on cryptography to explain why quantum algorithms break classic cryptographic system security. Post-quantum cryptography (PQC) acts as a protective solution against quantum-based attacks through its mission to create cryptographic techniques which demonstrate quantum attack resilience. This paper examines quantum-age security design protocols for cryptographic keys using both quantum key distribution and lattice-based cryptography and hash-based cryptography and multivariate polynomial cryptography. The research analyzes the effectiveness and protective capability of new PQC solutions by connecting theoretical concepts with practical applications. The study points out advancements in quantum cryptography as well as the quantum hardware obstacles and the global initiative to establish post-quantum algorithms standards. The authors stress the urgent need for up-to-date quantum-resistant measures because of swift quantum technology progress. The protection of sensitive materials and communications networks from destructive quantum computing threats requires immediate focus because this need drives the necessity of properly preparing for post-quantum cryptography.
The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.
Quantum computing is poised to revolutionize numerous fields, including cryptography. Traditional encryption algorithms that form the backbone of modern digital security, such as RSA and Elliptic Curve Cryptography (ECC), rely on computationally difficult problems—specifically, the factorization of large integers and the solving of discrete logarithms. However, quantum computers, leveraging the principles of quantum mechanics, present the potential to solve these problems in polynomial time through algorithms like Shor’s Algorithm, rendering these encryption methods insecure. The development of sufficiently powerful quantum computers could therefore undermine the confidentiality and integrity of sensitive digital information across the internet. This paper explores the threats posed by quantum computing to traditional cryptographic systems, with a focus on the impact of Shor’s Algorithm and Grover’s Algorithm. In addition, the paper reviews ongoing efforts to develop quantum-resistant cryptographic techniques, particularly in the area of post-quantum cryptography (PQC). It discusses the NIST Post-Quantum Cryptography Standardization project, the promising alternatives to current encryption schemes, and the potential for quantum key distribution (QKD) as a solution. The paper concludes with a reflection on the urgent need to prepare for quantum computing's eventual impact on digital security and the steps that can be taken to mitigate these risks in the transition to quantum-safe cryptography.
The Internet of Things (IoT) now underpins critical systems like healthcare monitors, smart home, smart grids, automotive V2V & V2X networks, and industrial controls but it still relies on classical cryptography, whose security assumptions are vulnerable to quantum computers. A large quantum computer could run Shor’s algorithm to break RSA/ECC and use Grover’s algorithm to accelerate brute-forcing of symmetric keys, undermining the confidentiality and authentication of data in these IoT applications. Researchers have proposed quantum cryptographic solutions. Quantum key distribution (QKD) and quantum random number generators (QRNGs) exploit quantum mechanics to detect eavesdropping and deliver provably secure key material. For example, chip-scale QRNGs can be embedded in IoT sensors to generate true random keys, boosting resistance to brute-force attacks. These quantum techniques provide information-theoretic secrecy, for instance, QKD-generated keys have been used to authenticate smart-grid SCADA. However, most IoT devices are resource-constrained, making direct deployment of conventional QKD hardware challenging. Post-quantum cryptography (PQC) complements quantum methods by providing algorithms such as lattice-based, hash-based that resist quantum attacks on existing hardware. Standardized PQC can be deployed via software updates on legacy IoT nodes, enabling scalable and quantum-safe security within current constraints. Researchers are exploring lightweight PQC for connected cars and e-health sensors. Hybrid approaches combining QKD/QRNG with PQC offer a layered defense. Since QKD protocols are regarded as ‘future-proof’ and PQC standards mature, their combined use will be essential for robust, quantum-safe IoT security. Miniaturizing quantum components such as integrated QKD/QRNG modules and optimizing lightweight PQC schemes for low-power IoT devices are future research directions to secure IoT networks.