Title
Heuristic Search by Particle Swarm Optimization of Boolean Functions for Cryptographic Applications
Abstract
We present a Particle Swarm Optimizer for generating boolean functions with good cryptographic properties. The proposed algorithm updates the particles positions while preserving their Hamming weights, to ensure that the generated functions are balanced, and it adopts Hill Climbing to further improve their nonlinearity and correlation immunity. The results of the optimization experiments for n=7 to n=12 variables show that this new PSO algorithm finds boolean functions with good trade-offs of nonlinearity, resiliency and Strict Avalanche Criterion.
Year
DOI
Venue
2015
10.1145/2739482.2764674
GECCO (Companion)
Field
DocType
Citations 
Boolean function,Particle swarm optimization,Hamming code,Hill climbing,Heuristic,Mathematical optimization,Correlation immunity,Computer science,Algorithm,Multi-swarm optimization,Circuit minimization for Boolean functions
Conference
6
PageRank 
References 
Authors
0.46
2
2
Name
Order
Citations
PageRank
Luca Mariot14711.35
Alberto Leporati249451.97