A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Boolean functions are mathematical objects used in diverse domains and have been
actively researched for several decades already. One domain where Boolean functions play …
actively researched for several decades already. One domain where Boolean functions play …
Toward more efficient heuristic construction of Boolean functions
Boolean functions have numerous applications in domains as diverse as coding theory,
cryptography, and telecommunications. Heuristics play an important role in the construction …
cryptography, and telecommunications. Heuristics play an important role in the construction …
Evolutionary algorithms for boolean functions in diverse domains of cryptography
The role of Boolean functions is prominent in several areas including cryptography,
sequences, and coding theory. Therefore, various methods for the construction of Boolean …
sequences, and coding theory. Therefore, various methods for the construction of Boolean …
An improved hybrid genetic algorithm to construct balanced Boolean function with optimal cryptographic properties
PK Behera, S Gangopadhyay - Evolutionary Intelligence, 2022 - Springer
Boolean functions are used as nonlinear filter functions and combiner functions in several
stream ciphers. The security of these stream ciphers largely depends upon cryptographic …
stream ciphers. The security of these stream ciphers largely depends upon cryptographic …
Artificial intelligence for the design of symmetric cryptographic primitives
This chapter provides a general overview of AI methods used to support the design of
cryptographic primitives and protocols. After giving a brief introduction to the basic concepts …
cryptographic primitives and protocols. After giving a brief introduction to the basic concepts …
Evolving constructions for balanced, highly nonlinear boolean functions
Finding balanced, highly nonlinear Boolean functions is a difficult problem where it is not
known what nonlinearity values are possible to be reached in general. At the same time …
known what nonlinearity values are possible to be reached in general. At the same time …
Heuristic search of (semi-) bent functions based on cellular automata
An interesting thread in the research of Boolean functions for cryptography and coding
theory is the study of secondary constructions: given a known function with a good …
theory is the study of secondary constructions: given a known function with a good …
Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata
We investigate the design of Orthogonal Latin Squares (OLS) by means of Genetic
Algorithms (GA) and Genetic Programming (GP). Since we focus on Latin squares …
Algorithms (GA) and Genetic Programming (GP). Since we focus on Latin squares …
A genetic algorithm for evolving plateaued cryptographic boolean functions
L Mariot, A Leporati - International Conference on Theory and Practice of …, 2015 - Springer
We propose a genetic algorithm (GA) to search for plateaued boolean functions, which
represent suitable candidates for the design of stream ciphers due to their good …
represent suitable candidates for the design of stream ciphers due to their good …
Evolutionary search of binary orthogonal arrays
Orthogonal Arrays (OA) represent an interesting breed of combinatorial designs that finds
applications in several domains such as statistics, coding theory, and cryptography. In this …
applications in several domains such as statistics, coding theory, and cryptography. In this …