Progress in Quantum Computational Cryptography

dc.creatorKawachi,Akinori
dc.creatorKoshiba,Takeshi
dc.date2006
dc.date.accessioned2024-02-06T12:54:25Z
dc.date.available2024-02-06T12:54:25Z
dc.descriptionShor's algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey 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.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-012-06-0691
dc.identifierhttps://lib.jucs.org/article/28626/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9039
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 12(6): 691-709
dc.subjectcomputational cryptography
dc.subjectquantum computing
dc.subjectquantum cryptography
dc.titleProgress in Quantum Computational Cryptography
dc.typeResearch Article
Файлы