Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

CRYPTOGRAPHY

Published Apr 20, 2020• 0 citations
Publisher

Abstract

The goal of cryptography is to make possible for two legitimate users (Alice and Bob) to exchange a message in a way not intelligible to a third malicious party (Eve, the eavesdropper). Here, we briefly present the most relevant classical cryptosystems and then introduce the quantum key distribution by analyzing the advantage it offers in terms of security.

DOI
10.1142/9789811201554_0013

Related papers

Quantum Cryptography

Ahmed Mahmoud Abbas

Quantum cryptography is known the most up-to-date in domain of realistic cryptography notably the menace of quantum cryptanalysis which threatens security firmness of public key cryptography. Quantum cryptography has a famous scheme known as Quantum Key Exchange (QKE), that administrates generation and distribution of a secured random key between legitimate channel users depicted as sender and receiver. Consequently, such key could be used as a key for one-time pad hybrid cryptosystems to encrypt and authenticate messages over a quantum channel. (QKE) is based on unifying quantum physics concepts and information theory with conventional cryptographic schemes that target to produce a short secret session key between any two legitimate parties. An important phase in key creation of BB84 protocol is Privacy Amplification phase where two interconnecting parties distill highly secret shared key from a larger body of shared key, which is only partially secret. The two legitimate parties publicly exchange information to create a compressed key free from biased bits known by an eavesdropper.

IGI Global eBooks•Jan 1, 2018•0 citations

Quantum Cryptography

Ahmed Mahmoud Abbas

Quantum cryptography is known the most up-to-date in domain of realistic cryptography notably the menace of quantum cryptanalysis which threatens security firmness of public key cryptography. Quantum cryptography has a famous scheme known as Quantum Key Exchange (QKE), that administrates generation and distribution of a secured random key between legitimate channel users depicted as sender and receiver. Consequently, such key could be used as a key for one-time pad hybrid cryptosystems to encrypt and authenticate messages over a quantum channel. (QKE) is based on unifying quantum physics concepts and information theory with conventional cryptographic schemes that target to produce a short secret session key between any two legitimate parties. An important phase in key creation of BB84 protocol is Privacy Amplification phase where two interconnecting parties distill highly secret shared key from a larger body of shared key, which is only partially secret. The two legitimate parties publicly exchange information to create a compressed key free from biased bits known by an eavesdropper.

Advances in information security, privacy, and ethics book series•May 20, 2016•0 citations

Information security: from classical to quantum

Stephen Mark Barnett, Thomas Brougham

Quantum cryptography was designed to provide a new approach to the problem of distributing keys for private-key cryptography. The principal idea is that security can be ensured by exploiting the laws of quantum physics and, in particular, by the fact that any attempt to measure a quantum state will change it uncontrollably. This change can be detected by the legitimate users of the communication channel and so reveal to them the presence of an eavesdropper. In this paper I explain (briefly) how quantum key distribution works and some of the progress that has been made towards making this a viable technology. With the principles of quantum communication and quantum key distribution firmly established, it is perhaps time to consider how efficient it can be made. It is interesting to ask, in particular, how many bits of information might reasonably be encoded securely on each photon. The use of photons entangled in their time of arrival might make it possible to achieve data rates in excess of 10 bits per photon.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 19, 2012•1 citation

Introduction to Quantum Cryptography

Xiaoqing Tan

Broadly speaking, cryptography is the problem of doing communication or computation involving two or more parties who may not trust one another. The best known cryptographic problem is the transmission of secret messages. Suppose wish to communicate in secret. For example, you may wish to give your credit card number to a merchant in exchange for goods, hopefully without any malevolent third party intercepting your credit card number. The way this is done is to use a cryptographic protocol. The most important distinction is between private key cryptosystems and public key cryptosystems.

InTech eBooks•Jul 17, 2013•27 citations

Security and performance analyses of quantum-key-distribution systems

Chi‐Hang Fred Fung

Quantum cryptography, or, more precisely, quantum key distribution (QKD) allows two distant parties, Alice and Bob, to expand a previously shared secret key by sending quantum states through a quantum channel. The goal here is for Alice and Bob to communicate securely in the presence of an eavesdropper, Eve. The most well-known QKD protocol is the Bennett-Brassard 1984 (BB84) protocol, which has been proved unconditionally secure against any attacks allowed by quantum mechanics. The main advantage of QKD over conventional cryptography is its absolute security. Thus, it is imperative to evaluate the security and performance of QKD protocols and realistic QKD systems. In this thesis, we study the security and performance aspects of QKD in four parts. In the first part, we study the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. This protocol differs from the BB84 protocol only in the classical post-processing step and uses the same four quantum states as the BB84 protocol. We compared these two protocols and showed that in typical situations, the classical post-processing software for BB84 should be used in order to have a higher performance. In the second part, we prove the security of a three-state protocol. This protocol is similar to the BB84 protocol in that they share the same three qubit states. In the third part, we consider a practical Trojan horse attack on practical QKD systems implementing the BB84 protocol. The attack works by taking advantage of the finite response time of practical phase modulators to remap the states sent out by the legitimate user, Alice. We showed that if Alice and Bob are unaware of our attack, the final key shared between them can be compromised in some situations. In the fourth part, we consider another type of Trojan horse attack, which is based on mismatch between detection efficiencies of detectors. Practical detectors in QKD systems usually do not have identical efficiencies and an eavesdropper Eve may be able to exploit this efficiency mismatch to steal information about the final secret key. We analyze the security of the attack and show that it is possible for Eve to acquire some information on the final secret key if Alice and Bob are unaware of this attack.

•Jan 1, 2008•0 citations

Classical cryptography

Gilles Van Assche

Following its etymology, the term cryptography denotes the techniques used to ensure the confidentiality of information in its storage or transmission. Besides confidentiality, cryptography also encompasses other important functions such as authentication, signature, non-repudiation or secret sharing, to name just a few. The purpose of this section is to give a short introduction to classical cryptography, but only for areas that are relevant to quantum cryptography. For our purposes, we will only deal with confidentiality and authentication. The former is the most important function that quantum key distribution helps to achieve, while the latter is a requirement for quantum key distribution to work. Also, we will cover some topics on the security of classical cryptographic schemes so as to give some insight when comparing classical and quantum cryptography. The study of cryptography ranges from the analysis of cryptographic algorithms (or primitives ) to the design of a solution to a security problem. A cryptographic algorithm is a mathematical tool that provides a solution to a very specific problem and may be based on premises or on other primitives. A solution can be designed by combining primitives, and the requirements and functions of the primitives have to be combined properly. We will first review the confidentiality provided by ciphers that use the same key for both encryption and decryption, hence called secret-key ciphers . Then, we will discuss authentication techniques. Finally, we will show some aspects of public-key cryptography .

Cambridge University Press eBooks•Jun 29, 2006•0 citations
The goal of cryptography is to make possible for two legitimate users (Alice and Bob) to exchange a message in a way not intelligible to a third malicious party (Eve, the eavesdropper). Here, we briefly present the most relevant classical cryptosystems and then introduce the quantum key distribution by analyzing the advantage it offers in terms of security.
Quantum cryptography is known the most up-to-date in domain of realistic cryptography notably the menace of quantum cryptanalysis which threatens security firmness of public key cryptography. Quantum cryptography has a famous scheme known as Quantum Key Exchange (QKE), that administrates generation and distribution of a secured random key between legitimate channel users depicted as sender and receiver. Consequently, such key could be used as a key for one-time pad hybrid cryptosystems to encrypt and authenticate messages over a quantum channel. (QKE) is based on unifying quantum physics concepts and information theory with conventional cryptographic schemes that target to produce a short secret session key between any two legitimate parties. An important phase in key creation of BB84 protocol is Privacy Amplification phase where two interconnecting parties distill highly secret shared key from a larger body of shared key, which is only partially secret. The two legitimate parties publicly exchange information to create a compressed key free from biased bits known by an eavesdropper.
Quantum cryptography is known the most up-to-date in domain of realistic cryptography notably the menace of quantum cryptanalysis which threatens security firmness of public key cryptography. Quantum cryptography has a famous scheme known as Quantum Key Exchange (QKE), that administrates generation and distribution of a secured random key between legitimate channel users depicted as sender and receiver. Consequently, such key could be used as a key for one-time pad hybrid cryptosystems to encrypt and authenticate messages over a quantum channel. (QKE) is based on unifying quantum physics concepts and information theory with conventional cryptographic schemes that target to produce a short secret session key between any two legitimate parties. An important phase in key creation of BB84 protocol is Privacy Amplification phase where two interconnecting parties distill highly secret shared key from a larger body of shared key, which is only partially secret. The two legitimate parties publicly exchange information to create a compressed key free from biased bits known by an eavesdropper.
Quantum cryptography was designed to provide a new approach to the problem of distributing keys for private-key cryptography. The principal idea is that security can be ensured by exploiting the laws of quantum physics and, in particular, by the fact that any attempt to measure a quantum state will change it uncontrollably. This change can be detected by the legitimate users of the communication channel and so reveal to them the presence of an eavesdropper. In this paper I explain (briefly) how quantum key distribution works and some of the progress that has been made towards making this a viable technology. With the principles of quantum communication and quantum key distribution firmly established, it is perhaps time to consider how efficient it can be made. It is interesting to ask, in particular, how many bits of information might reasonably be encoded securely on each photon. The use of photons entangled in their time of arrival might make it possible to achieve data rates in excess of 10 bits per photon.
Broadly speaking, cryptography is the problem of doing communication or computation involving two or more parties who may not trust one another. The best known cryptographic problem is the transmission of secret messages. Suppose wish to communicate in secret. For example, you may wish to give your credit card number to a merchant in exchange for goods, hopefully without any malevolent third party intercepting your credit card number. The way this is done is to use a cryptographic protocol. The most important distinction is between private key cryptosystems and public key cryptosystems.
Quantum cryptography, or, more precisely, quantum key distribution (QKD) allows two distant parties, Alice and Bob, to expand a previously shared secret key by sending quantum states through a quantum channel. The goal here is for Alice and Bob to communicate securely in the presence of an eavesdropper, Eve. The most well-known QKD protocol is the Bennett-Brassard 1984 (BB84) protocol, which has been proved unconditionally secure against any attacks allowed by quantum mechanics. The main advantage of QKD over conventional cryptography is its absolute security. Thus, it is imperative to evaluate the security and performance of QKD protocols and realistic QKD systems. In this thesis, we study the security and performance aspects of QKD in four parts. In the first part, we study the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. This protocol differs from the BB84 protocol only in the classical post-processing step and uses the same four quantum states as the BB84 protocol. We compared these two protocols and showed that in typical situations, the classical post-processing software for BB84 should be used in order to have a higher performance. In the second part, we prove the security of a three-state protocol. This protocol is similar to the BB84 protocol in that they share the same three qubit states. In the third part, we consider a practical Trojan horse attack on practical QKD systems implementing the BB84 protocol. The attack works by taking advantage of the finite response time of practical phase modulators to remap the states sent out by the legitimate user, Alice. We showed that if Alice and Bob are unaware of our attack, the final key shared between them can be compromised in some situations. In the fourth part, we consider another type of Trojan horse attack, which is based on mismatch between detection efficiencies of detectors. Practical detectors in QKD systems usually do not have identical efficiencies and an eavesdropper Eve may be able to exploit this efficiency mismatch to steal information about the final secret key. We analyze the security of the attack and show that it is possible for Eve to acquire some information on the final secret key if Alice and Bob are unaware of this attack.
Following its etymology, the term cryptography denotes the techniques used to ensure the confidentiality of information in its storage or transmission. Besides confidentiality, cryptography also encompasses other important functions such as authentication, signature, non-repudiation or secret sharing, to name just a few. The purpose of this section is to give a short introduction to classical cryptography, but only for areas that are relevant to quantum cryptography. For our purposes, we will only deal with confidentiality and authentication. The former is the most important function that quantum key distribution helps to achieve, while the latter is a requirement for quantum key distribution to work. Also, we will cover some topics on the security of classical cryptographic schemes so as to give some insight when comparing classical and quantum cryptography. The study of cryptography ranges from the analysis of cryptographic algorithms (or primitives ) to the design of a solution to a security problem. A cryptographic algorithm is a mathematical tool that provides a solution to a very specific problem and may be based on premises or on other primitives. A solution can be designed by combining primitives, and the requirements and functions of the primitives have to be combined properly. We will first review the confidentiality provided by ciphers that use the same key for both encryption and decryption, hence called secret-key ciphers . Then, we will discuss authentication techniques. Finally, we will show some aspects of public-key cryptography .