Characterizing the existence of one-way permutations

被引：9
|
作者：
Hemaspaandra, LA
Rothe, J
机构：
[1] Univ Rochester, Dept Comp Sci, Rochester, NY 14627 USA
[2] Univ Jena, Inst Informat, D-07740 Jena, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2000年 / 244卷 / 1-2期
关键词：
one-way permutations; one-way functions; ranking; worst-case cryptography; computational complexity;
D O I：
10.1016/S0304-3975(00)00014-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We establish a condition necessary and sufficient for the existence of one-way permutations: One-way permutations exist if and only if there exist total one-one one-way functions whose range is P-rankable. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：257 / 261
页数：5
相关论文
共 50 条
12345