An effective genetic algorithm for finding highly nonlinear Boolean functions
From MaRDI portal
Recommendations
- Genetical algorithm obtaining minimal polynomial representations for multi-valued output Boolean functions
- A study of the neutrality of Boolean function landscapes in genetic programming
- Evolutionary optimization algorithms for minimization problem of Boolean functions
- A rigorous analysis of the compact genetic algorithm for linear functions
- Multialternative genetic algorithms for the search of a function extremum
- A class of generalized Boolean functions with high nonlinearity
- A fast and precise genetic algorithm for a nonlinear fitting problem
- scientific article; zbMATH DE number 4114084
Cited in
(13)- Searching nonlinear functions for high values
- A note on rotation symmetric S-boxes
- Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
- Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
- Generation of mutants for boolean expression
- Boolean function design using hill climbing methods
- Genetical algorithm obtaining minimal polynomial representations for multi-valued output Boolean functions
- scientific article; zbMATH DE number 7300318 (Why is no real title available?)
- Weightwise perfectly balanced functions and nonlinearity
- A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
- Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes)
- Application of heuristic methods to search for Boolean functions with good cryptographic characteristics
- Hybrid approach to the search for Boolean functions with high algebraic immunity based on heuristics
This page was built for publication: An effective genetic algorithm for finding highly nonlinear Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373626)
