𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Synthesis of cryptographic interleaved sequences by means of linear cellular automata

✍ Scribed by Amparo Fúster-Sabater; P. Caballero-Gil

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
436 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular nonlinear sequence generators with cryptographic application can be linearized in terms of simple cellular automata.

📜 SIMILAR VOLUMES

Automaticity of double sequences generat
Automaticity of double sequences generated by one-dimensional linear cellular automata
✍ J.-P Allouche; F von Haeseler; H.-O Peitgen; A Petersen; G Skordev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 991 KB

We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.