### Abstract

As computational approaches to classical cryptography have succeeded in the establishment of the foundation of the network security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could offer richer applications than the quantum key distribution. Our project focused especially on the quantum one-wayness and quantum public-key cryptosystems. The one-wayness of functions (or permutations) is one of the most important notions in computational cryptography. First, we give an algorithmic characterization of quantum one-way permutations. In other words, we show a necessary and sufficient condition for quantum one-way permutations in terms of reflection operators. Second, we introduce a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem. The new problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. We show that the problem has several cryptographic properties and they enable us to construct a quantum public-key cryptosystem, which is likely to withstand any attack of a quantum adversary.

Original language | English |
---|---|

Title of host publication | Quantum Computation and Information |

Subtitle of host publication | From Theory to Experiment |

Pages | 167-184 |

Number of pages | 18 |

Volume | 102 |

DOIs | |

Publication status | Published - 2006 Jun 10 |

Externally published | Yes |

### Publication series

Name | Topics in Applied Physics |
---|---|

Volume | 102 |

ISSN (Print) | 0303-4216 |

ISSN (Electronic) | 1437-0859 |

### Fingerprint

### ASJC Scopus subject areas

- Physics and Astronomy (miscellaneous)

### Cite this

*Quantum Computation and Information: From Theory to Experiment*(Vol. 102, pp. 167-184). (Topics in Applied Physics; Vol. 102). https://doi.org/10.1007/11683858_7

**Quantum computational cryptography.** / Kawachi, Akinori; Koshiba, Takeshi.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Quantum Computation and Information: From Theory to Experiment.*vol. 102, Topics in Applied Physics, vol. 102, pp. 167-184. https://doi.org/10.1007/11683858_7

}

TY - CHAP

T1 - Quantum computational cryptography

AU - Kawachi, Akinori

AU - Koshiba, Takeshi

PY - 2006/6/10

Y1 - 2006/6/10

N2 - As computational approaches to classical cryptography have succeeded in the establishment of the foundation of the network security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could offer richer applications than the quantum key distribution. Our project focused especially on the quantum one-wayness and quantum public-key cryptosystems. The one-wayness of functions (or permutations) is one of the most important notions in computational cryptography. First, we give an algorithmic characterization of quantum one-way permutations. In other words, we show a necessary and sufficient condition for quantum one-way permutations in terms of reflection operators. Second, we introduce a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem. The new problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. We show that the problem has several cryptographic properties and they enable us to construct a quantum public-key cryptosystem, which is likely to withstand any attack of a quantum adversary.

AB - As computational approaches to classical cryptography have succeeded in the establishment of the foundation of the network security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could offer richer applications than the quantum key distribution. Our project focused especially on the quantum one-wayness and quantum public-key cryptosystems. The one-wayness of functions (or permutations) is one of the most important notions in computational cryptography. First, we give an algorithmic characterization of quantum one-way permutations. In other words, we show a necessary and sufficient condition for quantum one-way permutations in terms of reflection operators. Second, we introduce a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem. The new problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. We show that the problem has several cryptographic properties and they enable us to construct a quantum public-key cryptosystem, which is likely to withstand any attack of a quantum adversary.

UR - http://www.scopus.com/inward/record.url?scp=33748795049&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748795049&partnerID=8YFLogxK

U2 - 10.1007/11683858_7

DO - 10.1007/11683858_7

M3 - Chapter

AN - SCOPUS:33748795049

SN - 3540331328

SN - 9783540331322

VL - 102

T3 - Topics in Applied Physics

SP - 167

EP - 184

BT - Quantum Computation and Information

ER -