Overview
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.
Full Product Details
Author: Sara Díaz Cardell ,
Amparo Fúster-Sabater
Publisher: Springer Nature Switzerland AG
Imprint: Springer Nature Switzerland AG
Edition: 1st ed. 2019
Weight: 0.454kg
ISBN: 9783030128494
ISBN 10: 3030128490
Pages: 101
Publication Date: 07 May 2019
Audience:
College/higher education
,
Postgraduate, Research & Scholarly
Format: Paperback
Publisher's Status: Active
Availability: Manufactured on demand
We will order this item for you from a manufactured on demand supplier.
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)
“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)
Author Information
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.
