Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms

Algorithm 3

Generation of GA-reset.

Input: The maximum number of iteration .
Output: Cryptographically strong balanced RSBFs
(1)	Generate a set of balanced RSBFs (represented by RSTT) and calculate the fitness function of each individual. Call this set .
(2)	for i = 1 to do:
(3)	for all pairs of the set do
(4)	Perform Algorithm 1 to produce offsprings and compute their values of the fitness function.
(5)	Combine the offspring in the present set, , and choose the best individuals as the new set, .
(6)	Delete duplicate solutions.
(7)	if the fitness of the best solution does not decrease after a number of iterations then
(8)	Retain the best solution and generate randomly balanced RSBFs as the remainder of the set.
(9)	end if
(10)	end for
(11)	end for
(12)	return the best solution from the current set.