Related papers: Quantum Cryptography
Comment on M. Kataoka et al., Phys. Rev. Lett. 83, 160 (1999).
We present an in-place implementation of the cryptographic permutation \textbf{Gimli}, a NIST round 2 candidate for lightweight cryptography, and provide an upper bound for the required quantum resource in depth and gate-counts. In…
This paper has been withdrawn.
We show an eavesdropping scheme, by which the eavesdropper can achieve the full information of the key against the protocol [Kye et al., PRL 95 040501 (2005)] with a probability of unity and will not be discovered by the the legitimate…
This essay is a response to the (March 2000) Physics Today Opinion article "Quantum Theory Needs No Interpretation" by Fuchs and Peres. It was written several years ago and has been collecting electronic dust ever since Physics Today said…
Short review article on quantum information processing accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also http://www.wkap.nl/series.htm/ENM
Instead of writing a review article on the state of the field, I'm going to instead write a retrospective from the year 2040. I'll tell you how this whole "quantum computing thing" turned out.
We present some informal remarks on aspects of relativistic quantum computing.
This paper has been withdrawn by the author(s), due to some technical problem.
This paper has been withdrawn by the author.
In this survey we propose to cover the prose of post-quantum cryptography over classical cryptography. We talk about the various cryptographic methods that are being practiced to safeguard our information. The future of secure communication…
Quantum computer is no longer a hypothetical idea. It is the worlds most important technology and there is a race among countries to get supremacy in quantum technology. Its the technology that will reduce the computing time from years to…
We present an alternative frequencists' proof of the quantum probability rule which does not make use of the frequency operator, with expectation that this can circumvent the recent criticism against the previous proofs which use it. We…
This paper devises a simple quantum bit commitment protocol that is just as easy to implement as any existing practical quantum bit commitment protocols but will be more secure. It will be infinitely close to being unconditionally fully…
This paper has been withdrawn by the author.
Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have…
Quantum cryptography is arguably the fastest growing area in quantum information science. Novel theoretical protocols are designed on a regular basis, security proofs are constantly improving, and experiments are gradually moving from…
In this paper we review and comment on "A novel protocol-authentication algorithm ruling out a man-in-the-middle attack in quantum cryptography", [M. Peev et al., Int. J. Quant. Inform., 3, 225, (2005)]. In particular, we point out that the…
Quantum secret sharing (QSS) schemes without entanglement have huge advantages in scalability and are easier to realize as they only require sequential communications of a single quantum system. However, these schemes often come with…
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use…