An Evolutionary View on Reversible Shift-Invariant Transformations

Mariot, Luca; Picek, Stjepan; Jakobović, Domagoj; Leporati, Alberto

doi:10.1007/978-3-030-44094-7_8

Cited by 5 publications

(46 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This indicates that although decreasing limits the total number of optimal solutions, it still allows GP to "easily" guess some of those solutions. Thus, having smaller makes the problem simpler for GP, but not for GA, where we observed a trend of increasing difficulty similar to the one reported in [19]. Overall, these findings indicate that evolutionary algorithms are not needed to construct conserved landscape CA: a simpler and more effective way is to generate at random Boolean trees until one that maps to a conserved landscape rule is obtained.…”

Section: Introductionsupporting

confidence: 76%

“…Besides confirming the observations from [19], the new set of experiments allowed us to discover two additional findings:…”

Section: Introductionsupporting

confidence: 71%

“…Finally, Mariot et al investigated the possibility of evolving Reversible Cellular Automata (RCA). The authors considered three optimization strategies and obtained good results [19]. We note that the evolution of CA rules for cryptographic purposes is connected with the evolution of Boolean functions with good cryptographic properties.…”

Section: Related Workmentioning

confidence: 99%

“…This paper is an extended version of the work "An Evolutionary View on Reversible Shift-Invariant Transformations" [19] presented at EuroGP 2020. With respect to that work, here:…”

Section: Introductionmentioning

confidence: 99%

“…We conduct an extensive tuning phase for all algorithms on the problem instance with diameter d equal to 10. This represents a much larger and more difficult problem than the one considered in [19], where the diameter for tuning was set to 7, thus allowing more meaningful tuning results. 3.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Evolutionary algorithms for designing reversible cellular automata

Mariot

Picek

Jakobović

et al. 2021

Genet Program Evolvable Mach

Self Cite

View full text Add to dashboard Cite

Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by dynamics composed only of disjoint cycles. They have many applications in the simulation of physical systems, cryptography, and reversible computing. In this work, we formulate the search of a specific class of RCA – namely, those whose local update rules are defined by conserved landscapes – as an optimization problem to be tackled with Genetic Algorithms (GA) and Genetic Programming (GP). In particular, our experimental investigation revolves around three different research questions, which we address through a single-objective, a multi-objective, and a lexicographic approach. In the single-objective approach, we observe that GP can already find an optimal solution in the initial population. This indicates that evolutionary algorithms are not needed when evolving only the reversibility of such CA, and a more efficient method is to generate at random syntactic trees that define the local update rule. On the other hand, GA and GP proved to be quite effective in the multi-objective and lexicographic approach to (1) discover a trade-off between the reversibility and the Hamming weight of conserved landscape rules, and (2) observe that conserved landscape CA cannot be used in symmetric cryptography because their Hamming weight (and thus their nonlinearity) is too low.

show abstract

Section: Introductionsupporting

confidence: 76%

“…Besides confirming the observations from [19], the new set of experiments allowed us to discover two additional findings:…”

Section: Introductionsupporting

confidence: 71%

Section: Related Workmentioning

confidence: 99%

“…This paper is an extended version of the work "An Evolutionary View on Reversible Shift-Invariant Transformations" [19] presented at EuroGP 2020. With respect to that work, here:…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Evolutionary algorithms for designing reversible cellular automata

Mariot

Picek

Jakobović

et al. 2021

Genet Program Evolvable Mach

Self Cite

View full text Add to dashboard Cite

show abstract

Evolutionary computation and machine learning in cryptology

Picek

Jakobović

2020

Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion

View full text Add to dashboard Cite

and Domagoj Jakobovic (Faculty of Electrical Engineering and Computing, Croatia). Currently, Stjepan is working as an assistant professor at TU Delft, The Netherlands. Before that, Stjepan worked at MIT, USA and KU Leuven, Belgium. Stjepan also has several years of experience working in industry and government. He regularly publishes papers in both evolutionary computation and cryptographic conferences and journals. Besides that, he is a member of several professional societies (ACM, IEEE, IACR). Domagoj Jakobovic received his Ph.D. degree in 2005 at the University of Zagreb, Croatia, on the subject of generating scheduling heuristics with genetic programming. He is currently a full professor at the Department of Electronics, Microelectronics, Computer and Intelligent Systems at the University of Zagreb. His research interests include evolutionary algorithms, optimization methods, and parallel algorithms. Most notable contributions are in the area of a machine supported scheduling, optimization problems in cryptography, parallelization, and improvement of evolutionary algorithms. He has published more than 90 papers, lead several research projects, and serves as a reviewer for many international journals and conferences. Symmetric and Public Key Cryptosystems Symmetric key cryptosystems: The key used for encryption and decryption is the same. Alice and Bob must agree on this key before the communication takes place. Can be further classified in: Stream ciphers: Encryption and decryption process single symbols of the plaintext and the ciphertext. Block ciphers: Encryption and decryption work over blocks of fixed length of symbols. Public key (or asymmetric key) cryptosystems: The keys used for encryption and decryption differ. Alice uses Bob's public key K E to encrypt, while Bob uses his own private key K D to decrypt.

show abstract