This paper deals with finite automaton public key cryptosystem and digital signatures. A new system FAPKC3 is proposed which can be used for encryption and implementing digital signatures as well. Some performances o...This paper deals with finite automaton public key cryptosystem and digital signatures. A new system FAPKC3 is proposed which can be used for encryption and implementing digital signatures as well. Some performances of a software implementation of FAPKC3 are presented and its security is discussed.展开更多
An attack algorithm is proposed on a finite automaton public key cryptosystem.It is proved that this attack can break FAPKCO in polynomial time.The basic idea can be used in principle to attack other FAPKCs.Therefore,...An attack algorithm is proposed on a finite automaton public key cryptosystem.It is proved that this attack can break FAPKCO in polynomial time.The basic idea can be used in principle to attack other FAPKCs.Therefore,while designing an FAPKC,it must be taken into account whether it is secure or not under this kind of attack.展开更多
FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’s public key would not be restricted to memory finite automata. The generalized FAPKC...FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’s public key would not be restricted to memory finite automata. The generalized FAPKCA can be used in encryption and implementing digital signatures as well.展开更多
Ra, Rb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In aprevious paper, the authors generalized R., Rb transformations to ...Ra, Rb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In aprevious paper, the authors generalized R., Rb transformations to deal with nonlinear memory finite automata, and gave sufficient conditions for weak inverse andfor weakly invertible memory finite automata and inversion processes concerned;methods by transformation to generate a kind of nonlinear memory finite automatasatisfying one of these sufficient conditions were also given. This paper extends theconcepts, methods and results to general finite automata, in which states consist offinite input history, finite output history and finite 'inner state' history.展开更多
基金the Chinese Academy of Sciences the National Natural Science Foundationof China
文摘This paper deals with finite automaton public key cryptosystem and digital signatures. A new system FAPKC3 is proposed which can be used for encryption and implementing digital signatures as well. Some performances of a software implementation of FAPKC3 are presented and its security is discussed.
基金Project supported by the National Natural Science Foundation of China.
文摘An attack algorithm is proposed on a finite automaton public key cryptosystem.It is proved that this attack can break FAPKCO in polynomial time.The basic idea can be used in principle to attack other FAPKCs.Therefore,while designing an FAPKC,it must be taken into account whether it is secure or not under this kind of attack.
文摘FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’s public key would not be restricted to memory finite automata. The generalized FAPKCA can be used in encryption and implementing digital signatures as well.
文摘Ra, Rb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In aprevious paper, the authors generalized R., Rb transformations to deal with nonlinear memory finite automata, and gave sufficient conditions for weak inverse andfor weakly invertible memory finite automata and inversion processes concerned;methods by transformation to generate a kind of nonlinear memory finite automatasatisfying one of these sufficient conditions were also given. This paper extends theconcepts, methods and results to general finite automata, in which states consist offinite input history, finite output history and finite 'inner state' history.
