A Virtual Three-Dimension Cellular Automata Pseudorandom Number Generator Based on the Moore Neighborhood Method

Shin, Sangho; Park, Geum-Dal; Yoo, Kee-Young

doi:10.1007/978-3-540-85984-0_22

Cited by 6 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Cryptography based on CA gave first signals at [5], [10], [11] and recently dealing in [12], [13], it was also included CA as pseudo-random number generator in [14], [15], [16], [17], [18], [19]. Although the inclusion of CA in the field of cryptography is not new, this proposal follows a chaotic sensitivity throughout the process, and our results exceed expectations compared to others found in literature.…”

Section: Introductionmentioning

confidence: 53%

Chaotic encryption method based on life-like cellular automata

Machicao

Marco

Bruno

2012

Expert Systems with Applications

View full text Add to dashboard Cite

Abstract-We propose a chaotic encryption method based on Cellular Automata(CA), specifically on the family called the "Life-Like" type. Thus, the encryption process lying on the pseudo-random numbers generated (PRNG) by each CA's evolution, which transforms the password as the initial conditions to encrypt messages. Moreover, is explored the dynamical behavior of CA to reach a "good" quality as PRNG based on measures to quantify "how chaotic a dynamical system is", through the combination of the entropy, Lyapunov exponent, and Hamming distance. Finally, we present the detailed security analysis based on experimental tests: DIEHARD and ENT suites, as well as Fouriers Power Spectrum, used as a security criteria.

show abstract

Section: Introductionmentioning

confidence: 53%

Chaotic encryption method based on life-like cellular automata

Machicao

Marco

Bruno

2012

Expert Systems with Applications

View full text Add to dashboard Cite

show abstract

“…Afterwards, people tried to improve the quality of CA's random generator by using a combination of controllable cells [63], increasing the dimensionality of Cellular Automata [64]- [66], changing the neighborhood of cells [67], using Cellular Automata with additive rules [68], applying the evolutionary principles for designing Cellular Automata [69] and focusing on the parallelism associated with the evolution of global state in Cellular Automata for generating randomness [70].…”

Section: mentioning

confidence: 99%

An Information Theoretic Analysis of Random Number Generator based on Cellular Automaton

Nayyeri¹,

Dastghaibyfard²

2018

ijacsa

View full text Add to dashboard Cite

Abstract-Realization of Randomness had always been a controversial concept with great importance both from theoretical and practical Perspectives. This realization has been revolutionized in the light of recent studies especially in the realms of Chaos Theory, Algorithmic Information Theory and Emergent behavior in complex systems. We briefly discuss different definitions of Randomness and also different methods for generating it. The connection between all these approaches and the notion of Normality as the necessary condition of being unpredictable would be discussed. Then a complex-system-based Random Number Generator would be introduced. We will analyze its paradoxical features (Conservative Nature and reversibility in spite of having considerable variation) by using information theoretic measures in connection with other measures. The evolution of this Random Generator is equivalent to the evolution of its probabilistic description in terms of probability distribution over blocks of different lengths. By getting the aid of simulations we will show the ability of this system to preserve normality during the process of coarse graining.

show abstract

“…Em 1985, Wolfram (12) introduziu o primeiro arcabouço de criptografia baseado em AC caótico que atualmente tem recebido crescente interesse (14)(15)(16)(17)(18)(19)(20)(21)(22). Muitas das propriedades do caos estão relacionadas com as propriedades criptográficas, as quais são apontadas como requisitos para garantir uma encriptação adequada (25,29).…”

Section: Justificativa E Motivaçãounclassified

“…Na Tabela 5.1.2 é mostrada a comparação entre os resultados obtidos para ρ = 10 blocos e outros algoritmos encontrados na literatura (15)(16)(17)22 …”

Section: Comparação Com Outros Algoritmosunclassified

“…Os resultados dos testes de DIEHARD e ENT aplicados ao PRNG, atingiram resultados similares e até superiores se comparados com os principais métodos encontrados na literatura (15)(16)(17)22). Porém, é necessário fazer uma comparação com outros algoritmos de criptografia tradicionais, cuja análise está fora do escopo deste trabalho.…”

Section: Considerações Gerais Do Algoritmo De Cifra De Bloco Propostounclassified

See 1 more Smart Citation

Autômatos celulares caóticos aplicados na Criptografia e Criptoanálise

Justo¹

View full text Add to dashboard Cite

A Virtual Three-Dimension Cellular Automata Pseudorandom Number Generator Based on the Moore Neighborhood Method

Cited by 6 publications

References 7 publications

Chaotic encryption method based on life-like cellular automata

Chaotic encryption method based on life-like cellular automata

An Information Theoretic Analysis of Random Number Generator based on Cellular Automaton

Autômatos celulares caóticos aplicados na Criptografia e Criptoanálise

Contact Info

Product

Resources

About