A complex system is a set of mutually interacting elements for which it is possible to
construct a mathematical model. This article focuses on the cellular automata theory and the …

Bipermutive rules are known to induce both expansive and mixing chaotic cellular automata.
In this paper, we study some cryptographic properties of bipermutive rules, initially proving …

Cellular Automata (CA) have been extensively used to implement symmetric cryptographic
primitives, such as pseudorandom number generators and S-boxes. However, most of the …

Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a
new approach to construct orthogonal Latin squares for cryptographic applications such as …

Due to their significant correlation and redundancy, conventional block cipher cryptosystems
are not efficient in encrypting multimedia data. Stream ciphers based on Cellular Automata …

We consider the problem of enumerating pairs of bipermutive cellular automata (CA) which
generate orthogonal Latin squares. Since the problem has already been settled for …

Cellular Automata (CA) have a long history being employed as pseudo-random number
generators (PRNG), especially for cryptographic applications such as keystream generation …

Abstract 1985 年, 肖国镇在第23 届ISIT 国际会议上提出非线性组合函数的" 线性统计独立"
的概念, 用频谱方法刻画了线性统计独立函数的特征. 线性统计独立与同一时期Siegenthaler …

Nonlinear functions are essential in different crypto-primitives as they play an important role
on the security of a cipher design. Wolfram identified Rule 30 as a powerful nonlinear …

Abstract Three-neighbourhood Cellular Automata (CA) are widely studied and accepted as
suitable cryptographic primitive. Rule 30, a 3-neighbourhood nonlinear CA rule, was …