Finite Automata and Application to CryptographyFinite Automata and Application to Cryptography mainly deals with the invertibility theory of finite automata and its application to cryptography. In addition, autonomous finite automata and Latin arrays, which are relative to the canonical form for onekey cryptosystems based on finite automata, are also discussed. Finite automata are regarded as a natural model for ciphers. The Ra Rb transformation method is introduced to deal with the structure problem of such automata; then public key cryptosystems based on finite automata and a canonical form for onekey ciphers implementable by finite automata with boundederrorpropagation and without data expansion are proposed. The book may be used as a reference for computer science and mathematics majors, including seniors and graduate students. Renji Tao is a Professor at the Institute of Software, Chinese Academy of Sciences, Beijing.

What people are saying  Write a review
Contents
XLII  185 
XLIII  198 
XLIV  201 
XLV  205 
XLVI  208 
XLVII  215 
XLVIII  216 
XLIX  224 
XIII  34 
XIV  41 
XV  46 
XVI  48 
XVII  54 
XVIII  56 
XIX  67 
XX  74 
XXI  77 
XXII  78 
XXIII  86 
XXIV  95 
XXV  100 
XXVI  109 
XXVII  110 
XXVIII  115 
XXIX  128 
XXX  132 
XXXI  136 
XXXII  139 
XXXIII  144 
XXXIV  153 
XXXV  154 
XXXVI  157 
XXXVII  160 
XXXVIII  165 
XXXIX  176 
XL  178 
XLI  184 