Finite Automata and Application to Cryptography

  • Authors
  • Renji¬†Tao

Table of contents

  1. Front Matter
    Pages i-ix
  2. Renji Tao
    Pages 1-45
  3. Renji Tao
    Pages 47-76
  4. Renji Tao
    Pages 77-107
  5. Renji Tao
    Pages 109-152
  6. Renji Tao
    Pages 153-175
  7. Renji Tao
    Pages 177-214
  8. Renji Tao
    Pages 215-271
  9. Renji Tao
    Pages 273-346
  10. Back Matter
    Pages 395-406

About this book

Introduction

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.

 

 

Keywords

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

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-78257-5
  • Copyright Information Springer Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-78256-8
  • Online ISBN 978-3-540-78257-5
  • About this book