Universal test for quantum one-way permutations

Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba*, Raymond H. Putra

*この研究の対応する著者

研究成果: Article査読

9 被引用数 (Scopus)

抄録

The next bit test was introduced by Blum and Micali and proved by Yao to be a universal test for cryptographic pseudorandom generators. On the other hand, no universal test for the cryptographic one-wayness of functions (or permutations) is known, although the existence of cryptographic pseudorandom generators is equivalent to that of cryptographic one-way functions. In the quantum computation model, Kashefi, Nishimura and Vedral gave a sufficient condition of (cryptographic) quantum one-way permutations and conjectured that the condition would be necessary. In this paper, we affirmatively settle their conjecture and complete a necessary and sufficient condition for quantum one-way permutations. The necessary and sufficient condition can be regarded as a universal test for quantum one-way permutations, since the condition is described as a collection of stepwise tests similar to the next bit test for pseudorandom generators.

本文言語English
ページ(範囲)370-385
ページ数16
ジャーナルTheoretical Computer Science
345
2-3
DOI
出版ステータスPublished - 2005 11月 22
外部発表はい

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Universal test for quantum one-way permutations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル