Binomial Representation of Cryptographic Binary Sequences and Its Relation to Cellular Automata

Sara D. Cardell and Amparo Fúster-Sabater

Complexity, 2019, vol. 2019, 1-13

Abstract:

The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinski’s triangle. They have fancy properties such that all the sequences with period equal to a power of 2 can be represented as the sum of a finite set of binomial sequences. Other structural properties of these sequences (period, linear complexity, construction rules, or relations among the different binomial sequences) have been analyzed in detail. Furthermore, this work enhances the close relation between the binomial sequences and a kind of Boolean networks, known as linear cellular automata. In this sense, the binomial sequences exhibit the same behavior as that of particular Boolean networks. Consequently, the binomial sequences can be considered as primary tools for generating other more complex Boolean networks with applications in communication systems and cryptography.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/2108014.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/2108014.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:2108014

DOI: 10.1155/2019/2108014

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem (mohamed.abdelhakeem@hindawi.com).