Cryptographically strong S-boxes generated by modified immune algorithm

DOI10.1007/978-3-319-29172-7_3MaRDI QIDQ2802413zbMATH OpenOpenAlexFDO

Authors Georgi Ivanov, Svetla Nikova, Nikolay I. Nikolov

Publication date 26 April 2016

Published in Cryptography and Information Security in the Balkans (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29172-7_3

zbMATH Keywords

differential uniformityimmune algorithmsnonlinearityS-boxes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
• A novel heuristic method for obtaining \(S\)-boxes
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• A genetic algorithm for constructing bijective substitution boxes with high nonlinearity
• Generation of 8-bit S-boxes having almost optimal cryptographic properties using smaller 4-bit S-boxes and finite field multiplication

Cited in

(8)

• An STP-based model toward designing S-boxes with good cryptographic properties
• A novel heuristic method for obtaining \(S\)-boxes
• A genetic algorithm for constructing bijective substitution boxes with high nonlinearity
• Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
• The change in linear and differential characteristics of substitution after the multiplication by transposition
• scientific article; zbMATH DE number 7762727 (Why is no real title available?)
• Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning
• Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups

This page was built for publication: Cryptographically strong \(S\)-boxes generated by modified immune algorithm

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