We use cookies to improve your experience with our site.
TAO Renji, CHEN Shihua. Input-Trees of Finite Automata and Application to Cryptanalysis[J]. Journal of Computer Science and Technology, 2000, 15(4): 305-325.
Citation: TAO Renji, CHEN Shihua. Input-Trees of Finite Automata and Application to Cryptanalysis[J]. Journal of Computer Science and Technology, 2000, 15(4): 305-325.

Input-Trees of Finite Automata and Application to Cryptanalysis

  • In this papert weights of output set and of input set for finiteautomata are discussed. For a weakly invertible finite automaton, we proye thatfor states with minimal output weight, the distribution of input sets is uniform.Then for a kind of compound finite automata, we give weights of output set and ofinput set explicitly, and a characterization of their input-trees. For finite automatonpublic key cryptosystems, of which automata in public keys belong to such a kind ofcompound finite automata, we evaluate…
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return