Exploring semi-bent Boolean functions arising from cellular automata

DOI10.1007/978-3-030-69480-7_7zbMath1492.68092arXiv2005.08300OpenAlexW3135749679MaRDI QIDQ831678

Martina Saletta, Luca Manzoni, Alberto Leporati, Luca Mariot

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2005.08300

zbMATH Keywords

balancednesscellular automatanonlinearitystream cipherslinear structurescombinatorial searchsemi-bent functions

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Boolean functions (94D10)

Related Items (3)

A survey of metaheuristic algorithms for the design of cryptographic Boolean functions ⋮ Heuristic search of (semi-)bent functions based on cellular automata ⋮ Evolutionary strategies for the design of binary linear codes

Uses Software

• Keccak

Cites Work

• Unnamed Item
• Unnamed Item
• On ``bent functions
• Cellular automata based S-boxes
• Mutually orthogonal Latin squares based on cellular automata
• A secret sharing scheme based on cellular automata
• Advances on Random Sequence Generation by Uniform Cellular Automata
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Keccak
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• Computing the periods of preimages in surjective cellular automata

This page was built for publication: Exploring semi-bent Boolean functions arising from cellular automata