Skip to main content
Book cover

Cryptography with Shrinking Generators

Fundamentals and Applications of Keystream Sequence Generators Based on Irregular Decimation

  • Book
  • © 2019

Overview

  • 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

Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

Keywords

About this book

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.








Reviews

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

Authors and Affiliations

  • Department of Mathematics, Institute of Mathematics, Statistics and Scientific Computing (IMECC), University of Campinas (UNICAMP), Campinas, Brazil

    Sara Díaz Cardell

  • Institute of Physical and Information Technologies (ITEFI), C.S.I.C., Madrid, Spain

    Amparo Fúster-Sabater

About the authors

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.











Bibliographic Information

Publish with us