A Talk on Quantum Cryptography or How Alice Outwits Eve

Samuel J. Lomonaco

Alice and Bob wish to communicate without the archvillainess Eve eavesdropping on their conversation. Alice, decides to take two college courses, one in cryptography, the other in quantum mechanics. During the courses, she discovers she can use what she has just learned to devise a cryptographic communication system that automatically detects whether or not Eve is up to her villainous eavesdropping. Some of the topics discussed are Heisenberg's Uncertainty Principle, the Vernam cipher, the BB84 and B92 cryptographic protocols. The talk ends with a discussion of some of Eve's possible eavesdropping strategies, opaque eavesdropping, translucent eavesdropping, and translucent eavesdropping with entanglement.

Anonymous

Gilles Brassard A

Samuel J. Lomonaco

An invitation to quantum computation: A Rosetta stone for quantum mechanics with an introduction to quantum computation by S. J. Lomonaco, Jr. Qubit devices by H. E. Brandt Quantum algorithms and quantum complexity theory: Introduction to quantum algorithms by P. W. Shor Shor's quantum factoring algorithm by S. J. Lomonaco, Jr. Grover's quantum search algorithm by S. J. Lomonaco, Jr. A survey of quantum complexity theory by U. V. Vazirani Quantum error correcting codes and quantum cryptography: An introduction to quantum error correction by D. Gottesman A talk on quantum cryptography or how Alice outwits Eve by S. J. Lomonaco, Jr. More mathematical connections: Topological quantum codes and anyons by A. Kitaev Quantum topology and quantum computing by L. H. Kauffman An entangled tale of quantum entanglement by S. J. Lomonaco, Jr. Index.

A. K. M. Harun-Ar-Rashid

Jianzhong Zhao

The existing quantum cryptography is a classical cryptography in nature and basically insecure because of its classical (conventional) bits, classical encryption algorithm and classical (public) channel. A novel topic about successful communication between the legitimate users, Alice and Bob, is discussed with probability of solution uniqueness of Bob’s decryption equation. We find, by probabilistic analysis, that success of communication between Alice and Bob is probabilistic with a probability bigger than 1/2. It is also novel to define insecurity of the quantum cryptography by probability of solution uniqueness of the search equation of Eve, the eavesdropper. The probability of Eve’s success to find the plain-text of Alice (and Bob) is greater than 1/2, and so the quantum cryptography is seriously insecure.