|
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.
Fundamentals of Cryptology: A Professional Reference and Interactive Tutorial (Kluwer International Series in Engineering and Computer Science, 528) Автор: Henk C. A. Van Tilborg, Henk C.A. Van Tilborg, Henk C. A. Van Introduction to Cryptology Tilborg Год: 2002 |
Advances in Cryptology - EUROCRYPT 2006: 25th International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, ... (Lecture Notes in Com Автор: RA?A?diger Ebendt, GA?A¶rschwin Fey, Rolf Drechsler Год: 2006 |
Fast Software Encryption 12 conf Год: 2005 |
Fast Software Encryption 13 conf Год: 2006 |