dorsal/arxiv
View SchemaUniversal Test for Quantum One-Way Permutations
| Authors | Akinori Kawachi, Hirotada Kobayashi, Takeshi Koshiba, Rudy Raymond H. Putra |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0401013 |
| URL | https://arxiv.org/abs/quant-ph/0401013 |
| DOI | 10.1016/j.tcs.2005.07.036 |
| Journal | Theoretical Computer Science 345(2-3):370-385 (2005) |
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 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.
{
"annotation_id": "9a479e79-32ea-49a8-a1fe-84a5bc5936ae",
"date_created": "2026-03-02T18:02:03.311000Z",
"date_modified": "2026-03-02T18:02:03.311000Z",
"file_hash": "65f1a9f370704dca008323ce3fbd71a3cc4629bdd06aff1f38bcf6533b6ea8ce",
"private": false,
"record": {
"abstract": "The next bit test was introduced by Blum and Micali and proved by Yao to be a\nuniversal test for cryptographic pseudorandom generators. On the other hand, no\nuniversal test for the cryptographic one-wayness of functions (or permutations)\nis known, though the existence of cryptographic pseudorandom generators is\nequivalent to that of cryptographic one-way functions. In the quantum\ncomputation model, Kashefi, Nishimura and Vedral gave a sufficient condition of\n(cryptographic) quantum one-way permutations and conjectured that the condition\nwould be necessary. In this paper, we affirmatively settle their conjecture and\ncomplete a necessary and sufficient for quantum one-way permutations. The\nnecessary and sufficient condition can be regarded as a universal test for\nquantum one-way permutations, since the condition is described as a collection\nof stepwise tests similar to the next bit test for pseudorandom generators.",
"arxiv_id": "quant-ph/0401013",
"authors": [
"Akinori Kawachi",
"Hirotada Kobayashi",
"Takeshi Koshiba",
"Rudy Raymond H. Putra"
],
"categories": [
"quant-ph"
],
"doi": "10.1016/j.tcs.2005.07.036",
"journal_ref": "Theoretical Computer Science 345(2-3):370-385 (2005)",
"title": "Universal Test for Quantum One-Way Permutations",
"url": "https://arxiv.org/abs/quant-ph/0401013"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "5d0b2ea7-71e1-4353-a717-d405c5544b41",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}