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

Focus

Thwarting Post-Quantum Spies

Adrian Y. Cho

Published Jun 1, 2005• 0 citations
Publisher

Abstract

“Uncrackable” quantum cryptography can thwart spies even if today’s quantum theory is replaced by something better–as long as it remains impossible to send messages faster than light.
DOI
10.1103/physrevfocus.15.22

Related papers

Focus: Thwarting Post-Quantum Spies

Adrian Y. Cho

“Uncrackable” quantum cryptography can thwart spies even if today’s quantum theory is replaced by something better–as long as it remains impossible to send messages faster than light.

•Jun 30, 2005•0 citations

Foiling Quantum Hackers

Hoi‐Kwong Lo

Researchers have implemented a new quantum encryption method that, in principle, may provide the ultimate security against hackers in real-world cryptography applications.

Physics•Sep 23, 2013•0 citations

Post-Quantum Cryptography

Don Monroe

Cryptographers seek algorithms quantum computers cannot break.

Communications of the ACM•Jan 20, 2023•6 citations

Simple Noise May Stymie Spies Without Quantum Weirdness

Adrian Y. Cho

With the grand ambition of sending unbreakable coded messages, some physicists are using exotic tools—streams of individual photons and quantum mechanics—to shut out prying eyes. But a wire and a few resistors may convey a message as securely, says a physicist who has devised a simple and—he claims—uncrackable scheme. The idea shows that "classical" methods might compete with budding "quantum cryptography," others say. "I believe in beautiful and simple ideas, and this is one of them," says János Bergou, a theorist at Hunter College of the City University of New York.

Science•Sep 29, 2005•61 citations

Post-Quantum Cryptography is Not Secure to Attacks with Physics Beyond the Standard Model

Trevor Nestor

•Jan 1, 2026•0 citations

Cryptographic encryption scheme for solving the trusted courier problem based on metastable excited nuclei

Thomas Durt, Α. Hermanne

Quantum cryptography makes it possible to expand a short shared key (of e.g. 256 bits[1]) into an arbitrary long shared key. The novelty of quantum cryptography is that whenever a spy tries to eavesdrop the communication he causes disturbances in the transmission of the message. Ultimately this unavoidable disturbance is a consequence of Heisenberg's uncertainty principle that limits the joint knowledge of complementary observables. Now, a problem remains: in order to initialize quantum key distribution, Alice and Bob need to share a short shared key in order to be able to identify each other unambiguously. Therefore a trusted courier is needed. We propose in this paper a solution to the trusted courrier problem that was inspired by quantum cryptography. The idea is to encode the key that Alice sends to Bob into unstable nuclei in such a way that the message gets revealed only after the courrier has delivered it to Bob. In this approach, we replace Heisenberg uncertainties by another type of uncertainty, that characterizes the knowledge of the time at which an unstable nucleus decays. As we shall show, this scheme makes it possible to refresh a key even in the case that we do not trust the courier who carries the key.

arXiv:0910.3131•Oct 16, 2009•0 citations
With the grand ambition of sending unbreakable coded messages, some physicists are using exotic tools—streams of individual photons and quantum mechanics—to shut out prying eyes. But a wire and a few resistors may convey a message as securely, says a physicist who has devised a simple and—he claims—uncrackable scheme. The idea shows that "classical" methods might compete with budding "quantum cryptography," others say. "I believe in beautiful and simple ideas, and this is one of them," says János Bergou, a theorist at Hunter College of the City University of New York.
Quantum cryptography makes it possible to expand a short shared key (of e.g. 256 bits[1]) into an arbitrary long shared key. The novelty of quantum cryptography is that whenever a spy tries to eavesdrop the communication he causes disturbances in the transmission of the message. Ultimately this unavoidable disturbance is a consequence of Heisenberg's uncertainty principle that limits the joint knowledge of complementary observables. Now, a problem remains: in order to initialize quantum key distribution, Alice and Bob need to share a short shared key in order to be able to identify each other unambiguously. Therefore a trusted courier is needed. We propose in this paper a solution to the trusted courrier problem that was inspired by quantum cryptography. The idea is to encode the key that Alice sends to Bob into unstable nuclei in such a way that the message gets revealed only after the courrier has delivered it to Bob. In this approach, we replace Heisenberg uncertainties by another type of uncertainty, that characterizes the knowledge of the time at which an unstable nucleus decays. As we shall show, this scheme makes it possible to refresh a key even in the case that we do not trust the courier who carries the key.