Search Results for author:
Found 4 papers, 1 papers with code
A Discrete Particle Swarm Optimizer for the Design of Cryptographic Boolean Functions
A Particle Swarm Optimizer for the search of balanced Boolean functions with good cryptographic properties is proposed in this paper.
Evolutionary Construction of Perfectly Balanced Boolean Functions
Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial optimization problem, since they must satisfy several properties to resist cryptanalytic attacks, and the space is very large, which grows super exponentially with the number of input variables.
On the Difficulty of Evolving Permutation Codes
Combinatorial designs provide an interesting source of optimization problems.
Evolutionary Algorithms for Designing Reversible Cellular Automata
Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by a dynamics composed only of disjoint cycles.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
