Evolutionary heuristics for finding cryptographically strong S-boxes

DOI10.1007/978-3-540-47942-0_22MaRDI QIDQ4945395zbMATH OpenFDO

Authors William Millan, L. Burnett, Gary Carter, A. Clark, Ed Dawson

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-47942-0_22

zbMATH Keywords

cryptographically strong S-boxesgenetic algorithmregular substitution boxes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Multi-objective optimisation of bijective S-boxes
• The designs of S-boxes by simulated annealing
• Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
• A novel heuristic method for obtaining \(S\)-boxes
• A novel method to design S-box based on chaotic map and genetic algorithm

Cited in

(11)

• How to use metaheuristics for design of symmetric-key primitives
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• The designs of S-boxes by simulated annealing
• Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Variant of DES-128, 192, 256
• Comparison of effectiveness of multi-objective genetic algorithms in optimization of invertible S-boxes
• A Search Strategy to Optimize the Affine Variant Properties of S-Boxes
• Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
• Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)
• A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts

This page was built for publication: Evolutionary heuristics for finding cryptographically strong S-boxes

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