By Topic

The block cipher for construction of S-boxes based on particle swarm optimization

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

1 Author(s)
Xu Xiangyang ; Dept. of Comput. Sci. & Technol., Changsha Univ., Changsha, China

S-boxes block cipher is the only non-linear components, and its password strength decides the security of the entire block cipher strength. It is very difficult and complex to use the traditional methods of mathematical to construct the S-boxes with good performance. This thesis will put on a new construction of the s-boxes method based on the particle swarm optimization (PSO). This algorithm defines the location of the two particles “addition” operator, replacement of the original speed equation in order to achieve the exchange of information between particles, and the addition of a mutation operator to maintain the population diversity to prevent premature convergence. The experimental results show that it is plausible to use POS to get a group of S-boxes with high non-linearity and low evenness in difference. This structure can effectively reduce the redundant computation to accelerate the convergence speed.

Published in:

Networking and Digital Society (ICNDS), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

30-31 May 2010