Logo - springer
Slogan - springer

Computer Science - Security and Cryptology | Finite Automata and Application to Cryptography

Finite Automata and Application to Cryptography

Tao, Renji

Jointly Published with Tsinghua University Press.

2009, 350p. 2 illus..

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-540-78257-5

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-78256-8

free shipping for individuals worldwide

online orders shipping within 2-3 days.

add to marked items

  • Elaborates automata-theoretic aspect of cryptography
  • Proposes a canonical form for one key cryptosystems and a new design approach different from Shannon's
  • Presents deeper crypto-analyses for Finite Automata Public Key Cryptography (FAPKC)

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.



Content Level » Research

Keywords » FAPKC - Finite - Latin array - TUP - cryptography - cryptosystems - digital signature - finite automata - invertibility theory - mathematics

Related subjects » Communication Networks - Mathematics - Security and Cryptology

Table of contents 

Mutual Invertibility and Search.- Ra Rb Transformation Method.- Relations Between Transformations.- Structure of Feedforward Inverses.- Some Topics on Structure Problem.- Linear Autonomous Finite Automata.- One Key Cryptosystems and Latin Arrays.- Finite Automaton Public Key Cryptosystems.

Distribution rights 

Distribution Rights in China: Tsinghua University Press.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Data Encryption.