Universal test for quantum one-way permutations

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

研究成果: Article

2 引用 (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, though 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 relax their sufficient condition and give a new condition that is necessary and sufficient for quantum one-way permutations. Our condition can be regarded as a universal test for quantum one-way permutations, since our condition is described as a collection of stepwise tests similar to the next bit test for pseudorandom generators.

元の言語English
ページ(範囲)839-850
ページ数12
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3153
出版物ステータスPublished - 2004
外部発表Yes

Fingerprint

Permutation
Pseudorandom Generator
Quantum computers
Similar Tests
One-way Function
Necessary
Quantum Computation
Sufficient Conditions
Sufficient
Model

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

@article{ad348930caa54a9e94c7a3c28de4e4f7,
title = "Universal test for quantum one-way permutations",
abstract = "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, though 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 relax their sufficient condition and give a new condition that is necessary and sufficient for quantum one-way permutations. Our condition can be regarded as a universal test for quantum one-way permutations, since our condition is described as a collection of stepwise tests similar to the next bit test for pseudorandom generators.",
author = "Akinori Kawachi and Hirotada Kobayashi and Takeshi Koshiba and Putra, {Raymond H.}",
year = "2004",
language = "English",
volume = "3153",
pages = "839--850",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Universal test for quantum one-way permutations

AU - Kawachi, Akinori

AU - Kobayashi, Hirotada

AU - Koshiba, Takeshi

AU - Putra, Raymond H.

PY - 2004

Y1 - 2004

N2 - 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, though 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 relax their sufficient condition and give a new condition that is necessary and sufficient for quantum one-way permutations. Our condition can be regarded as a universal test for quantum one-way permutations, since our condition is described as a collection of stepwise tests similar to the next bit test for pseudorandom generators.

AB - 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, though 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 relax their sufficient condition and give a new condition that is necessary and sufficient for quantum one-way permutations. Our condition can be regarded as a universal test for quantum one-way permutations, since our condition is described as a collection of stepwise tests similar to the next bit test for pseudorandom generators.

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

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

M3 - Article

AN - SCOPUS:27644500572

VL - 3153

SP - 839

EP - 850

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -