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.

scholarly journals Medical Image Security Using Quantum Cryptography

10.28945/4008 ◽  
2018 ◽  
Vol 15 ◽  
pp. 057-067
Author(s):  
Olufunso Dayo Alowolodu ◽  
Gabriel K Adelaja ◽  
Boniface K Alese ◽  
Olufunke Catherine Olayemi
Keyword(s):  
Quantum Mechanics ◽  
Quantum Cryptography ◽  
Communication Systems ◽  
Medical Image ◽  
Medical Information ◽  
Healthcare Providers ◽  
Daily Basis ◽  
Future Research ◽  
Security Measures ◽  
Secret Key

Aim/Purpose: Medical images are very sensitive data that can be transferred to medical laboratories, professionals, and specialist for referral cases or consultation. Strict security measures must be utilized to keep these data secured in computer networks when transferred to another party. On a daily basis, unauthorized users derive ways to gain access to sensitive patient medical information. Background: One of the best ways to which medical image could be kept secured is through the use of quantum cryptography Methodology : Applying the principles of quantum mechanics to cryptography has led to a remarkable new dimension in secured network communication infrastructure. This enables two legitimate users to produce a shared secret random bit string, which can be used as a key in cryptographic applications, such as message encryption and authentication. Contribution: This paper can make it possible for the healthcare and medical professions to construct cryptographic communication systems to keep patients’ transferred data safe and secured. Findings: This work has been able to provide a way for two authorized users who are in different locations to securely establish a secret network key and to detect if eavesdropping (a fraudulent or disruption in the network) has occurred Recommendations for Practitioners: This security mechanism is recommended for healthcare providers and practitioners to ensure the privacy of patients’ medical information. Recommendation for Researchers: This paper opens a new chapter in secured medical records Impact on Society Quantum key distribution promises network security based on the fundamental laws of quantum mechanics by solving the problems of secret-key cryptography . Future Research: The use of post-quantum cryptography can be further researched.

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.

scholarly journals Equations of quantum theory in the space of randomly joint quantum events

2019 ◽  
Vol 222 ◽  
pp. 03005
Author(s):  
Alexander Biryukov
Keyword(s):  
Quantum Mechanics ◽  
Quantum Theory ◽  
Quantum Effects ◽  
Symmetric Difference ◽  
System Transition ◽  
Additional Axiom ◽  
Random Events ◽  
Kolmogorov Axioms

The dynamics of the system in the space of random joint events is considered. The symmetric difference of events is introduced in space based on the Kolmogorov axioms. To describe quantum effects in the dynamics of the system, an additional axiom is introduced for random joint events: “the symmetric sum of random events.” In the generated space of random joint events, an equation is constructed for the probability of a system transition between two events. It is shown that for pairwise joint events it is equivalent to the equation of quantum mechanics.

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

scholarly journals A practical trojan horse for Bell-inequality-based quantum cryptography

2002 ◽  
Vol 2 (6) ◽  
pp. 434-442
Author(s):  
J. Larsson
Keyword(s):  
Quantum Cryptography ◽  
Quantum Channel ◽  
Quantum Key Distribution ◽  
Bell Inequality ◽  
Trojan Horse ◽  
Unconditional Security ◽  
Single Photons ◽  
Secret Key ◽  
Photon Polarization ◽  
At Will

Quantum Cryptography, or more accurately, Quantum Key Distribution (QKD) is based on using an unconditionally secure ``quantum channel'' to share a secret key among two users. A manufacturer of QKD devices could, intentionally or not, use a (semi-)classical channel instead of the quantum channel, which would remove the supposedly unconditional security. One example is the BB84 protocol, where the quantum channel can be implemented in polarization of single photons. Here, use of several photons instead of one to encode each bit of the key provides a similar but insecure system. For protocols based on violation of a Bell inequality (e.g., the Ekert protocol) the situation is somewhat different. While the possibility is mentioned by some authors, it is generally thought that an implementation of a (semi-)classical channel will differ significantly from that of a quantum channel. Here, a counterexample will be given using an identical physical setup as is used in photon-polarization Ekert QKD. Since the physical implementation is identical, a manufacturer may include this modification as a Trojan Horse in manufactured systems, to be activated at will by an eavesdropper. Thus, the old truth of cryptography still holds: you have to trust the manufacturer of your cryptographic device. Even when you do violate the Bell inequality.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document