Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)
From MaRDI portal
(Redirected from Publication:6536223)
Recommendations
- scientific article; zbMATH DE number 1303956
- scientific article; zbMATH DE number 1303144
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
- Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
- Highly nonlinear (vectorial) Boolean functions that are symmetric under some permutations
Cites work
- A method for constructing bijective S-box with high nonlinearity based on chaos and optimization
- A novel method to design S-box based on chaotic map and genetic algorithm
- scientific article; zbMATH DE number 1612515 (Why is no real title available?)
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1189380 (Why is no real title available?)
- scientific article; zbMATH DE number 1107683 (Why is no real title available?)
- scientific article; zbMATH DE number 1955796 (Why is no real title available?)
- scientific article; zbMATH DE number 1972847 (Why is no real title available?)
- scientific article; zbMATH DE number 2104732 (Why is no real title available?)
- scientific article; zbMATH DE number 1424195 (Why is no real title available?)
- Linear redundancy in S-boxes.
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- The designs of S-boxes by simulated annealing
This page was built for publication: Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536223)