Cryptography with Shrinking Generators

Beschreibung

This book offers a broad survey of all information made public - from 1993 until today - on keystream sequence generators based on irregular decimation, which are referred to as shrinking generators. Starting with an overview of cryptography, it describes each type of generator - shrinking, self-shrinking, modified self-shrinking, generalized self-shrinking and the DECIM algorithm - with examples and references. Further, the book discusses several attacks on these generators and applications. It concludes by demonstrating how the output sequences can be modeled by means of different families of one-dimensional cellular automata, rendering the generators vulnerable to attacks. Intended for researchers and graduate students, the book will hopefully inspire them to search for more details on this family of generators and to address the open problems in this field.

 


This book offers a broad survey of all information made public - from 1993 until today - on keystream sequence generators based on irregular decimation, which are referred to as shrinking generators. Starting with an overview of cryptography, it describes each type of generator - shrinking, self-shrinking, modified self-shrinking, generalized self-shrinking and the DECIM algorithm - with examples and references. Further, the book discusses several attacks on these generators and applications. It concludes by demonstrating how the output sequences can be modeled by means of different families of one-dimensional cellular automata, rendering the generators vulnerable to attacks. Intended for researchers and graduate students, the book will hopefully inspire them to search for more details on this family of generators and to address the open problems in this field.




Offers a rare, unified source of information on shrinking generators Illustrates the theoretical aspects of this family of generators with a myriad of applications Presents open problems that might motivate further research on cryptology Includes supplementary material: sn.pub/extras

Autor*in

Sara Díaz Cardell

Themen in »Cryptography with Shrinking Generators«

cryptography cryptoanalysis decimation cellular automata pseudo-random sequences keystream sequence generator 94A60 68Q80 94A55

Stimmen zu »Cryptography with Shrinking Generators«

“CSG packs a lot of information into about 100 pages, summarizing research into shrinking generators. … it would be considered high-level from an electrical engineering or programming perspective. It contains several idealized circuit diagrams and tables of 0s and 1s. … The level of detail would be appropriate for mathematicians wanting to understand algorithmic details, or for hardware or software developers wanting a mathematical overview.” (John D. Cook, MAA Reviews, June 24, 2019)
()

Details

Link teilen