Quantum cryptography: How to beat the code breakers using quantum mechanics

1995 ◽  
Vol 36 (3) ◽  
pp. 165-195 ◽  
Author(s):  
Simon J. D. Phoenix ◽  
Paul D. Townsend
Keyword(s):  
Quantum Mechanics ◽  
Quantum Cryptography

Can quantum cryptography imply quantum mechanics? -- reply to Smolin

2005 ◽  
Vol 5 (2) ◽  
pp. 170-175
Author(s):  
H. Halvorson ◽  
J. Bub
Keyword(s):  
Quantum Mechanics ◽  
Quantum Cryptography ◽  
Physical Theory ◽  
Information Theoretic ◽  
Independence Condition

Clifton, Bub, and Halvorson (CBH) have argued that quantum mechanics can be derived from three cryptographic, or broadly information-theoretic, axioms. But Smolin disagrees, and he has given a toy theory that he claims is a counterexample. Here we show that Smolin's toy theory violates an independence condition for spacelike separated systems that was assumed in the CBH argument. We then argue that any acceptable physical theory should satisfy this independence condition.

Quantum Cryptography Key Distribution

2021 ◽  
pp. 325-344
Author(s):  
Bhanu Chander
Keyword(s):  
Quantum Mechanics ◽  
Information Transmission ◽  
Quantum Cryptography ◽  
Quantum Physics ◽  
Large Scale ◽  
Key Distribution ◽  
Computing Power ◽  
Contemporary State ◽  
Quantum Resistant Cryptography ◽  
Quantum Protocol

Quantum cryptography is actions to protect transactions through executing the circumstance of quantum physics. Up-to-the-minute cryptography builds security over the primitive ability of fragmenting enormous numbers into relevant primes; however, it features inconvenience with ever-increasing machine computing power along with current mathematical evolution. Among all the disputes, key distribution is the most important trouble in classical cryptography. Quantum cryptography endows with clandestine communication by means of offering a definitive protection statement with the rule of the atmosphere. Exploit quantum mechanics to cryptography can be enlarging unrestricted, unfailing information transmission. This chapter describes the contemporary state of classical cryptography along with the fundamentals of quantum cryptography, quantum protocol key distribution, implementation criteria, quantum protocol suite, quantum resistant cryptography, and large-scale quantum key challenges.

Quantum

2017 ◽  
Author(s):  
Lance Fortnow
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Cryptography ◽  
Nobel Prize ◽  
Quantum Computers ◽  
Physical Systems ◽  
Medium Scale ◽  
Computer Scientists ◽  
Working Together ◽  
Richard Feynman

This chapter examines the power of quantum computing, as well as the related concepts of quantum cryptography and teleportation. In 1982, the Nobel prize-winning physicist Richard Feynman noticed there was no simple way of simulating quantum physical systems using digital computers. He turned this problem into an opportunity—perhaps a computational device based on quantum mechanics could solve problems more efficiently than more traditional computers. In the decades that followed, computer scientists and physicists, often working together, showed in theory that quantum computers can solve certain problems, such as factoring numbers, much faster. Whether one can actually build large or even medium-scale working quantum computers and determine exactly what these computers can or cannot do still remain significant challenges.

Post-Quantum Lattice-Based Cryptography

2021 ◽  
pp. 102-123
Author(s):  
Aarti Dadheech
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Cryptography ◽  
Future Internet ◽  
Worst Case ◽  
Quantum Lattice ◽  
Average Case ◽  
Cryptographic Algorithms ◽  
The Future ◽  
Lattice Based Cryptography

Quantum cryptography is a branch of cryptography that is a mixture of quantum mechanics and classical cryptography. The study of quantum cryptography is to design cryptographic algorithms and protocols that are against quantum computing attacks. In this chapter, the authors focus on analyzing characteristics of the quantum-proof cryptosystem and its applications in the future internet. Lattice-based cryptography provides a much stronger belief of security, in that the average-case of certain problems is equivalent to the worst-case of those problems. With the increase in cryptanalytic attacks conventional cryptographic schemes will soon become obsolete. As the reality of quantum computing approaches, these cryptosystems will need to be replaced with efficient quantum-resistant cryptosystems. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this chapter, the authors discuss the security dimension of lattice-based cryptography whose strength lies in the hardness of lattice problems and also study its application areas.

Can quantum cryptography imply quantum mechanics?

2005 ◽  
Vol 5 (2) ◽  
pp. 161-169
Author(s):  
J.A. Smolin
Keyword(s):  
Quantum Mechanics ◽  
Quantum Cryptography ◽  
Secret Key ◽  
Bit Commitment ◽  
Additional Axiom ◽  
Quantum Nature

It has been suggested that the ability of quantum mechanics to allow secure distribution of secret key together with its inability to allow bit commitment or communicate superluminally might be sufficient to imply the rest of quantum mechanics. I argue using a toy theory as a counterexample that this is not the case. I further discuss whether an additional axiom (key storage) brings back the quantum nature of the theory.

SHORT DISTANCE APPLICATIONS OF QUANTUM CRYPTOGRAPHY

1996 ◽  
Vol 05 (04) ◽  
pp. 823-832 ◽  
Author(s):  
BRUNO HUTTNER ◽  
NOBUYUKI IMOTO ◽  
STEVE M. BARNETT
Keyword(s):  
Quantum Mechanics ◽  
Quantum Cryptography ◽  
Short Distance ◽  
Safety Requirement

We present an identification protocol based on quantum mechanics. The first user, Alice, needs to identify herself in front of a second user, Bob, by means of a password, known only to both. The safety requirement for Alice is that somebody impersonating Bob, who only pretended to know Alice’s password, shall not be able to obtain information on the password from the exchange. This is an example of a potentially practical new application of quantum mechanics to cryptography.

Arbitration quantum signature protocol based on XOR encryption

2020 ◽  
Vol 18 (05) ◽  
pp. 2050025
Author(s):  
Xiao-Yi Zheng ◽  
Chang Kuang
Keyword(s):  
Quantum Mechanics ◽  
Quantum Information ◽  
Quantum Cryptography ◽  
Security Analysis ◽  
Quantum Signature ◽  
Ghz State ◽  
Basic Principles ◽  
Encryption Method ◽  
Design Ideas ◽  
Chain Type

Quantum signature is a branch of quantum cryptography that draws on the design ideas of classic digital signatures, and uses the basic principles of quantum mechanics to achieve the integrity, authenticity and nonrepudiation of quantum information. Among them, arbitration quantum signature (AQS) plays a very important role. In this paper, we proposed an AQS protocol based on XOR encryption. Unlike other protocols, a quantum one-time pad encryption method or chain-type CNOT encryption method is abandoned. The proposed protocol is designed based on the three-particle GHZ state combined with the idea of classical XOR encryption, with CNOT operations used to encrypt quantum messages and quantum signatures. A security analysis of the proposed protocol reveals that the proposed protocol can satisfy the AQS requirements of unforgeability and nonrepudiation.

QUANTA, CIPHERS AND COMPUTERS

COSMOS ◽  
2006 ◽  
Vol 02 (01) ◽  
pp. 1-20 ◽  
Author(s):  
ARTUR EKERT ◽  
L. C. KWEK ◽  
ANTIA LAMAS LINARES
Keyword(s):  
Information Theory ◽  
Quantum Mechanics ◽  
Quantum Information ◽  
Quantum Cryptography ◽  
Logic Gates ◽  
Quantum Information Theory ◽  
Atomic Scale ◽  
Quantum Bits ◽  
Silicon Chips ◽  
Quantum Technology

On the atomic scale, matter obeys the rules of quantum mechanics which are quite different from the classical rules that determine the properties of conventional computers. Today's advanced lithographic techniques can etch logic gates and wires less than a micron across onto the surfaces of silicon chips. Soon they will yield even smaller parts and inevitably reach a point where logic gates are so small that they are made out of only a handful of atoms. So, if computers are to become smaller in the future, new, quantum technology must replace or supplement what we have now. This article provides a grand overview of quantum information theory from the concept of quantum bits (qubits) to entanglement to quantum computation to quantum cryptography.

Sign in / Sign up

Export Citation Format

Share Document