Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes) (Q6536223)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7834762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes) |
scientific article; zbMATH DE number 7834762 |
Statements
Parallel steepest ascent hill-climbing for high nonlinear Boolean and vectorial Boolean functions (S-boxes) (English)
0 references
19 April 2024
0 references
Boolean functions
0 references
S-boxes
0 references
hill climbing
0 references
cost function
0 references
0 references
0 references
0.7878850698471069
0 references
0.7767210602760315
0 references
0.7727296948432922
0 references
