Heuristic search of (semi-)bent functions based on cellular automata
From MaRDI portal
Publication:6137187
DOI10.1007/s11047-022-09885-3zbMath1530.68180arXiv2111.13248OpenAlexW3217248132MaRDI QIDQ6137187
Luca Mariot, Luca Manzoni, Martina Saletta, Alberto Leporati
Publication date: 1 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.13248
cellular automatanonlinearitybent functionssymmetric cryptographycombinatorial searchevolutionary strategies
Cites Work
- The design of Rijndael. The Advanced Encryption Standard (AES)
- Exploring semi-bent Boolean functions arising from cellular automata
- On ``bent functions
- Invertible shift-invariant transformations on binary arrays
- Cellular automata based S-boxes
- Random number generation using decimal cellular automata
- Mutually orthogonal Latin squares based on cellular automata
- A family of difference sets in non-cyclic groups
- Advances on Random Sequence Generation by Uniform Cellular Automata
- On the existence of (9,3,5,240) resilient functions
- Communication Theory of Secrecy Systems*
- Statistical mechanics of cellular automata
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- Keccak
- Boolean Functions for Cryptography and Coding Theory
- Cryptography
- CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher
- Inversion of Mutually Orthogonal Cellular Automata
- Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item