scholarly journals High-dimensional entanglement-enabled holography for quantum encryption

2021 ◽  
Author(s):  
Ling-Jun Kong ◽  
Furong Zhang ◽  
Jingfeng Zhang ◽  
Yifan Sun ◽  
Xiangdong Zhang
Keyword(s):  
Information Security ◽  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Quantum Algorithms ◽  
Key Distribution ◽  
High Dimensional ◽  
Entangled State ◽  
Quantum Computers ◽  
Transmission Of Information ◽  
Quantum Encryption

Abstract Cryptography plays an important role in information security, which is widely applied in the various fields of society. Quantum cryptography has shown its great advantages in information security compared with the classical one. Two major directions of quantum cryptography are quantum key distribution (QKD) and quantum encryption, with the former focusing on secure key distribution and the latter focusing on encryption using quantum algorithms. In contrast to the well accepted success of the QKD, the development of quantum encryption is rather limited because of the difficulties of building up algorithms and the constructing the practical quantum computers. Here we propose a new scheme of quantum encryption based on high-dimensional entanglement holography. Firstly, we experimentally realize the quantum holography based on the high-dimensional orbital angular momentum (OAM) entanglement. Then, OAM-selective holographic scheme for quantum encryption is proposed and demonstrated. Our results show that introducing quantum entangled state into OAM holography makes the OAM holography possess infinite information channels and the transmission of information be absolute security in principle. Furthermore, decryption in the presence of strong noise is achieved. Our work opens up a new way to realize quantum information security.

scholarly journals A quantum encryption design featuring confusion, diffusion, and mode of operation

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Zixuan Hu ◽  
Sabre Kais
Keyword(s):  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Block Cipher ◽  
Quantum Information Processing ◽  
Quantum Algorithms ◽  
Key Distribution ◽  
Mode Of Operation ◽  
Encryption Algorithms ◽  
Communication Needs ◽  
Quantum Encryption

AbstractQuantum cryptography—the application of quantum information processing and quantum computing techniques to cryptography has been extensively investigated. Two major directions of quantum cryptography are quantum key distribution (QKD) and quantum encryption, with the former focusing on secure key distribution and the latter focusing on encryption using quantum algorithms. In contrast to the success of the QKD, the development of quantum encryption algorithms is limited to designs of mostly one-time pads (OTP) that are unsuitable for most communication needs. In this work we propose a non-OTP quantum encryption design utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features: 1. complex key-ciphertext relation (i.e. confusion) and complex plaintext-ciphertext relation (i.e. diffusion); 2. mode of operation design for practical encryption on multiple blocks. These features provide key reusability and protection against eavesdropping and standard cryptanalytic attacks.

Introduction of Quantum Cryptography

2013 ◽  
Vol 275-277 ◽  
pp. 2511-2514
Author(s):  
Xiao Qiang Guo ◽  
Yan Yan ◽  
Li Chao Feng ◽  
Shi Qiu Zheng
Keyword(s):  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Entangled State ◽  
Quantum Mechanical ◽  
Long Distance ◽  
Storage Model ◽  
Post Quantum Cryptography

Quantum cryptography is the use of quantum existence state as the key of information encrption and decryption, the principle is the Einstein called "mysterious long distance activities" quantum entangled state. It is a quantum mechanical phenomenon, regardless of the distance between the two particles far, a particle changes will affect another particle, compared with the traditional password technology has a higher level of security. Quantum cryptography is a research hotspot of international academia in recent years. We introduce quantum key distribution, quantum commitment, bounded quantum storage model, position based quantum cryptography and post-quantum cryptography.

scholarly journals Numerical finite-key analysis of quantum key distribution

2020 ◽  
Vol 6 (1) ◽  
Author(s):  
Darius Bunandar ◽  
Luke C. G. Govia ◽  
Hari Krovi ◽  
Dirk Englund
Keyword(s):  
Finite Number ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Numerical Approach ◽  
Asymptotic Formulas ◽  
Quantum Computers ◽  
Secure Communications ◽  
Quantum Relative Entropy ◽  
Asymptotic Equipartition Property ◽  
Optimization Solvers

AbstractQuantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many QKD experiments, however, predict their achievable key rates using asymptotic formulas, which assume the transmission of an infinite number of signals, partly because QKD proofs with finite transmissions (and finite-key lengths) can be difficult. Here we develop a robust numerical approach for calculating the key rates for QKD protocols in the finite-key regime in terms of two semi-definite programs (SDPs). The first uses the relation between conditional smooth min-entropy and quantum relative entropy through the quantum asymptotic equipartition property, and the second uses the relation between the smooth min-entropy and quantum fidelity. The numerical programs are formulated under the assumption of collective attacks from the eavesdropper and can be promoted to withstand coherent attacks using the postselection technique. We then solve these SDPs using convex optimization solvers and obtain numerical calculations of finite-key rates for several protocols difficult to analyze analytically, such as BB84 with unequal detector efficiencies, B92, and twin-field QKD. Our numerical approach democratizes the composable security proofs for QKD protocols where the derived keys can be used as an input to another cryptosystem.

Quantum cryptography: Theoretical protocols for quantum key distribution and tests of selected commercial QKD systems in commercial fiber networks

2016 ◽  
Vol 14 (02) ◽  
pp. 1630002
Author(s):  
Monika Jacak ◽  
Janusz Jacak ◽  
Piotr Jóźwiak ◽  
Ireneusz Jóźwiak
Keyword(s):  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Current Status ◽  
Entangled Photons ◽  
Fiber Networks ◽  
System Improvement ◽  
Metropolitan Networks

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.

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
Keyword(s):  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Key Exchange ◽  
Authentication Scheme ◽  
Entangled Photons ◽  
Key Exchange Protocol

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.

ERROR-REJECTING BENNETT–BRASSARD–MERMIN QUANTUM KEY DISTRIBUTION PROTOCOL BASED ON LINEAR OPTICS OVER A COLLECTIVE-NOISE CHANNEL

2010 ◽  
Vol 08 (07) ◽  
pp. 1141-1151 ◽  
Author(s):  
XI-HAN LI ◽  
XIAO-JIAO DUAN ◽  
FU-GUO DENG ◽  
HONG-YU ZHOU
Keyword(s):  
Quantum Entanglement ◽  
Quantum Key Distribution ◽  
Quantum Information Processing ◽  
Key Distribution ◽  
Entangled State ◽  
Collective Noise ◽  
Linear Optics ◽  
Entanglement Purification ◽  
Measurement Results ◽  
Entangled Quantum States

Quantum entanglement is an important element of quantum information processing. Sharing entangled quantum states between two remote parties is a precondition of most quantum communication schemes. We will show that the protocol proposed by Yamamoto et al. (Phys. Rev. Lett.95 (2005) 040503) for transmitting single quantum qubit against collective noise with linear optics is also suitable for distributing the components of entanglements with some modifications. An additional qubit is introduced to reduce the effect of collective noise, and the receiver can take advantage of the time discrimination and the measurement results of the assistant qubit to reconstruct a pure entanglement with the sender. Although the scheme succeeds probabilistically, the fidelity of the entangled state is almost unity in principle. The resource used in our protocol to get a pure entangled state is finite, which establishes entanglement more easily in practice than quantum entanglement purification. Also, we discuss its application in quantum key distribution over a collective channel in detail.

scholarly journals Detector-decoy high-dimensional quantum key distribution

2016 ◽  
Vol 24 (19) ◽  
pp. 22159 ◽  
Author(s):  
Haize Bao ◽  
Wansu Bao ◽  
Yang Wang ◽  
Ruike Chen ◽  
Chun Zhou ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
High Dimensional

Quantum cryptography

2009 ◽  
Author(s):  
Stephen Barnett
Keyword(s):  
Quantum Information ◽  
Quantum Cryptography ◽  
Quantum Key Distribution ◽  
Communication Systems ◽  
Information Technologies ◽  
Key Distribution ◽  
Julius Caesar ◽  
Secure Communications ◽  
Quantum Communications ◽  
History Of

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.

Sign in / Sign up

Export Citation Format

Share Document