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

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences

Turing, ciphers and quanta

ARTUR K. EKERT, Alastair Kay, James E. Pope

Published Jun 18, 2012• 1 citation
Publisher

Abstract

Alan Turing has certainly contributed to a widespread belief that the quest for a perfect, unbreakable, cipher is a futile pursuit. The ancient art of concealing information has, in the past, been matched by the ingenuity of code-breakers, but no longer! With the advent of quantum cryptography, the hopes of would-be eavesdroppers have been dashed, perhaps for good. Moreover, recent research, building on schemes that were invented decades ago to perform quantum cryptography, shows that secure communication certified by a sufficient violation of a Bell inequality makes a seemingly insane scenario possible-devices of unknown or dubious provenance, even those that are manufactured by our enemies, can be safely used for secure communication, including key distribution. All that is needed to implement this bizarre and powerful form of cryptography is a loophole-free test of a Bell inequality, which is on the cusp of technological feasibility. We provide a brief overview of the intriguing connections between Bell inequalities and cryptography and describe how studies of quantum entanglement and the foundations of quantum theory influence the way we may protect information in the future.

DOI
10.1098/rsta.2011.0324

Related papers

Quantum cryptography

Stephen Mark Barnett

The practical implementation of quantum information technologies requires, for the most part, highly advanced and currently experimental procedures. One exception is quantum cryptography, or quantum key distribution, which has been successfully demonstrated in many laboratories and has reached an advanced level of development. It will probably become the first commercial application of quantum information. In quantum key distribution, Alice and Bob exploit a quantum channel to create a secret shared key comprising a random string of binary digits. This key can then be used to protect a subsequent communication between them. The principal idea is that the secrecy of the key distribution is ensured by the laws of quantum physics. Proving security for practical communication systems is a challenging problem and requires techniques that are beyond the scope of this book. At a fundamental level, however, the ideas are simple and may readily be understood with the knowledge we have already acquired. Quantum cryptography is the latest idea in the long history of secure (and not so secure) communications and, if it is to develop, it will have to compete with existing technologies. For this reason we begin with a brief survey of the history and current state of the art in secure communications before turning to the possibilities offered by quantum communications. The history of cryptography is a long and fascinating one. As a consequence of the success or, more spectacularly, the failure of ciphers, wars have been fought, battles decided, kingdoms won, and heads lost. In the information age, ciphers and cryptosystems have become part of everyday life; we use them to protect our computers, to shop over the Internet, and to access our money via an ATM (automated teller machine). One of the oldest and simplest of all ciphers is the transposition or Caesarean cipher (attributed to Julius Caesar), in which the letters are shifted by a known (and secret) number of places in the alphabet. If the shift is 1, for example, then A is enciphered as B, B→C, · · ·, Y→Z, Z→A. A shift of five places leads us to make the replacements A→F, B→G, · · ·, Y→D, Z→E.

Oxford University Press eBooks•May 28, 2009•1 citation

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

Quantum cryptography

Jonathan A. Jones, Dieter Jaksch

Cryptographic protocols can be classified by the type of security against eavesdropping which they provide. There exist mathematically secure schemes whose security relies on mathematical proofs (like the Vernam cipher discussed below) or conjectures (like public key RSA encryption) about the complexity of deciphering the message without possessing the correct key. The majority of current secure public Internet connections rely on such schemes. Alternatively, a cryptographic setup may provide a physically secure method for communicating. In these setups the security is provided by the physical laws governing the communication protocol. Here we first discuss a provably secure classical communication protocol and then quantum methods for distributing the necessary keys. The BB84 protocol relies on the impossibility of perfectly distinguishing non-orthogonal quantum states from one copy of the quantum system. The scheme was invented in 1984 and is the first of its kind. In contrast, the Ekert91 protocol makes use of Bell correlations between entangled pairs of photons. These correlations are destroyed when Eve attempts to make a measurement on one of the particles but also when imperfections, such as decoherence processes, affect the scheme. As long as no such “elements of reality” are introduced, and Bell correlations violating local realism can be generated by Alice and Bob, no eavesdropper can be present.

Cambridge University Press eBooks•Jul 19, 2012•0 citations

A quantum jump in security

Hoi‐Kwong Lo

ABSTRACT Q uantum mechanics can revolutionize the art of code-making by breaking standard encryption schemes and by making unbreakable codes. In this document, I survey the motivation, power and limitation of quantum code-making. * Keywords: Quantum computing, quantum information, quantum cryptography, security, key distribution,cryptography 1. INTRODUCTION Human desire to keep written messages secret is almost as old as writing itself. Indeed, cryptography—the artof code-making—dated back to the Babylonians. For thousands of years, code-makers and code-breakers have engaged in an escalating arms race with each other.' Cryptographers do not sleep well. Every innovation in code-making has so far been defeated by new innovation in code-breaking with disastrous consequence tothe unsuspecting users of those insecure codes. For instance, Queen Mary of Scotland was executed by QueenElizabeth following the decoding of encrypted communications between Queen Mary and her conspirators whichprovided the irrefutable proof of her quilt in plotting against Queen Elizabeth. In the Second World War, thebreaking of the legendary German Engima code by the Allied code-breakers contributed significantly to theoutcome of the war. In cryptography, one must expect the unexpected and even the unthinkable.Q uantum mechanics has made a recent entry in this life and death struggle between code-makers and code-23 In this document, I will address the following frequently asked questions:(1) What quantum code-breaking can do?(2) What quantum code-making can do?(3) What quantum code-making cannot do?

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 12, 2003•0 citations

Practical security of quantum cryptography

Lars Lydersen

The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography.\n\nQuantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography is implemented, one must use components available with current technology. These are usually imperfect. Although the security of quantum cryptography has been proven for components with certain imperfections, the question remains: can quantum cryptography be implemented in a provable, unconditionally secure way, using components available with current technology? This thesis contains both a theoretical, and an experimental contribution to the answer of this question. On the experimental side, components used in, and complete quantum cryptography systems have been carefully examined for security loopholes. In particular, it turned out that two commercial quantum cryptography systems contained loopholes, which would allow an eavesdropper to capture the full secret key, without exposing her presence. Furthermore, this detector control attack could be implemented with current technology. The attack is applicable against a variety of quantum cryptography implementations and protocols.\n\nThe theoretical contribution consists of security proofs for quantum cryptography in a very general setting. Precisely, the security is proven with arbitrary individual imperfections in the source and detectors. These proofs should make it possible to use a wide array of imperfect devices in implementations of quantum cryptography.\n\nFinally, a secure detection scheme is proposed, immune to the detector control attack and compatible with those security proofs. Therefore, if this scheme is implemented correctly, it offers provable security.

•Jan 1, 2011•4 citations

QUANTUM CRYPTOGRAPHY: A NOVEL APPROACH TO COMMUNICATION SECURITY

A. Porzio

Quantum Cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel, like when we buy something on the web, a sophisticated protocol protects our privacy making our data unintelligible to unauthorised receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceeds the available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realise provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations, for realising protocols whose security is intrinsic. In this contribution, after a brief historical introduction, we aim to provide a survey on the physical principles underlying the quantum approach to cryptography. Then, in the second part, we analyse in more detail two of the possible protocols and glance over the state of art of the research in the field.

WORLD SCIENTIFIC eBooks•Oct 10, 2013•0 citations
Alan Turing has certainly contributed to a widespread belief that the quest for a perfect, unbreakable, cipher is a futile pursuit. The ancient art of concealing information has, in the past, been matched by the ingenuity of code-breakers, but no longer! With the advent of quantum cryptography, the hopes of would-be eavesdroppers have been dashed, perhaps for good. Moreover, recent research, building on schemes that were invented decades ago to perform quantum cryptography, shows that secure communication certified by a sufficient violation of a Bell inequality makes a seemingly insane scenario possible-devices of unknown or dubious provenance, even those that are manufactured by our enemies, can be safely used for secure communication, including key distribution. All that is needed to implement this bizarre and powerful form of cryptography is a loophole-free test of a Bell inequality, which is on the cusp of technological feasibility. We provide a brief overview of the intriguing connections between Bell inequalities and cryptography and describe how studies of quantum entanglement and the foundations of quantum theory influence the way we may protect information in the future.
The practical implementation of quantum information technologies requires, for the most part, highly advanced and currently experimental procedures. One exception is quantum cryptography, or quantum key distribution, which has been successfully demonstrated in many laboratories and has reached an advanced level of development. It will probably become the first commercial application of quantum information. In quantum key distribution, Alice and Bob exploit a quantum channel to create a secret shared key comprising a random string of binary digits. This key can then be used to protect a subsequent communication between them. The principal idea is that the secrecy of the key distribution is ensured by the laws of quantum physics. Proving security for practical communication systems is a challenging problem and requires techniques that are beyond the scope of this book. At a fundamental level, however, the ideas are simple and may readily be understood with the knowledge we have already acquired. Quantum cryptography is the latest idea in the long history of secure (and not so secure) communications and, if it is to develop, it will have to compete with existing technologies. For this reason we begin with a brief survey of the history and current state of the art in secure communications before turning to the possibilities offered by quantum communications. The history of cryptography is a long and fascinating one. As a consequence of the success or, more spectacularly, the failure of ciphers, wars have been fought, battles decided, kingdoms won, and heads lost. In the information age, ciphers and cryptosystems have become part of everyday life; we use them to protect our computers, to shop over the Internet, and to access our money via an ATM (automated teller machine). One of the oldest and simplest of all ciphers is the transposition or Caesarean cipher (attributed to Julius Caesar), in which the letters are shifted by a known (and secret) number of places in the alphabet. If the shift is 1, for example, then A is enciphered as B, B→C, · · ·, Y→Z, Z→A. A shift of five places leads us to make the replacements A→F, B→G, · · ·, Y→D, Z→E.
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.
Cryptographic protocols can be classified by the type of security against eavesdropping which they provide. There exist mathematically secure schemes whose security relies on mathematical proofs (like the Vernam cipher discussed below) or conjectures (like public key RSA encryption) about the complexity of deciphering the message without possessing the correct key. The majority of current secure public Internet connections rely on such schemes. Alternatively, a cryptographic setup may provide a physically secure method for communicating. In these setups the security is provided by the physical laws governing the communication protocol. Here we first discuss a provably secure classical communication protocol and then quantum methods for distributing the necessary keys. The BB84 protocol relies on the impossibility of perfectly distinguishing non-orthogonal quantum states from one copy of the quantum system. The scheme was invented in 1984 and is the first of its kind. In contrast, the Ekert91 protocol makes use of Bell correlations between entangled pairs of photons. These correlations are destroyed when Eve attempts to make a measurement on one of the particles but also when imperfections, such as decoherence processes, affect the scheme. As long as no such “elements of reality” are introduced, and Bell correlations violating local realism can be generated by Alice and Bob, no eavesdropper can be present.
ABSTRACT Q uantum mechanics can revolutionize the art of code-making by breaking standard encryption schemes and by making unbreakable codes. In this document, I survey the motivation, power and limitation of quantum code-making. * Keywords: Quantum computing, quantum information, quantum cryptography, security, key distribution,cryptography 1. INTRODUCTION Human desire to keep written messages secret is almost as old as writing itself. Indeed, cryptography—the artof code-making—dated back to the Babylonians. For thousands of years, code-makers and code-breakers have engaged in an escalating arms race with each other.' Cryptographers do not sleep well. Every innovation in code-making has so far been defeated by new innovation in code-breaking with disastrous consequence tothe unsuspecting users of those insecure codes. For instance, Queen Mary of Scotland was executed by QueenElizabeth following the decoding of encrypted communications between Queen Mary and her conspirators whichprovided the irrefutable proof of her quilt in plotting against Queen Elizabeth. In the Second World War, thebreaking of the legendary German Engima code by the Allied code-breakers contributed significantly to theoutcome of the war. In cryptography, one must expect the unexpected and even the unthinkable.Q uantum mechanics has made a recent entry in this life and death struggle between code-makers and code-23 In this document, I will address the following frequently asked questions:(1) What quantum code-breaking can do?(2) What quantum code-making can do?(3) What quantum code-making cannot do?
The peculiar properties of quantum mechanics enable possibilities not allowed by classical physics. In particular, two parties can generate a random, secret key at a distance, even though an eavesdropper can do anything permitted by the laws of physics. Measuring the quantum properties of the signals generating the key, would ultimately change them, and thus reveal the eavesdropper’s presence. This exchange of a random, secret key is known as quantum cryptography.\n\nQuantum cryptography can be, and has been proven unconditionally secure using perfect devices. However, when quantum cryptography is implemented, one must use components available with current technology. These are usually imperfect. Although the security of quantum cryptography has been proven for components with certain imperfections, the question remains: can quantum cryptography be implemented in a provable, unconditionally secure way, using components available with current technology? This thesis contains both a theoretical, and an experimental contribution to the answer of this question. On the experimental side, components used in, and complete quantum cryptography systems have been carefully examined for security loopholes. In particular, it turned out that two commercial quantum cryptography systems contained loopholes, which would allow an eavesdropper to capture the full secret key, without exposing her presence. Furthermore, this detector control attack could be implemented with current technology. The attack is applicable against a variety of quantum cryptography implementations and protocols.\n\nThe theoretical contribution consists of security proofs for quantum cryptography in a very general setting. Precisely, the security is proven with arbitrary individual imperfections in the source and detectors. These proofs should make it possible to use a wide array of imperfect devices in implementations of quantum cryptography.\n\nFinally, a secure detection scheme is proposed, immune to the detector control attack and compatible with those security proofs. Therefore, if this scheme is implemented correctly, it offers provable security.
Quantum Cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel, like when we buy something on the web, a sophisticated protocol protects our privacy making our data unintelligible to unauthorised receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceeds the available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realise provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations, for realising protocols whose security is intrinsic. In this contribution, after a brief historical introduction, we aim to provide a survey on the physical principles underlying the quantum approach to cryptography. Then, in the second part, we analyse in more detail two of the possible protocols and glance over the state of art of the research in the field.