By Topic

Generating highly nonlinear Boolean functions using a genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dimovski, A. ; Fac. of Natural Sci. & Math., Cyril & Methodius Univ., Skopje, Macedonia ; Gligoroski, D.

In this paper a few algorithms are presented which assist with finding Boolean functions with good cryptographic properties, especially with high nonlinearity. First, a basic hill-climbing algorithm is described which improve the nonlinearity of a Boolean function. Then this algorithm is modified to incorporate a genetic algorithm. It is shown that these new search techniques are extremely powerful when compared to traditional random search techniques. Experimental results successfully prove this statement.

Published in:

Telecommunications in Modern Satellite, Cable and Broadcasting Service, 2003. TELSIKS 2003. 6th International Conference on  (Volume:2 )

Date of Conference:

1-3 Oct. 2003