HAPPY HOLIDAYS: Get a special discount on Apress Access! Subscribe today >>

Finite Automata and Application to Cryptography

Authors: Tao, Renji

  • 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)
see more benefits

Buy this book

eBook $149.00
price for USA
  • ISBN 978-3-540-78257-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $189.00
price for USA
  • ISBN 978-3-540-78256-8
  • Free shipping for individuals worldwide
  • Online orders shipping within 2-3 days.
About this book

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.

 

 

Reviews

From the reviews:

"The present book treats an up-to-date subject from a mathematical point of view. … The entire work is presented at a high level and has a very good and well proved mathematical background … making the book a kind of a reference volume to applied mathematics in cryptography, coding theory and information security for students having basic knowledge and wanting a thorough account of this area, or for developers wanting to understand the mathematical background of the algorithms used in authentication systems." (Ion Iancu, Zentralblatt MATH, Vol. 1157, 2009)

"This is a most welcome and anticipated volume in the fields of automata and cryptography. … this book should be considered a major work on these topics and is a must read for anyone active in these fields. It is fortunate for the reader that the structure of this book is pedagogic in nature … . researchers will be most comfortable with the structure and format of individual chapters … . There is a collective exhaustive bibliography at the end of the book … ." (Michael Goldberg, ACM Computing Reviews, July, 2009)


Table of contents (9 chapters)

Buy this book

eBook $149.00
price for USA
  • ISBN 978-3-540-78257-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $189.00
price for USA
  • ISBN 978-3-540-78256-8
  • Free shipping for individuals worldwide
  • Online orders shipping within 2-3 days.

Services for this book

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Finite Automata and Application to Cryptography
Authors
Copyright
2009
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
Distribution Rights
Distribution Rights in China: Tsinghua University Press.
eBook ISBN
978-3-540-78257-5
DOI
10.1007/978-3-540-78257-5
Hardcover ISBN
978-3-540-78256-8
Edition Number
1
Number of Pages
350
Number of Illustrations and Tables
2 b/w illustrations
Additional Information
Jointly Published with Tsinghua University Press.
Topics