Showing cs.CRShow all
3 papers · 1 filter
cs.CR2025
Cellular Automata as Generators of Interleaving Sequences
Sara D. Cardell
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream…
cs.CR2025
A New Representation of Binary Sequences by means of Boolean Functions
S. D. Cardell, A. Fúster-Sabater, V. Requena +1
Boolean functions and binary sequences are main tools used in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary se…
cs.CR2018
Recovering decimation-based cryptographic sequences by means of linear CAs
Sara D. Cardell, Amparo Fúster-Sabater
The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. Thes…