Cryptanalysis of a Practical Quantum Key Distribution with Polarization-Entangled Photons

2005 ◽  
Vol 5 (3) ◽  
pp. 181-186
Author(s):  
Th. Beth ◽  
J. Muller-Quade ◽  
R. Steinwandt

Recently, a quantum key exchange protocol has been described\cite{PFLM04}, which served as basis for securing an actual bank transaction by means of quantum cryptography \cite{ZVS04}. The authentication scheme used to this aim has been proposed by Peev et al. \cite{PML04}. Here we show, that this authentication is insecure in the sense that an attacker can provoke a situation where initiator and responder of a key exchange end up with different keys. Moreover, it may happen that an attacker can decrypt a part of the plaintext protected with the derived encryption key.

2016 ◽  
Vol 14 (02) ◽  
pp. 1630002
Author(s):  
Monika Jacak ◽  
Janusz Jacak ◽  
Piotr Jóźwiak ◽  
Ireneusz Jóźwiak

The overview of the current status of quantum cryptography is given in regard to quantum key distribution (QKD) protocols, implemented both on nonentangled and entangled flying qubits. Two commercial R&D platforms of QKD systems are described (the Clavis II platform by idQuantique implemented on nonentangled photons and the EPR S405 Quelle platform by AIT based on entangled photons) and tested for feasibility of their usage in commercial TELECOM fiber metropolitan networks. The comparison of systems efficiency, stability and resistivity against noise and hacker attacks is given with some suggestion toward system improvement, along with assessment of two models of QKD.


Author(s):  
Stephen 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.


2006 ◽  
Vol 6 (4&5) ◽  
pp. 326-335
Author(s):  
M. Legré ◽  
H. Zbinden ◽  
N. Gisin

We demonstrate an implementation of quantum key distribution with continuous variables based on a go-&-return configuration over distances up to 14km. This configuration leads to self-compensation of polarisation and phase fluctuations. We observe a high degree of stability of our set-up over many hours.


Author(s):  
Meenakshi Sharma ◽  
Sonia Thind

In order to protect and secure the sensitive data over the internet, the current data security methods typically depend on the cryptographic systems. Recent achievements in quantum computing is a major challenge to such cryptography systems. In this way, the quantum key distribution (QKD) technique evolves as a very important technique which gives un-conditional data security. This technique is based on the laws of quantum physics for its security. This article gives a detailed description of the QKD technique. This technique secures the encryption key delivery between the two authenticated parties from the unauthorized access. In the next phase, quantum cryptography model is discussed. Finally, some important application areas and limitations of this technology are be discussed.


2003 ◽  
Vol 3 (6) ◽  
pp. 581-602
Author(s):  
D. Gottesman

Quantum states cannot be cloned. I show how to extend this property to classical messages encoded using quantum states, a task I call ``uncloneable encryption.'' An uncloneable encryption scheme has the property that an eavesdropper Eve not only cannot read the encrypted message, but she cannot copy it down for later decoding. She could steal it, but then the receiver Bob would not receive the message, and would thus be alerted that something was amiss. I prove that any authentication scheme for quantum states acts as a secure uncloneable encryption scheme. Uncloneable encryption is also closely related to quantum key distribution (QKD), demonstrating a close connection between cryptographic tasks for quantum states and for classical messages. Thus, studying uncloneable encryption and quantum authentication allows for some modest improvements in QKD protocols. While the main results apply to a one-time key with unconditional security, I also show uncloneable encryption remains secure with a pseudorandom key. In this case, to defeat the scheme, Eve must break the computational assumption behind the pseudorandom sequence before Bob receives the message, or her opportunity is lost. This means uncloneable encryption can be used in a non-interactive setting, where QKD is not available, allowing Alice and Bob to convert a temporary computational assumption into a permanently secure message.


Sign in / Sign up

Export Citation Format

Share Document