Paper Info
Title
Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC
Abstract
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.
Year
DOI
Venue
1998
10.1007/3-540-49649-1_19
ASIACRYPT
Keywords
Field
DocType
algebraic terminology,weak invertibility,finite automata,weakly invertible finite automaton,public key cryptosystem,weak invertibiity
Discrete mathematics,Algebraic number,Computer science,Public key cryptosystem,Cryptanalysis,Theoretical computer science,Encryption,Finite-state machine,Invertible matrix
Conference
Volume
ISSN
ISBN
1514
0302-9743
3-540-65109-8
Citations 
PageRank 
References 
4
0.57
6
Authors
3
Name
Order
Citations
PageRank
Zong-duo Dai120325.53
Dingfeng Ye2547.67
Kwok-Yan Lam344069.66