›› 2008, Vol. 23 ›› Issue (1): 1-.

• Preface •     Next Articles

Preface

Xiao-Dong Li1, Wen-Jian Luo2, and Xin Yao3   

  1. 1 RMIT University, Australia
    2 University of Science and Technology of China, China
    3 The University of Birmingham, U.K.
  • Online:2008-01-15 Published:2008-01-15

Key words: finite automata; invertibility; public key cryptosystem;

[1] Avraham Trahtman. Some Aspects of Synchronization of DFA [J]. , 2008, 23(5 ): 719-727 .
[2] TAO Renji (陶仁骥) and CHEN Shihua (陈世华). Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 2 [J]. , 2002, 17(6): 0-0.
[3] TAO Renji (陶仁骥) and CHEN Shihua (陈世华). Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 1 [J]. , 2002, 17(4): 0-0.
[4] TAO Renji; CHEN Shihua;. Input-Trees of Finite Automata and Application to Cryptanalysis [J]. , 2000, 15(4): 305-325.
[5] TAO Renji(陶仁骥)and CHEN Shihua(陈世华). Input-Trees of Finite Automata and Application to Crytanalysis [J]. , 2000, 15(4): 0-0.
[6] TAO Renji; CHEN Shihua;. Constructing Finite Automata with Invertibility by transformation Method [J]. , 2000, 15(1): 10-26.
[7] Tao Renji; Chen Shihua; Chen Xuemei;. FAPKC3: A New Finite Automaton PublicKey Cryptosystem [J]. , 1997, 12(4): 289-305.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved