分解弱可逆有限自动机的两个结果

研究弱可逆有限自动机的分解可以为分析有限自动机公开钥密码体制的安全性提供一种重要途径．从输出权的角度研究了n元延迟τ步弱可逆有限自动机M的分解问题,首先证明了其可分解为一个延迟0步弱可逆有限自动机和一个τ阶延迟元当且仅当M的所有状态的长τ输出权为1．其次,在获得一类不可分解出延迟元的弱可逆有限自动机的基础上,构造出一个反例,否定回答了鲍丰在1993年提出的一个公开问题．同时给出了二元严格延迟τ步强连通弱可逆有限自动机可分解为一个严格延迟τ—1步弱可逆有限自动机和一个严格延迟1步弱可逆有限自动机的一个充分条件．     

弱可逆拟(r,r)阶存贮线性有限自动机的分解

通过对延迟r步弱可逆拟(r,r)阶存贮线性有限自动机输出权的研究,得出对延迟r步弱可逆拟(r,r)阶存贮线性有限自动机的任意一个状态,它的长r的输出权都是1;任何一个n元拟(r,r)阶存贮线性有限自动机M延迟r步弱可逆的充分必要条件是M都可以分解为一个延迟0步弱可逆有限自动机M0和一个延迟r步弱可逆拟(0,r)阶存贮线性有限自动机M1。     

弱可逆有限自动机的分解

有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究．在有限自动机公开钥密码体制中首次提出了自动机化合的概念．易知,两个弱可逆有限自动机的化合仍然是一个弱可逆有限自动机并且它的延迟步数不大于前两个有限自动机延迟步数之和．然而,另一方面,如何将一个弱可逆有限自动机分解为两个弱可逆有限自动机的化合却是一个非常困难的问题．该文主要考虑了一类n元严格延迟τ步弱可逆有限自动机M的延迟步数的分解问题．给出了一类特殊的n元弱可逆有限自动机分解的条件和结果．首先证明了如果对M中的每个状态s有T（s,τ）枝等,则M可分解为τ个延迟1步弱可逆有限自动机的化合．然后证明了M可分解为一个τ—m步弱可逆有限自动机和m阶延迟元的充要条件是对M中的每个状态s有T（s,m）枝等．     

环上线性有限自动机的可逆性的一些结果

本文证明了有单位元的有限交换环R上任何延迟t步(弱)可逆线性有限自动机皆有延迟t步线性(弱)逆的充分必要条件是环R满足条件: x(Ax=0→bx=0)→y(b=yA)我们还证明了对任何有单有限交换环R,R上输入、输出维数相同的延迟t步(弱)可逆线性有限自动机具有延迟t步线性(弱)逆.     

二元弱可逆有限自动机延迟步数的分解

本文考虑二元严格延迟τ步弱可逆有限自动机Ｍ的延迟步数的分解问题。首先证明如果Ｍ强连通且所有状态的延迟步数不小于τ－１，则Ｍ一定能分解为一个延迟０步弱可逆有限自动机和一个τ阶延迟元。然后证明如果Ｍ所有状态延迟步数均不小于ｍ，那么Ｍ可以分解为一个严格延τ－ｍ步弱可逆有限自动机和一个ｍ阶延迟元。最后考虑了Ｍ可分解为一个严格延迟τ－１步和一个严格延迟１步弱可逆有限自动机的条件。     

关于弱可逆有限自动机延迟步数分解的两个结果

本文证明存在(任意元)延迟2步弱可逆有限自动机不等价于任何两个延迟1步弱可逆有限自动机的化合的任何子自动机。因而说明了不是对所有的弱可逆有限自动机,延迟步数都是可分解的,但对所有状态的延迟步数均为2的二元延迟2步弱可逆有限自动机,则分解是可行的。     

关于二元延迟3步前馈逆有限自动机的结构

前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题.对延迟步数≥3的前馈逆结构的刻划,则是一个长期的未解决问题.研究了二元延迟3步前馈逆有限自动机的结构.对于自治有限自动机M_a的状态图为圈的二元延迟3步弱可逆半输入存储有限自动机C(M_af ),给出了其长3极小输出权分别为1,2,8三种情形下结构的一种刻画.由于C(M_af )延迟3步弱可逆当且仅当它是延迟3步弱逆,因此,得到了二元延迟3步前馈逆有限自动机结构的一种部分刻画.     

线性有限自动机输入输出集的性质

证明了两个线性有限自动机化合而得到的自动机具有输入输出均匀的性质,建立了由两个延迟1步弱可逆线性有限自动化合后得到的自动机的输入集个数与化合前自动机输入集个数的等式关系。     

一种有限自动机公开钥密码体制和数字签名

本文提出一种基于有限自动机可逆性理论的公开钥密码体制,它的公开的加密算法由一个非线性延迟O步弱可逆γ阶输入存储有限自动机M和一个延迟τ步可逆(τ,τ)阶存储线性有限自动机M_1经过复合后所得的(τ γ,τ)阶存储有限自动机M所实现,它的秘密的解密算法由M_1的延迟τ步逆M_1′和M的延迟O步弱逆M所实现,这种有限自动机公开钥密码体制的保密性建立在求非线性有限自动机的弱逆的困难性和矩阵多项式因式分解的困难性之上,文中又讨论了用这种密码体制建立数字签名的方法。     

关于弱可逆线性有限自动机的弱逆的结构

本文研究的主要问题是:对给定延迟τ步弱可逆线性有限自动机M,求出M的所有延迟τ步弱逆线性有限自动机。解决的办法是:首先求出所有M的延迟τ步弱逆的传输函数矩阵,然后对每个传输函数矩降,求出以它为传输函数矩阵的所有M的延迟τ步弱逆。     

Decomposing a kind of weakly invertible finite automata with delay 2

Some properties of a finite automaton composed of two weakly invertible finite automata with delay 1 are given,where each of those two automata has the output set of each state with the same size.And for a weakly invertible finite automaton M with delay 2 satisfying the properties mentioned in this paper,two weakly invertible finite automata with delay 1 are constructed such that M is equivalent to a sub-finite-automaton of the composition of those two.So a method to decompose this a kind of weakly invertible finite automate with delay 2 is presented.     

Input-trees of finite automata and application to cryptanalysis

In this paper,Weights of output set and of input set for finite automata are discussed.For a weakly invertible finite automaton,we prove that for states with minimal output weight,the distruibution of input sets is uniform.Then for a kind of compound finite automata,we give weights of output set and of input set explicitly,and a characterization of their input-trees.For finite automaton public key cryptosystems,of which automata in public keys belong to such a kind of compound finite automata,we evaluate search amounts of exhaust search algorithms in average case and in worse case for both encryption and signature,and success ful probabilities of stochastic search algorithms for both encryption and signature.In addition,a result on mutual invertibility of inite automata is also given.     

Constructing finite automata with invertibility by transformation method

Ra,Rb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields.In a previous paper,the authors generalized Ra,Rb transformations to deal with nonlinear memory finite automata,and gave sufficient conditions for weak inverse and for weakly invertible memory finite automata and inversion processes concerned;methods by transformation to generate a kind of nonlinear memory finite automata satisfying one of these sufficient conditions were also given.This paper extends the concepts,methods and results to general finite automata,in which states consist of finite input history,finite output history and finite “inner state“ history.     

On the Structure of (Weak) Inverses of an (Weakly) Invertible Finite Automaton

In this paper, we first give a method by which, for any weakly invertible finite automatonM with delay τ, the set of all weak inverse finite automata of M with delay τ can beconstructed. We then give a method by which, for any invertible one, all its inverses with delayτ can also be constructed.     

On the Structure of Finite Automata of Which M Is an(Weak)Inverse with Delay τ

In this paper,we first give a method that for any inverse finite automaton M' withdelay τ,all inver tible finite automata with delay τ,of which M' is an inverse with delayτ,can be constructed;and a universal nondeterministic finite automaton,for all finiteautomata of which M' is an inverse with delay τ,can also be constructed.We then give amethod that for any weak inverse finite automaton M' with delay τ,all weaklyinvertible finite automata with delay τ of which M' is a weak inverse with delay,can beconstructed;and a universal nondeterministic finite automaton,for all finiteautomata of which M' is a weak inverse with delay τ,can also be constructed.     

拟(h,k)存贮有限自动机的可逆性

主要研究拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱可逆性,以及它的弱逆,得到了拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱可逆的充分必要条件,并且通过所得结果可以比较简便地构造出延迟k步与k+1步弱可逆拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱逆.