Language: English
ISBN/ISSN: 9787302175308
Published on: 2008-01
Hardcover
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 .
Foreword by Arto Salomaa
Preface
1.Introduction
1.1Preliminaries
1.2Definitions of Finite Automata
1.3Linear Finite Automata
1.4Concepts on Invertibility
1.5Error Propagation and Feedforward Invertibility
1.6Labelled Trees as States of Finite Automata
2.Mutual Invertibility and Search
2.1Minimal Output Weight and Input Set
2.2Mutual Invertibility of Finite Automata
2.3Find Input by Search
3.Ra Rb Transformation Method
3.1Sufficient Conditions and Inversion
3.2Generation of Finite Automata with Invertibility
3.3Invertibility of Quasi – Linear Finite Automata
4.Relations Between Transformations
4.1Relations Between Ra Rb Transformations
4.2Composition of Ra Rb Transformations
4.3Reduced Echelon Matrix
4.4Canonical Diagonal Matrix Polynomial
5.Structure of Feedforward Inverses
6.Som Topics on Structure Problem
7.Linear Autonomous Finite Automata
8.One Key Cryptosystems and Latin Arrays
9.Finite Automaton Public Key Cryptosystems
References
Index
