Evolving Highly Nonlinear Balanced Boolean Functions Using Genetic Algorithm with Variable Neighborhood Search

Cryptographic Boolean functions are building blocks of stream and block ciphers based symmetric cryptosystems. These functions should possess high nonlinearity, low autocorrelation, and balancedness to resist attacks like linear and differential cryptanalysis. The exponential search space of size 22n exhibits significant optimization challenges. This paper proposes an enhanced hybrid genetic algorithm (HGA) integrated with variable neighborhood search (VNS) to address optimization issues. The HGA employs a dynamic fitness function, spectrum-aware crossover, VNS perturbations, and tabu list enforcement, guided by Fast Walsh-Hadamard Transform (FWHT) spectral analysis. For even n, it produces balanced functions with nonlinearity near theoretical limits and imbalanced near-bent functions with maximal nonlinearity, suitable for stream and block ciphers, respectively. For odd n, it consistently generates balanced functions with robust cryptographic properties. Experimental results validate the algorithm’s effectiveness across various input sizes, enhancing resistance to cryptanalytic attacks.

Authors

Publication Details

Journal
Advances in Nonlinear Variational Inequalities
Published
2024-08-31
DOI
https://doi.org/10.52783/anvi.v27.5866
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evolving Highly Nonlinear Balanced Boolean Functions Using Genetic Algorithm with Variable Neighborhood Search

Ankit Kumar
Advances in Nonlinear Variational Inequalities
Coding theory and cryptography
article

Evolving Highly Nonlinear Balanced Boolean Functions Using Genetic Algorithm with Variable Neighborhood Search

Ankit Kumar
article en

Abstract

Cryptographic Boolean functions are building blocks of stream and block ciphers based symmetric cryptosystems. These functions should possess high nonlinearity, low autocorrelation, and balancedness to resist attacks like linear and differential cryptanalysis. The exponential search space of size 22n exhibits significant optimization challenges. This paper proposes an enhanced hybrid genetic algorithm (HGA) integrated with variable neighborhood search (VNS) to address optimization issues. The HGA employs a dynamic fitness function, spectrum-aware crossover, VNS perturbations, and tabu list enforcement, guided by Fast Walsh-Hadamard Transform (FWHT) spectral analysis. For even n, it produces balanced functions with nonlinearity near theoretical limits and imbalanced near-bent functions with maximal nonlinearity, suitable for stream and block ciphers, respectively. For odd n, it consistently generates balanced functions with robust cryptographic properties. Experimental results validate the algorithm’s effectiveness across various input sizes, enhancing resistance to cryptanalytic attacks.

Advances in Nonlinear Variational InequalitiesVol. 27(4)
Sustainable cities and communities
Openalex Percentile: Top 72%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Evolving Highly Nonlinear Balanced Boolean Functions Using Genetic Algorithm with Variable Neighborhood Search — Ankit Kumar · Advances in Nonlinear Variational Inequalities (2024) | TGRS Research Map | TGRS