Deeper Investigating Adequate Secret Key Specifications for a Variable Length Cryptographic Cellular Automata Based Model

Oliveira, Gina M. B.; Martins, Luiz G. A.; Alt, Leonardo S.

doi:10.5772/15803

Cited by 4 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Later on, it was shown that an appropriate specification of the secret key gives a low probability to this failure occurrence [Oliveira et al (2010b)], expecting to rarely apply this contour procedure keeping the ciphertext size close to the plaintext. This specification was deeper investigated in [Oliveira et al (2010c)] and [Oliveira et al (2011)]. Additionally, a cryptographic model that employs a lattice with a fixed extra boundary was investigated in [Silva et al (2016)], which applies the reverse algorithm proposed by Wolfram.…”

Section: Related Workmentioning

confidence: 99%

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

Lira¹,

Macêdo²,

Lima³

et al. 2021

Preprint

View full text Add to dashboard Cite

The dynamical system described herein uses a hybrid cellular automata (CA) mechanism to attain reversibility, and this approach is adapted to create a novel block cipher algorithm called HCA. CA are widely used for modeling complex systems and employ an inherently parallel model. Therefore, applications derived from CA have a tendency to fit very well in the current computational paradigm where scalability and multi-threading potential are quite desirable characteristics. HCA model has recently received a patent by the Brazilian agency INPI. Several evaluations and analyses performed on the model are presented here, such as theoretical discussions related to its reversibility and an analysis based on graph theory, which reduces HCA security to the well-known Hamiltonian cycle problem that belongs to the NP-complete class. Finally, the cryptographic robustness of HCA is empirically evaluated through several tests, including avalanche property compliance and the NIST randomness suite.Keywords cellular automata • reversibility • cryptography • block cipher

show abstract

Section: Related Workmentioning

confidence: 99%

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

Lira¹,

Macêdo²,

Lima³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…A general method for pre-image computation was investigated by (WUEN-SCHE, 2008;OLIVEIRA et al, 2008), which were limited by the challenge of assuring the existence of a unique pre-image for every possible CA lattice. Further investigation included the application of wrap procedures that ensured the application of the encryption procedure to any given plaintext (OLIVEIRA et al, 2010;OLIVEIRA et al, 2010;MARTINS;ALT, 2011). However, these approaches still resulted in ciphertext with increased length.…”

Section: Cellular Automata Applied To Cryptographymentioning

confidence: 99%

Computação paralela e bio-inspirada: algoritmos genéticos multipopulação e autômatos celulares híbridos

Morais¹

View full text Add to dashboard Cite

This work consists of an investigation about the application of parallel computing techniques to bio-inspired models based on cellular automata (CA) and genetic algorithms (GA) in the context of their application to cryptography and the task scheduling problem, respectively. The Hybrid Cellular Automata (HCA) model features two algorithms that perform forward and backward evolution, where the states of a grid of cells are iteratively updated according to transition rules and nearby cells. This model is applied to cryptography, which aims for secure communication by encoding messages to prevent unintended access to the information. The Multipopulation Genetic Algorithm (MPGA) is a variation of GA intended for the application of parallel computing. This model consists of the evolution of multiple sets of solutions by means of stochastic operators for search and optimization applications. This algorithm is applied to the task scheduling problem, a computationally intractable problem that consists of minimizing the execution time of interdependent tasks assigned to a set of processors. Sequential and parallel implementations of these models were developed with the Python language, with implementations aimed to multicore processors (CPU) and graphics processing units (GPU) in the case of the HCA, and distributed memory and shared memory approaches for multicore processors in the case of the MPGA. With these implementations, experiments were conducted to quantify the performance gains of each parallel approach in comparison to the sequential implementations. The performance of the HCA algorithms was beneĄted by the parallel execution on GPU, while the parallel CPU implementations resulted in the loss of performance due to overhead. The experiments involving the parameterization of MPGA demonstrated a trade-off between the quality of solutions and execution time. In this case, a multiobjective analysis was employed, elucidating highly efficient conĄgurations considering both of these performance metrics.

show abstract

“…Análises e experimentos Estudos da literatura ( [Oliveira et al 2001], [Packard 1988], [Mitchell et al 1994] e [Oliveira et al 2010]) apresentaram problemas em que existe relação entre a classe de comportamento dinâmico de uma regra de transição do AC e o desempenho da mesma, numa tarefa de computação especíca. Um exemplo disso é a indicação de que as regras caóticas apresentam melhor desempenho em aplicações de criptograa [Oliveira et al 2010]. Outro exemplo de problema onde existe essa relação é no estudo das tarefas de computação implícita dos ACs, tais como a tarefa da classicação da densidade (TCD) e a tarefa de sincronização (TS) [Oliveira et al 2001].…”

Section: Capítulounclassified

“…Em outras aplicações, o uso desses parâmetros apresentou uma melhora signicativa no desempenho dos algoritmos que resolvem tais problemas. Como exemplo, podem ser citadas as tarefas que estudam a capacidade computacional dos ACs [Mitchell et al 1994] [Oliveira et al 2001] [Oliveira et al 2010.…”

Section: Capítulo 1 Introduçãounclassified

Escalonamento de tarefas baseado em autômatos celulares com uso dos parâmetros de previsão do comportamento dinâmico

Carvalho¹

View full text Add to dashboard Cite

À minha mãe Renilda, a mulher mais determinada e disposta desse universo (sem exageros, ok?) por ter tido a coragem e fé de mudar da nossa casa para que seus lhos pudessem estudar.Ao meu pai Antônio, o homem mais trabalhador e sensível desse mundo (continuo sem exagerar), por ter tido a força e perseverança para suportar a distância de seus lhos e esposa.Aos meus irmãos, tico e teco, também conhecidos como Douglas (dodi) e Cristian (kiki) pelos bons momentos e brigas (sim, me zeram mais forte), e também pela certeza de que enquanto vocês existem eu não me sinto só. À toda minha família, cujos nomes não estão aqui porque a maioria começa com R e isso aqui não é RAP (ok?), amo todos vocês.A todos meus amigos. Em especial: Fabito e Sarita, pela companhia no lab e nos barzinhos (secret)! A Felipe pela força, companheirismo e paciência no momento mais difícil desse processo: a escrita dessa dissertação.

show abstract

Deeper Investigating Adequate Secret Key Specifications for a Variable Length Cryptographic Cellular Automata Based Model

Cited by 4 publications

References 12 publications

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

Computação paralela e bio-inspirada: algoritmos genéticos multipopulação e autômatos celulares híbridos

Escalonamento de tarefas baseado em autômatos celulares com uso dos parâmetros de previsão do comportamento dinâmico

Contact Info

Product

Resources

About