Universal Test for Quantum One-Way Permutations

Details Universal Test for Quantum One-Way Permutations Universal Test for Quantum One-Way Permutations

2004-01-05

arxiv.org/abs/quant-ph/0401013v3

Physics

Quantum Physics

12 pages, 3 figures. The previous version included some error. This is a corrected version. Fortunately, the proof is simplifi

Scientific paper

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 affirmatively settle their conjecture and complete a necessary and sufficient 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.

Affiliated with

Also associated with

No associations

Rating

Universal Test for Quantum One-Way Permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal Test for Quantum One-Way Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Test for Quantum One-Way Permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-288419