- Full Description
Finite 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 one-key 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 one-key ciphers implementable by finite automata with bounded-error-propagation 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.
- Table of Contents
Table of Contents
- Chapter 1 Introduction.
- Chapter 2 Mutual Invertibility and Search.
- Chapter 3 R_a R_b Transformation Method.
- Chapter 4 Relations Between Transformations.
- Chapter 5 Structure of Feedforward Inverses.
- Chapter 6 Some Topics on Structure Problem.
- Chapter 7 Linear Autonomous Finite Automata.
- Chapter 8 One Key Cryptosystems and Latin Arrays.
- Chapter 9 Finite Automaton Public Key Cryptosystems.
If you think that you've found an error in this book, please let us know by emailing to firstname.lastname@example.org . You will find any confirmed erratum below, so you can check if your concern has already been addressed. No errata are currently published