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

Science News

Matter & energy: A way to crack quantum encryption: Time‐travel technique could break supposedly secure codes

Rachel Ehrenberg

Published Dec 6, 2008• 0 citations
Publisher
DOI
10.1002/scin.2008.5591741215

Related papers

Time Travel Beats Quantum Mechanics

David Lindley

A miniature time machine, possibly based on a wormhole through spacetime, could be used to break a super-secure quantum code.

Focus•Jun 1, 2009•0 citations

Making unbreakable code

Justin Mullins

A product is on the way that relies on the quantum properties of photons to keep out eavesdroppers. All of them. The battle between codemakers and codebreakers is centuries old, but at the start of the 21st century, could it finally be drawing to a close? Physicists are putting the finishing touches to a method of encrypting messages that is more secure than anything that has gone before. Unlike the ciphers of the past, this new method has the potential to be absolutely unbreakable, not just practically unbreakable, but theoretically unbreakable. Mathematicians believe they can prove it. Central to the technique are the strange laws of quantum mechanics. Already experimental messages encrypted using quantum mechanics are being sent over tens of kilometers of optical fibers and received securely. Researchers are confident that it will not be long before ultra-secret messages are routinely transmitted in this way. But while quantum cryptography may be perfect in theory, practical considerations introduce security loopholes that an eavesdropper can exploit. The seriousness of these is still unclear, and physicists believe they can plug most of the holes with more efficient equipment. Still, enough cracks remain to maintain a healthy interest among cryptographers.

IEEE Spectrum•May 1, 2002•12 citations

Matter & energy: Plan for hack‐free data encryption: Quantum technique would eliminate snoop checks

Andrew Grant

Science News•Jun 17, 2014•0 citations

Quantum Enhanced Secure Communication Integrating Quantum Entanglement Based Secure Channels with XOR Based Encryption for Resilient Data Exchange

M. Sivaranjini, N. Raviragul, V. Joel Kirubakaran +1 more

Digital interaction's expansion has created a necessity for safe and efficient data transfer. Standard encryption procedures can be cracked by sophisticated hacking techniques, and moreover, they will become obsolete in the future with the emergence of quantum computers. This article introduces a hybrid cryptography that consists of a secure channel based on quantum entanglement and a lightweight encryption scheme using XOR operations. Quantum key distribution allows for a tamper-proof key exchange, and at the same time, XOR encryption provides a very simple and quick encryption and decryption process. Thus, this double-layer security system not only ensures data privacy and data integrity but also makes it difficult for the attackers to use brute force or become one of the middle parties during the transaction. Moreover, the XOR algorithm can lower the number of calculations needed for the process, so the method can be utilized in real-time secure communication without any computational overhead. Simulation experiments are used for the evaluation of security, the time for the key generation, and the efficiency of encryption. Experiments of results underline the excellent protection of information interception and low technical overhead signalled in comparison with traditional methods of cryptography. This paper exemplifies one possible way to mix quantum and classical encryption techniques to build a secure communication system that is reliable, upgradable, and less vulnerable to attacks, which could eventually lead to a post-quantum era.

International Conference on Signal, Systems, and Computing for Next-Gen Automation (ICSSCNA)•May 4, 2026•0 citations

From Pre-Quantum to Post-Quantum RSA

Sandeep Joshi, Amit Kumar Bairwa, Anton Pavlovich Pljonkin +2 more

Quantum computing, however young, challenges the most popular public-key encryption techniques. Due to their ability to solve the key distribution problem and provide high security in insecure communications channels that allow website access, email exchange, financial transactions, digitally signed documents, military communications, and medical data, such systems are vital to Internet security today. RSA, ECC, and Diffie Hellman are increasingly used globally. Internet protocols like Transport Layer Security (TLS) used by ordinary PCs and IoT devices increasingly include these systems. Because many IoT devices are battery-powered and have limited processing power and memory, they need energy-efficient and lightweight algorithms to provide effective security. These constraints become critical when developing cryptosystems that require extensive mathematical operations and significant computing resources, often needed in defence, mission-critical, or intelligent healthcare applications where data privacy must be maintained over time. Scientists are striving to protect IoT devices against quantum computing. This study will demonstrate how quantum computing can break RSA in polynomial time, something conventional computers cannot do due to processing power constraints. It will show how quantum computing could effect blockchain and wallet signatures, which employ the RSA cryptosystem for key encryption. Quantum computers with more qubits will crack factorization cyphers faster.

International Conference on Networking, Information Systems & Security (NISS)•May 24, 2023•7 citations

Key Encryption Through Quantum Optics

Madison Durrance, Zach Galberd, Abbey Savage +2 more

•Jan 1, 2017•0 citations
A product is on the way that relies on the quantum properties of photons to keep out eavesdroppers. All of them. The battle between codemakers and codebreakers is centuries old, but at the start of the 21st century, could it finally be drawing to a close? Physicists are putting the finishing touches to a method of encrypting messages that is more secure than anything that has gone before. Unlike the ciphers of the past, this new method has the potential to be absolutely unbreakable, not just practically unbreakable, but theoretically unbreakable. Mathematicians believe they can prove it. Central to the technique are the strange laws of quantum mechanics. Already experimental messages encrypted using quantum mechanics are being sent over tens of kilometers of optical fibers and received securely. Researchers are confident that it will not be long before ultra-secret messages are routinely transmitted in this way. But while quantum cryptography may be perfect in theory, practical considerations introduce security loopholes that an eavesdropper can exploit. The seriousness of these is still unclear, and physicists believe they can plug most of the holes with more efficient equipment. Still, enough cracks remain to maintain a healthy interest among cryptographers.
Digital interaction's expansion has created a necessity for safe and efficient data transfer. Standard encryption procedures can be cracked by sophisticated hacking techniques, and moreover, they will become obsolete in the future with the emergence of quantum computers. This article introduces a hybrid cryptography that consists of a secure channel based on quantum entanglement and a lightweight encryption scheme using XOR operations. Quantum key distribution allows for a tamper-proof key exchange, and at the same time, XOR encryption provides a very simple and quick encryption and decryption process. Thus, this double-layer security system not only ensures data privacy and data integrity but also makes it difficult for the attackers to use brute force or become one of the middle parties during the transaction. Moreover, the XOR algorithm can lower the number of calculations needed for the process, so the method can be utilized in real-time secure communication without any computational overhead. Simulation experiments are used for the evaluation of security, the time for the key generation, and the efficiency of encryption. Experiments of results underline the excellent protection of information interception and low technical overhead signalled in comparison with traditional methods of cryptography. This paper exemplifies one possible way to mix quantum and classical encryption techniques to build a secure communication system that is reliable, upgradable, and less vulnerable to attacks, which could eventually lead to a post-quantum era.
Quantum computing, however young, challenges the most popular public-key encryption techniques. Due to their ability to solve the key distribution problem and provide high security in insecure communications channels that allow website access, email exchange, financial transactions, digitally signed documents, military communications, and medical data, such systems are vital to Internet security today. RSA, ECC, and Diffie Hellman are increasingly used globally. Internet protocols like Transport Layer Security (TLS) used by ordinary PCs and IoT devices increasingly include these systems. Because many IoT devices are battery-powered and have limited processing power and memory, they need energy-efficient and lightweight algorithms to provide effective security. These constraints become critical when developing cryptosystems that require extensive mathematical operations and significant computing resources, often needed in defence, mission-critical, or intelligent healthcare applications where data privacy must be maintained over time. Scientists are striving to protect IoT devices against quantum computing. This study will demonstrate how quantum computing can break RSA in polynomial time, something conventional computers cannot do due to processing power constraints. It will show how quantum computing could effect blockchain and wallet signatures, which employ the RSA cryptosystem for key encryption. Quantum computers with more qubits will crack factorization cyphers faster.