2019
DOI: 10.47839/ijc.18.3.1519
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic Methods for the Design of Cryptographic Boolean Functions

Abstract: In this article, heuristic methods of hill climbing for cryptographic Boolean functions satisfying the required properties of balance, nonlinearity, autocorrelation, and other stability indicators are considered. A technique for estimating the computational efficiency of gradient search methods, based on the construction of selective (empirical) distribution functions characterizing the probability of the formation of Boolean functions with indices of stability not lower than required, is proposed. As an indic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 45 publications
0
1
0
Order By: Relevance
“…Algorithms such as Genetic Algorithms (GAs) [21][22][23], Simulated Annealing (SA) [17,18], and Hill Climbing [12,15,35] have been extensively applied to generate Sboxes that fulfill specific cryptographic criteria. These methods, characterized by their iterative search processes and flexibility in handling complex optimization problems, offer a dynamic approach to S-box design, contrasting with the static nature of algebraic and combinatorial constructions [36,37].…”
Section: Introductionmentioning
confidence: 99%
“…Algorithms such as Genetic Algorithms (GAs) [21][22][23], Simulated Annealing (SA) [17,18], and Hill Climbing [12,15,35] have been extensively applied to generate Sboxes that fulfill specific cryptographic criteria. These methods, characterized by their iterative search processes and flexibility in handling complex optimization problems, offer a dynamic approach to S-box design, contrasting with the static nature of algebraic and combinatorial constructions [36,37].…”
Section: Introductionmentioning
confidence: 99%