• Universal test for quantum one...

Treffer: Universal test for quantum one-way permutations

Title:
Universal test for quantum one-way permutations
Authors:
KAWACHI, Akinori, KOBAYASHI, Hirotada, KOSHIBA, Takeshi, PUTRA, Raymond H
Source:
Mathematical foundations of computer science 2004Theoretical computer science. 345(2-3):370-385
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Algèbre, Algebra, Théorie des nombres, Number theory, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Probabilités et statistiques numériques, Numerical methods in probability and statistics, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Calcul quantique, Quantum computation, Calculo cuántico, Condition nécessaire suffisante, Necessary and sufficient condition, Condición necesaria suficiente, Cryptographie, Cryptography, Criptografía, Générateur nombre aléatoire, Random number generators, Informatique théorique, Computer theory, Informática teórica, Existence, Fonction 1 critère, One way function, Générateur pseudoaléatoire, Modèle calcul, Permutation 1 critère, One way permutation, test universel, Universal test, Computational cryptography, One-way function, One-way permutation
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan
Quantum Computation and Information Project, Exploratory Research for Advanced Technology, Japan Science and Technology Agency, 5-28-3 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan
Secure Computing Laboratory, Fujitsu Laboratories Ltd., 4-1-1 Kamikodanaka, Nakahara-ku, Kawasaki 211-8588, Japan
Quantum Computation and Information Project, Exploratory Research for Advanced Technology, Japan Science and Technology Agency, Matsuo Bldg. 2F, 406 Iseyacho, Kawaramachi Marutamachi, Kamigyo-ku, Kyoto 602-0873, Japan
Graditate School of Informatics, Kyoto University, Yoshida-Honachi, Sakyo-ku, Kyoto 606-8501, Japan
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17296165
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics

Telecommunications and information theory
Accession Number:
edscal.17296165
Database:
PASCAL Archive

Weitere Informationen

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.