Paper 2005/267 Original: eprint.iacr.org/2005/267 ↗
Stream Cipher Design based on Jumping Finite State Machines
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- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2005-08-17: last updated
- 2005-08-17: published
- Short URL
- https://ia.cr/2005/267
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2005/267}
}