Skip to main content
Book cover

Stream Ciphers

  • Textbook
  • © 2013

Overview

  • Provides a detailed introduction to stream ciphers including history, mathematics and many examples
  • Contains many useful exercises and solutions
  • Features many real-world applications like the security of mobile phones
  • Includes supplementary material: sn.pub/extras

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

Access this book

eBook USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 84.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 (20 chapters)

  1. Shift Register-Based Stream Ciphers

  2. Some Special Ciphers

  3. Mathematical Background

Keywords

About this book

In cryptography, ciphers is the technical term for encryption and decryption algorithms. They are an important sub-family that features high speed and easy implementation and are an essential part of wireless internet and mobile phones.

 

Unlike block ciphers, stream ciphers work on single bits or single words and need to maintain an internal state to change the cipher at each step. Typically stream ciphers can reach higher speeds than block ciphers but they can be more vulnerable to attack. Here, mathematics comes into play. Number theory, algebra and statistics are the key to a better understanding of stream ciphers and essential for an informed decision on their safety.

 

Since the theory is less developed, stream ciphers are often skipped in books on cryptography. This book fills this gap. It covers the mathematics of stream ciphers and its history, and also discusses many modern examples and their robustness against attacks.

 

Part I covers linear feedback shift registers, non-linear combinations of LFSRs, algebraic attacks and irregular clocked shift registers. Part II studies some special ciphers including the security of mobile phones, RC4 and related ciphers, the eStream project and the blum-blum-shub generator and related ciphers.

 

Stream Ciphers requires basic knowledge of algebra and linear algebra, combinatorics and probability theory and programming. Appendices in Part III help the reader with the more complicated subjects and provides the mathematical background needed. It covers, for example, complexity, number theory, finite fields, statistics, combinatorics. Stream Ciphers concludes with exercises and solutions and is directedtowards advanced undergraduate and graduate students in mathematics and computer science.

Reviews

From the book reviews:

“This book focuses on the theory of stream ciphers and their applications. … Seldom does one find a summary of the theory of stream ciphers as systematic as that in the book under review. … the book covers completely the topic of attacks on stream ciphers … . This is a remarkable book and it should be of interest to scholars and students in discrete mathematics, cryptography, coding theory, computer security and related fields.” (Zhixiong Chen, Mathematical Reviews, March, 2014)

“Starting with a historical overview, this book gives a very good and comprehensive introduction to the mathematics of stream ciphers. … the book can serve as a valuable contribution to advanced undergraduate and graduate cryptography lectures in mathematics and computer science.” (Wilfried Meidl, zbMATH, Vol. 1288, 2014)

“Provide a coherent discussion of stream ciphers, how they are implemented, and how they can be attacked. … The material is presented in a logical fashion. The writing is clear and the mathematics well presented … . The book is intended for advanced undergraduate and graduate students of mathematics or computer science. … it presents the reader with applications in a number of important theoretical areas of mathematics and computer science, including graph theory, complexity and performance analysis of algorithms, P versus NP, and more.” (G. R. Mayforth, Computing Reviews, September, 2013)

Authors and Affiliations

  • Dept. of Pure Mathem. & Computer Algebra, State University of Ghent, Ghent, Belgium

    Andreas Klein

About the author

The author's research includes: Discrete Mathematics/Combinatorics and its application. Finite Geometry (partial ovoids, spreads, etc.) Cryptography (e.g. Visual Cryptography) Complexity Theory (parallel automata) Coding Theory (geometric constructions, convolutional codes, etc.) Miscellaneous

Bibliographic Information

Publish with us