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

arXiv:quant-ph/0106043 · Algorithmica

Secrecy, Computational Loads and Rates in Practical Quantum Cryptography

Not Available Not Available, Not Available Not Available

Published Nov 6, 2002• 20 citations
arXivHTMLPDF
DOI
10.1007/s00453-002-0977-2

Related papers

Practical Quantum Cryptography: Secrecy Capacity and Privacy Amplification

F. Javier Thayer, Michael Hamrick, Gerald N. Gilbert

Optical science and engineering•Nov 14, 2005•0 citations

Practical Quantum Cryptography : A Comprehensive Analysis, 1

Gerald N. Gilbert, Michael Hamrick

We perform a comprehensive analysis of practical quantum cryptography (QC) systems implemented in actual physical environments via either free-space or fiber-optic cable quantum channels for ground-ground, ground-satellite, air-satellite and satellite-satellite links. (1) We obtain the complete universal expressions for the effective secrecy capacity and rate for QC systems taking into account the most general attacks on individual quantum bits, including explicit closed-form expressions for the necessary and sufficient amount of privacy amplification. Our analysis also includes the explicit calculation in detail of the total cost in bits of continuous authentication, thereby obtaining new results for actual ciphers of finite length. (2) We perform for the first time a detailed, explicit analysis of all systems losses due to propagation, errors, noise, etc. as appropriate to both optical fiber cable- and satellite communications-based implementations of QC. (3) We calculate for the first time all system load costs associated to classical communication and computational constraints that are ancillary to, but essential for carrying out, the pure QC protocol itself. (4) We introduce an extended family of generalizations of the Bennett-Brassard (BB84) QC protocol that equally provide unconditional secrecy but allow for the possibility of optimizing throughput rates against specific cryptanalytic attacks. (5) We obtain universal predictions for maximal rates that can be achieved with practical system designs under realistic environmental conditions. (6) We propose a specific QC system design that includes the use of a novel method of high-speed photon detection that may be able to achieve very high throughput rates for actual implementations in realistic environments.

•Sep 7, 2000•5 citations

Quantum computation and cryptography: an overview

Manuel Calixto

Natural Computing•Aug 14, 2008•10 citations

Practical Quantum Cryptography: A Comprehensive Analysis (Part One)

Gerald N. Gilbert, Michael Hamrick

We perform a comprehensive analysis of practical quantum cryptography (QC) systems implemented in actual physical environments via either free-space or fiber-optic cable quantum channels for ground-ground, ground-satellite, air-satellite and satellite-satellite links. (1) We obtain universal expressions for the effective secrecy capacity and rate for QC systems taking into account three important attacks on individual quantum bits, including explicit closed-form expressions for the requisite amount of privacy amplification. Our analysis also includes the explicit calculation in detail of the total cost in bits of continuous authentication, thereby obtaining new results for actual ciphers of finite length. (2) We perform for the first time a detailed, explicit analysis of all systems losses due to propagation, errors, noise, etc. as appropriate to both optical fiber cable- and satellite communications-based implementations of QC. (3) We calculate for the first time all system load costs associated to classical communication and computational constraints that are ancillary to, but essential for carrying out, the pure QC protocol itself. (4) We introduce an extended family of generalizations of the Bennett-Brassard (BB84) QC protocol that equally provide unconditional secrecy but allow for the possibility of optimizing throughput rates against specific cryptanalytic attacks. (5) We obtain universal predictions for maximal rates that can be achieved with practical system designs under realistic environmental conditions. (6) We propose a specific QC system design that includes the use of a novel method of high-speed photon detection that may be able to achieve very high throughput rates for actual implementations in realistic environments.

arXiv:quant-ph/0009027•Sep 7, 2000•86 citations

NIST-Post Quantum Cryptography Algorithm Optimization and Scarcity

Aastha Sharma, Ayushi Prakash, Ashish Dixit +2 more

In 2022-2027 NIST science and technology organization of quantum cryptography that estimates the challenges in computing and optimizing the data filtration in the form qubit scalability. This has been the challenging in the hardware and loading the classical data in the form of qubits to make the platform flexible and high computation rates in executing or loading the code. In the scenarios of the quantum cryptographic algorithm and the data scarcity in computing and load the data. The main issue in implementing the data is in the data synchronization and the complexity of computation. In this technique to enhance the flexibility and the scalability in computing the classical data by using the machine learning algorithm i.e. QNN (quantum neural network) and Shor’s & Grover’s algorithm etc. this process can lead you to be the data integration and the data categorization in the form of qubits. This paper computes the data with the help of quantum algorithm and make the strategical analysis in the making the architectural framework. This paper shows the quantum algorithmic architectural framework analysis approach to finds the data scarcity and the optimization of the data computing in data-set. The aim is to find the classical survey analysis on quantum cryptography issues estimates to find the flexibility and quantum analysis of qubits.

International Conference on Computing, Communication and Automation•Nov 28, 2025•1 citation

Security Aspects of Practical Quantum Cryptography

Gilles Brassard, Norbert Lütkenhaus, Tal Mor +1 more

Lecture notes in computer science•Jan 1, 2000•35 citations
We perform a comprehensive analysis of practical quantum cryptography (QC) systems implemented in actual physical environments via either free-space or fiber-optic cable quantum channels for ground-ground, ground-satellite, air-satellite and satellite-satellite links. (1) We obtain the complete universal expressions for the effective secrecy capacity and rate for QC systems taking into account the most general attacks on individual quantum bits, including explicit closed-form expressions for the necessary and sufficient amount of privacy amplification. Our analysis also includes the explicit calculation in detail of the total cost in bits of continuous authentication, thereby obtaining new results for actual ciphers of finite length. (2) We perform for the first time a detailed, explicit analysis of all systems losses due to propagation, errors, noise, etc. as appropriate to both optical fiber cable- and satellite communications-based implementations of QC. (3) We calculate for the first time all system load costs associated to classical communication and computational constraints that are ancillary to, but essential for carrying out, the pure QC protocol itself. (4) We introduce an extended family of generalizations of the Bennett-Brassard (BB84) QC protocol that equally provide unconditional secrecy but allow for the possibility of optimizing throughput rates against specific cryptanalytic attacks. (5) We obtain universal predictions for maximal rates that can be achieved with practical system designs under realistic environmental conditions. (6) We propose a specific QC system design that includes the use of a novel method of high-speed photon detection that may be able to achieve very high throughput rates for actual implementations in realistic environments.
We perform a comprehensive analysis of practical quantum cryptography (QC) systems implemented in actual physical environments via either free-space or fiber-optic cable quantum channels for ground-ground, ground-satellite, air-satellite and satellite-satellite links. (1) We obtain universal expressions for the effective secrecy capacity and rate for QC systems taking into account three important attacks on individual quantum bits, including explicit closed-form expressions for the requisite amount of privacy amplification. Our analysis also includes the explicit calculation in detail of the total cost in bits of continuous authentication, thereby obtaining new results for actual ciphers of finite length. (2) We perform for the first time a detailed, explicit analysis of all systems losses due to propagation, errors, noise, etc. as appropriate to both optical fiber cable- and satellite communications-based implementations of QC. (3) We calculate for the first time all system load costs associated to classical communication and computational constraints that are ancillary to, but essential for carrying out, the pure QC protocol itself. (4) We introduce an extended family of generalizations of the Bennett-Brassard (BB84) QC protocol that equally provide unconditional secrecy but allow for the possibility of optimizing throughput rates against specific cryptanalytic attacks. (5) We obtain universal predictions for maximal rates that can be achieved with practical system designs under realistic environmental conditions. (6) We propose a specific QC system design that includes the use of a novel method of high-speed photon detection that may be able to achieve very high throughput rates for actual implementations in realistic environments.
In 2022-2027 NIST science and technology organization of quantum cryptography that estimates the challenges in computing and optimizing the data filtration in the form qubit scalability. This has been the challenging in the hardware and loading the classical data in the form of qubits to make the platform flexible and high computation rates in executing or loading the code. In the scenarios of the quantum cryptographic algorithm and the data scarcity in computing and load the data. The main issue in implementing the data is in the data synchronization and the complexity of computation. In this technique to enhance the flexibility and the scalability in computing the classical data by using the machine learning algorithm i.e. QNN (quantum neural network) and Shor’s & Grover’s algorithm etc. this process can lead you to be the data integration and the data categorization in the form of qubits. This paper computes the data with the help of quantum algorithm and make the strategical analysis in the making the architectural framework. This paper shows the quantum algorithmic architectural framework analysis approach to finds the data scarcity and the optimization of the data computing in data-set. The aim is to find the classical survey analysis on quantum cryptography issues estimates to find the flexibility and quantum analysis of qubits.