Paper 2005/267

Stream Cipher Design based on Jumping Finite State Machines

Cees J. A. Jansen

Abstract

This paper presents a new way of constructing binary cascade clock-controlled LFSR sequence generators as building blocks for stream ciphers. In these constructions the bottleneck of multiple clocking shift registers is removed, resulting in so called jump-controlled sequence generators, that operate in a single clock pulse and are most efficient to implement. The constructions make use of special properties of irreducible polynomials over finite fields. This paper also aims at giving insight into the mathematical theory behind the constructions. To this end, theory is developed and many of the rich set of properties of irreducible polynomials over GF(2), such as periods, jump indices and the number and cardinalities of various classes of polynomials are presented.

Metadata
Available format(s)
PDF PS
Category
Secret-key cryptography
Publication info
Published elsewhere. Revised and extended version of papers at RECSI-VII 2002 and SASC 2004 containing all proofs
Keywords
LFSRfinite state machinesequence generationclock-controlirreducible polynomialtransition matrixjump indexdual polynomial
Contact author(s)
cja @ iae nl
History
2005-08-17: received
Short URL
https://ia.cr/2005/267
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/267,
      author = {Cees J. A.  Jansen},
      title = {Stream Cipher Design based on Jumping Finite State Machines},
      howpublished = {Cryptology ePrint Archive, Paper 2005/267},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/267}},
      url = {https://eprint.iacr.org/2005/267}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.