The designs of S-boxes by simulated annealing

DOI10.1007/BF03037656zbMath1103.68047OpenAlexW3019347299MaRDI QIDQ2493292

John A. Clark, Susan Stepney, Jeremy L. Jacob

Publication date: 12 June 2006

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03037656

zbMATH Keywords

Substitution boxessymmetric key ciphers

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (10)

Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties ⋮ Investigation of some cryptographic properties of the \(8 \times 8\) S-boxes created by quasigroups ⋮ On the construction of hardware-friendly \(4\times4\) and \(5\times5\) S-boxes ⋮ Unnamed Item ⋮ Designing cryptographically strong \(S\)-boxes with the use of cellular automata ⋮ Cryptographically Strong S-Boxes Based on Cellular Automata ⋮ Fast S-box security mechanism research based on the polymorphic cipher ⋮ Cellular automata based S-boxes ⋮ Probability distributions of correlation and differentials in block ciphers ⋮ Application based construction and optimization of substitution boxes over 2D mixed chaotic maps

Cites Work

• Optimization by Simulated Annealing
• A TUTORIAL ON LINEAR AND DIFFERENTIAL CRYPTANALYSIS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The designs of S-boxes by simulated annealing