Finite Automata and Application to Cryptography

• Main Author: Tao, Renji. (Author)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Subjects: Computer science.; Computer Communication Networks.; Data protection.; Data encryption (Computer science).; Mathematics.; Computer Science.; Data Encryption.; Systems and Data Security.; Mathematics, general.
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-540-78257-5

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, ar...

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.