Finite Automata and Application to Cryptography

Renji Tao

ISBN 10: 3540782567 / ISBN 13: 9783540782568

Edité par Springer, Berlin, Tsinghua University Press, Springer, 2008

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - 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.

N° de réf. du vendeur 9783540782568

Détails bibliographiques

• Titre: Finite Automata and Application to Cryptography
• Éditeur: Springer, Berlin, Tsinghua University Press, Springer
• Date de parution: 2008
• Langue: anglais
• ISBN à 10 chiffres: 3540782567
• ISBN à 13 chiffres: 9783540782568
• Reliure: Buch
• État de l'article: Neu

A propos de ce titre

Synopsis

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.