Cryptography with Shrinking Generators

Chapter 1- Introduction to stream ciphers.- Chapter 2- Keystream generators based on irregular decimation.- Chapter 3- Modelling through linear cellular automata.- Chapter 4- Cryptanalysis.- References.

Sara D. Cardell received her Ph.D. degree from the University of Alicante, Spain, where she also pursued her postdoctoral studies. During this period, she spent one year working with Dr. Amparo Fúster-Sabater at the Spanish National Research Council (C.S.I.C.). More recently she joined the coding theory research group at the University of Campinas, Brazil. Dr. Cardell has authored a considerable number of publications and has served on the organizing committee of several scientific events and research projects. Her research interests include poset metrics, Fq-linear codes MDS codes, SPC codes, stream ciphers, pseudo-random sequences and cryptanalysis.
Amparo Fúster-Sabater received her B.S. and Ph.D. degrees in physics from Universidad Complutense, Madrid, Spain. Since 1988, she has been with the Spanish National Research Council (C.S.I.C.) at the Department of Information Processing and Cryptography of the Institute of Physical and Information Technologies (ITEFI). Dr. Fúster-Sabater is the author of many articles in reputed international mathematical and engineering sciences journals, conference papers and several books. Her current research interests include cryptanalysis, stream ciphers and pseudo-random sequences.

"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)