Finite Automata and Application to Cryptography

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, ar...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Tao, Renji (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Edición:1st ed. 2009.
Temas:
Cryptography.
Data encryption (Computer science).
Data protection.
Mathematics.
Computer networks .
Cryptology.
Data and Information Security.
Computer Communication Networks.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-78257-5
003 DE-He213
005 20220127101216.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783540782575  |9 978-3-540-78257-5 
024 7 |a 10.1007/978-3-540-78257-5  |2 doi 
050 4 |a QA268 
072 7 |a GPJ  |2 bicssc 
072 7 |a URY  |2 bicssc 
072 7 |a COM053000  |2 bisacsh 
072 7 |a GPJ  |2 thema 
072 7 |a URY  |2 thema 
082 0 4 |a 005.824  |2 23 
100 1 |a Tao, Renji.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Finite Automata and Application to Cryptography  |h [electronic resource] /  |c by Renji Tao. 
250 |a 1st ed. 2009. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2009. 
300 |a 350 p. 2 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. 
520 |a 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. . 
650 0 |a Cryptography. 
650 0 |a Data encryption (Computer science). 
650 0 |a Data protection. 
650 0 |a Mathematics. 
650 0 |a Computer networks . 
650 1 4 |a Cryptology. 
650 2 4 |a Data and Information Security. 
650 2 4 |a Mathematics. 
650 2 4 |a Computer Communication Networks. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540870715 
776 0 8 |i Printed edition:  |z 9783642096907 
776 0 8 |i Printed edition:  |z 9783540782568 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-78257-5  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 

Ejemplares similares