Abstract
Quantum mechanics has the potential to play a major role in the future of cryptology. On the one hand, it could bring to its knees most of the current trends in contemporary cryptography. On the other hand, it offers an alternative for the protection of privacy whose security cannot be matched by classical means.
Research supported in part by Nserc, Fcar and the Canada Council.
Chapter PDF
Keywords
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.
References
Barenco, A., “Quantum physics and computers”, Contemporary Physics, Vol. 38, 1996, pp. 357–389.
Benioff, P., “Quantum mechanical Hamiltonian models of Turing machines”, Journal of Statistical Physics, Vol. 29, no. 3, 1982, pp. 515–546.
Bennett, C. H., E. Bernstein, G. Brassard and U. Vazirani, “Strengths and weaknesses of quantum computing”, SIAM Journal on Computing, to appear, 1997.
Bennett, C. H., F. Bessette, G. Brassard, L. Salvail and J. Smolin, “Experimental quantum cryptography”, Journal of Cryptology, Vol. 5, no. 1, 1992, pp. 3–28.
Berthiaume, A., “Quantum computation”, in Complexity Theory Retrospective II, L. A. Hemaspaandra and A. Selman, editors, Springer-Verlag, Berlin, to appear, 1997.
Boyer, M., G. Brassard, P. HØyer and A. Tapp, “Tight bounds on quantum searching”, Proceedings of 4th Workshop on Physics and Computation, Boston, November 1996, New England Complex Systems Institute, pp. 36–43. Available online in the InterJournal at URL http://interjournal.org. Improved version available from the authors.
Brassard, G., “A quantum jump in computer science”, in Computer Science Today, Jan van Leeuwen (Editor), Lecture Notes in Computer Science, Vol. 1000, Springer-Verlag, 1995, pp. 1–14.
Brassard, G., “The impending demise of RSA?”, RSA Laboratories CryptoBytes, Vol. 1, no. 1, 1995, pp. 1–4.
Brassard, G., “New trends in quantum computing”, Proceedings of 13th Annual Symposium on Theoretical Aspects of Computer Science, February 1996, pp. 3–10.
Brassard, G., “Searching a quantum phone book”, Science, Vol. 275, 31 January 1997, pp. 627–628.
Brassard, G. and C. Crépeau, “Cryptology column — 25 years of quantum cryptography”, Sigact News, Vol. 27, no. 3, 1996, pp. 13–24.
Brassard, G., P. HØyer and A. Tapp, “Cryptology column — Quantum cryptanalysis of hash and claw-free functions”, Sigact News, Vol. 28, no. 2, June 1997, pp. 14–19.
Deutsch, D., “Quantum theory, the Church-Turing principle and the universal quantum computer”, Proceedings of the Royal Society, London, Vol. A400, 1985, pp. 97–117.
Diffie, W. and M. E. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory, Vol. IT-22, no. 6, 1976, pp. 644–654.
Feynman, R.P., “Simulating physics with computers”, International Journal of Theoretical Physics, Vol. 21, nos. 6/7, 1982, pp. 467–488.
Feynman, R.P., “Quantum mechanical computers”, Optics News, February 1985. Reprinted in Foundations of Physics, Vol. 16, no. 6, 1986, pp. 507–531.
Grover, L.K., “A fast quantum mechanical algorithm for database search”, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 212–219. Final version to appear in Physical Review Letters under title “Quantum mechanics helps in searching for a needle in a haystack”.
Haroche, S. and J.-M. Raimond, “Quantum computing: Dream or nightmare?”, Physics Today, August 1996, pp. 51–52.
Los Alamos National Laboratory, “Quantum physics e-print archive”: for the latest papers on the implementation of quantum computation and on quantum error correction, as well as just about everything of interest for quantum computing, quantum cryptography and quantum information theory in general, surf the Web from URL http: //xxx.lanl.gov/archive/quant-ph.
Rivest, R. L., A. Shamir and L. M. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communications of the ACM, Vol. 21, no. 2, 1978, pp. 120–126.
Shor, P. W., “Algorithms for quantum computation: Discrete logarithms and factoring”, Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 124–134. Final version to appear in SIAM Journal on Computing under title “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer”.
Wiesner, S., “Conjugate coding”, Sigact News, Vol. 15, no. 1, 1983, pp. 78–88; original manuscript written circa 1970.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Brassard, G. (1997). Quantum information processing: The good, the bad and the ugly. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052246
Download citation
DOI: https://doi.org/10.1007/BFb0052246
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive