By Topic

Collective Behavior of Rules for Cellular Automata-based Stream Ciphers

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

3 Author(s)
Szaban, M. ; The University of Podlasie, Computer Science Department, Sienkiewicza 51, 08-110 Siedlce, Poland, Email: ; Seredynski, F. ; Bouvry, P.

The problem of generation by cellular automata of high quality pseudorandom sequences useful in cryptography is considered in the paper. For this purpose one dimensional nonuniform cellular automata is considered. The quality of pseudorandom sequences generated by cellular automata depends on collective behavior of rules assigned to cellular automata cells. Genetic algorithm is used to find suitable rules from predefined earlier set of rules. It has been shown that genetic algorithm eliminates bad subsets of rules and founds subsets of rules, which provide high quality pseudorandom sequences. These sequences are suitable for symmetric key cryptography and can be used in different cryptographic modules.

Published in:

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Date of Conference:

0-0 0