Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC

@inproceedings{Dai1998WeakIO,
  title={Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC},
  author={Zongduo Dai and Dingfeng Ye and Kwok-Yan Lam},
  booktitle={ASIACRYPT},
  year={1998}
}
FAPKC [17, 18, 19, 20, 22] is a public key cryptosystem based weakly invertible nite 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. 

From This Paper

Topics from this paper.
5 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The Invertibility Theory and Application of Quadratic Finite Automata, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing

  • X. M. Chen
  • 1996
Highly Influential
18 Excerpts

FAPKC3: a new nite automaton public key cryptosystem, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing

  • R. J. Tao, S. H. Chen, X. M. Chen
  • 1995
Highly Influential
18 Excerpts

Weak Invertibility of Linear Finite Automata I, Classi cation and Enumeration of Transfer Functions, SCIENCE

  • Z. D. Dai, D. F. Ye
  • IN CHINA (Series A),
  • 1996
2 Excerpts

Weak Invertibility of Linear Finite Automata over Commutative Rings {Classi cation and Enumeration (in Chinese)

  • Z. D. Dai, D. F. Ye
  • KEXUE TONGBAO(Bulletin of Science),
  • 1995
2 Excerpts

Cryptanalysis on a Finite Automaton Public Key Cryptosystem

  • K. Dai D.W. Wu, H. G. Zhang
  • Science in China,
  • 1994
2 Excerpts

Finite Automata: a layman approach, text posted in sci,cript newsgroup, October 1994, Juhanihe@waltari.helsinki

  • Juhani Heino
  • University of Helsinki,
  • 1994
1 Excerpt

Some Connections between Scramblers and Invertible Automata

  • X. Lai, J. L. Massey
  • Proc. 1988 Beijing Int. Workshop on Info.Th.,
  • 1988
1 Excerpt

Algebra and Coding Theory (in Chinese)

  • Z. X. Wan
  • Weak Invertibility of Finite Automata and…
  • 1979

Similar Papers

Loading similar papers…