共 50 条
New combinatorial complete one-way functions
被引:0
|作者:
Kojevnikov, Arist
[1
]
Nikolenko, Sergey I.
[1
]
机构:
[1] VA Steklov Math Inst, St Petersburg Dept, St Petersburg 191023, Russia
来源:
关键词:
cryptography;
complete problem;
one-way function;
D O I:
暂无
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post Correspondence Problem and prove their completeness. Besides, we present an alternative proof of Levin's result. We also discuss the properties a combinatorial problem should have in order to hold a complete one-way function.
引用
收藏
页码:457 / 466
页数:10
相关论文