Weak invertibility of finite automata and cryptanalysis on FAPKC

被引：0
|
作者：
Dai, ZD [1 ]
Ye, DF
Lam, KY
机构：
[1] Acad Sinica, Grad Sch, Dept Math, State Key Lab Informat Secur, Beijing 10003908, Peoples R China
[2] Natl Univ Singapore, Dept Informat Syst & Comp Sci, Singapore 119260, Singapore
来源：
ADVANCES IN CRYPTOLOGY - ASIACRYPT'98 | 1998年 / 1514卷
关键词：
finite automaton; public key cryptosystem; cryptanalysis;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
FAPKC [17, 18, 19, 20, 22] is a public key cryptosystem based weakly invertible finite automata. Weak invertibility of FAs is the key to understand and analyze this scheme. In this paper a set of algebraic terminologies describing FAs is developed, and the theory of weak invertibility of FAs is studied. Based on this, a cryptanalysis on FAPKC is made. It is shown that the keys proposed in [17, 18, 19, 20, 21] for FAPKCs are insecure both in encrypting and in signing.
引用
收藏
页码：227 / 241
页数：15
相关论文
共 50 条
12345