Fiber coupled single photon receivers based on superconducting detectors for quantum communications and quantum cryptography

Author(s):  
K. V. Smirnov ◽  
Yu. B. Vachtomin ◽  
R. V. Ozhegov ◽  
I. V. Pentin ◽  
E. V. Slivinskaya ◽  
...  
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.


2004 ◽  
Vol 51 (9-10) ◽  
pp. 1447-1458 ◽  
Author(s):  
A. Verevkin ◽  
A. Pearlman ◽  
W. Slysz ◽  
J. Zhang ◽  
M. Currie ◽  
...  

2005 ◽  
Vol 15 (2) ◽  
pp. 579-582 ◽  
Author(s):  
A. Pearlman ◽  
A. Cross ◽  
W. Slysz ◽  
J. Zhang ◽  
A. Verevkin ◽  
...  

2003 ◽  
Author(s):  
Edo Waks ◽  
Kyo Inoue ◽  
Charles Santori ◽  
David Fattal ◽  
Jelena Vuckovic ◽  
...  

2005 ◽  
Vol 2 (5) ◽  
pp. 1480-1488 ◽  
Author(s):  
G. N. Gol'tsman ◽  
A. Korneev ◽  
I. Rubtsova ◽  
I. Milostnaya ◽  
G. Chulkova ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document