Cellular automata based S-boxes

DOI10.1007/S12095-018-0311-8MaRDI QIDQ1755184zbMATH OpenOpenAlexFDO

Authors Luca Mariot, Stjepan Picek, Alberto Leporati, Domagoj Jakobovic

Publication date 8 January 2019

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:63b7d784-b38b-4b5b-9a15-22e2ae577db3

zbMATH Keywords

heuristicscellular automataS-boxcryptographic properties

Mathematics Subject Classification ID

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

Recommendations

• Cryptographically Strong S-Boxes Based on Cellular Automata
• Designing cryptographically strong S-boxes with use of 1D cellular automata
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning
• On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata

Cites work

• scientific article; zbMATH DE number 1682693 (Why is no real title available?)
• scientific article; zbMATH DE number 5831605 (Why is no real title available?)
• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• scientific article; zbMATH DE number 21231 (Why is no real title available?)
• scientific article; zbMATH DE number 503330 (Why is no real title available?)
• scientific article; zbMATH DE number 1088929 (Why is no real title available?)
• scientific article; zbMATH DE number 1455097 (Why is no real title available?)
• scientific article; zbMATH DE number 1759278 (Why is no real title available?)
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• scientific article; zbMATH DE number 919604 (Why is no real title available?)
• A new approach to block cipher design
• Block Encryption Using Reversible Cellular Automata
• Communication Theory of Secrecy Systems*
• Construction of lightweight S-boxes using Feistel and MISTY structures
• Cryptographic properties of bipermutive cellular automata rules
• Direct construction of recursive MDS diffusion layers using shortened BCH codes
• Evolutionary computation. 1. Basic algorithms and operators
• Fast hashing and stream encryption with \textsc{Panama}
• Invertible shift-invariant transformations on binary arrays
• Keccak
• On the Classification of 4 Bit S-Boxes
• PRESENT: An Ultra-Lightweight Block Cipher
• Results on rotation-symmetric S-boxes
• Rotation symmetry in algebraically generated cryptographic substitution tables
• The block cipher companion.
• The designs of S-boxes by simulated annealing
• Vectorial Boolean functions for cryptography

Cited in

(14)

• Designing cryptographically strong S-boxes with use of 1D cellular automata
• Exploring semi-bent Boolean functions arising from cellular automata
• Heuristic search of (semi-)bent functions based on cellular automata
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• Search space reduction of asynchrony immune cellular automata
• Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning
• On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
• Mutually orthogonal Latin squares based on cellular automata
• Inversion of Mutually Orthogonal Cellular Automata
• Design of fault-resilient S-boxes for AES-like block ciphers
• The designs of S-boxes by simulated annealing
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Insights gained after a decade of cellular automata-based cryptography
• Enumeration of maximal cycles generated by orthogonal cellular automata

Describes a project that uses

Uses Software

• Keccak
• PRESENT

This page was built for publication: Cellular automata based S-boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755184)