Security Notions for Quantum Public-Key Cryptography

Simple item page
dc.creatorKoshiba, Takeshi
dc.date2007-02-19
dc.date.accessioned2026-07-07T07:47:38Z
dc.date.available2026-07-07T07:47:38Z
dc.descriptionIt is well known that Shor's quantum algorithm for integer factorization can break down the RSA public-key cryptosystem, which is widely used in many cryptographic applications. Thus, public-key cryptosystems in the quantum computational setting are longed for cryptology. In order to define the security notions of public-key cryptosystems, we have to model the power of the sender, receiver, adversary and channel. While we may consider a setting where quantum computers are available only to adversaries, we generally discuss what are the right security notions for (quantum) public-key cryptosystems in the quantum computational setting. Moreover, we consider the security of quantum public-key cryptosystems known so far.
dc.identifierhttps://arxiv.org/abs/quant-ph/0702183
dc.identifierhttp://arxiv.org/abs/quant-ph/0702183
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124236
dc.subjectQuantum Physics
dc.titleSecurity Notions for Quantum Public-Key Cryptography
dc.typetext

Files

Collections

arXiv