Progress in quantum computational cryptography

Akinori Kawachi, Takeshi Koshiba

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Shor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on public-key cryptography. From the computational point of view, his algorithms illustrate that quantum computation could be more powerful. It is natural to consider that the power of quantum computation could be exploited to withstand even quantum adversaries. Over the last decade, quantum cryptography has been discussed and developed even from the computational complexity-theoretic point of view. In this paper, we will survey what has been studied in quantum computational cryptography.

Original languageEnglish
Pages (from-to)691-709
Number of pages19
JournalJournal of Universal Computer Science
Volume12
Issue number6
Publication statusPublished - 2006
Externally publishedYes

    Fingerprint

Keywords

  • Computational cryptography
  • Quantum computing
  • Quantum cryptography

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this