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

Kluwer Academic Publishers eBooks

Quantum Versus Classical Noise Cryptography

Horace P. Yuen

Published Dec 19, 2005• 4 citations
Publisher

Abstract

A new quantum cryptographic scheme is introduced that, in contrast to previous ones, can be amplified and regenerated similar to classical noise-based cryptosystems. The essentially classical reasons for the success of various known quantum cryptosystems are indicated. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI
10.1007/0-306-47097-7_54

Related papers

A Survey on Quantum cryptography versus classical Cryptography

Praveer Dubey, Ompal Yadav

Quantum Cryptography is an approach to securing communications by applying the phenomena of quantum physics. Unlike traditional classical cryptography, which uses mathematical techniques to restrict eavesdroppers, quantum cryptography is focused on the physics of information. The development of quantum cryptography was motivated by the short-comings of classical cryptographic methods, which can be classified as either public-key or secret-key Methods. There are classical solutions to insecure communication all rely on making some or assumption, about the computational power of a cheater, about the number of cheaters, or something of this kind. Based on quantum key distribution, one might hope that a quantum computer might allow us to weaken or remove these assumptions.

International Journal of Current Engineering and Technology•Oct 31, 2021•3 citations

A New Approach to Quantum Computation

Horace P. Yuen

A general quantum machine is characterized to capture all the possible physical structures that may be employed for effective or efficient computation. As an illustration, a specific machine is described for the permanent evaluation problem. The contrast between quantum and classical parallelism is also discussed, as is the effect of quantum error correction against decoherence and loss. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•3 citations

QUANTUM CRYPTOGRAPHY: A NOVEL APPROACH TO COMMUNICATION SECURITY

A. Porzio

Quantum Cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel, like when we buy something on the web, a sophisticated protocol protects our privacy making our data unintelligible to unauthorised receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceeds the available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realise provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations, for realising protocols whose security is intrinsic. In this contribution, after a brief historical introduction, we aim to provide a survey on the physical principles underlying the quantum approach to cryptography. Then, in the second part, we analyse in more detail two of the possible protocols and glance over the state of art of the research in the field.

WORLD SCIENTIFIC eBooks•Oct 10, 2013•0 citations

Principles

David Wick

What are the principles of quantum mechanics? Since 1925, proponents of various interpretations have championed theirs, while doubters have searched for new ones. Principles, therefore, are important — but what do we mean by a “principle” when talking about a scientific theory? These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Boston eBooks•Jan 1, 1995•0 citations

*Quantum-Secure Cryptography

Jonathan I. Katz, Yehuda Lindell

So far in this book (cf. Section 3.1.2 ), we have equated the notion of “efficient adversaries” with adversarial algorithms running in (probabilistic) polynomial-time on a classical computer . Thus, when evaluating the security of our schemes we only considered efficient classical attacks. We did not, however, consider the potential impact of quantum computers —that is, computers that rely in an essential way on the principles of quantum mechanics. As we will see here, quantum algorithms can in some cases be faster than classical algorithms—possibly much faster—and thus quantum computers can have a dramatic impact on the security of cryptosystems.

Chapman & Hall/CRC eBooks•May 14, 2025•0 citations

Amplitude Soliton Squeezing Using an Asymmetric Sagnac Fiber Loop

Dmitriy Krylov, K. Bergman

We experimentally demonstrate a new scheme for generating amplitude squeezed solitons in an asymmetric fiber Sagnac loop. We measure by direct detection a 5.7±0.1 dB (73%) and, with corrections for linear losses 6.2±0.1 dB (76%), reduction in the photon number fluctuations below the shot noise level. The same scheme is also shown to generate a significant classical noise reduction and is limited by Raman effects in fiber. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•1 citation
A new quantum cryptographic scheme is introduced that, in contrast to previous ones, can be amplified and regenerated similar to classical noise-based cryptosystems. The essentially classical reasons for the success of various known quantum cryptosystems are indicated. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Quantum Cryptography is an approach to securing communications by applying the phenomena of quantum physics. Unlike traditional classical cryptography, which uses mathematical techniques to restrict eavesdroppers, quantum cryptography is focused on the physics of information. The development of quantum cryptography was motivated by the short-comings of classical cryptographic methods, which can be classified as either public-key or secret-key Methods. There are classical solutions to insecure communication all rely on making some or assumption, about the computational power of a cheater, about the number of cheaters, or something of this kind. Based on quantum key distribution, one might hope that a quantum computer might allow us to weaken or remove these assumptions.
A general quantum machine is characterized to capture all the possible physical structures that may be employed for effective or efficient computation. As an illustration, a specific machine is described for the permanent evaluation problem. The contrast between quantum and classical parallelism is also discussed, as is the effect of quantum error correction against decoherence and loss. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Quantum Cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel, like when we buy something on the web, a sophisticated protocol protects our privacy making our data unintelligible to unauthorised receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceeds the available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realise provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations, for realising protocols whose security is intrinsic. In this contribution, after a brief historical introduction, we aim to provide a survey on the physical principles underlying the quantum approach to cryptography. Then, in the second part, we analyse in more detail two of the possible protocols and glance over the state of art of the research in the field.
So far in this book (cf. Section 3.1.2 ), we have equated the notion of “efficient adversaries” with adversarial algorithms running in (probabilistic) polynomial-time on a classical computer . Thus, when evaluating the security of our schemes we only considered efficient classical attacks. We did not, however, consider the potential impact of quantum computers —that is, computers that rely in an essential way on the principles of quantum mechanics. As we will see here, quantum algorithms can in some cases be faster than classical algorithms—possibly much faster—and thus quantum computers can have a dramatic impact on the security of cryptosystems.
We experimentally demonstrate a new scheme for generating amplitude squeezed solitons in an asymmetric fiber Sagnac loop. We measure by direct detection a 5.7±0.1 dB (73%) and, with corrections for linear losses 6.2±0.1 dB (76%), reduction in the photon number fluctuations below the shot noise level. The same scheme is also shown to generate a significant classical noise reduction and is limited by Raman effects in fiber. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.