Paper title:

Keystream Generator Based On Simulated Annealing

Published in: Issue 1, (Vol. 5) / 2011
Publishing date: 2010-04-29
Pages: 48-53
Author(s): ABDULSALAM A. Ayad
Abstract. Advances in the design of keystream generator using heuristic techniques are reported. A simulated annealing algorithm for generating random keystream with large complexity is presented. Simulated annealing technique is adapted to locate these requirements. The definitions for some cryptographic properties are generalized, providing a measure suitable for use as an objective function in a simulated annealing algorithm, seeking randomness that satisfy both correlation immunity and the large linear complexity. Results are presented demonstrating the effectiveness of the method.
Keywords: Simulated Annealing, Stream Cipher, Keystream Generator, Randomness, Linear Complexity
References:

1. Gustafson H., et al, “A Computer Package Measuring the Strength of Encryption Algorithms”, Elsevier Science Ltd., 1994.

2. Schneier B.,” Applied cryptography, protocols, algorithms, and Source code in C language”, John Wiley and Sons, (1996).

3. Peter Salamon, Richard Frost, “Facts, Conjectures, and Improvement for Simulated Annealing”, Siam, 2002.

4. Alhamdani W. and Awad W. Sh., “Automated Stream Cipher Design using Genetic Programming”, Baghdad, 1999.

5. Alshamary H. F., “Key Generation Using Genetic Algorithm”, Ph.D. Thesis, Univ. of Technology, Baghdad, 1999.

6. Clark A., Millan W., “Heuristic Design of Cryptographically Strong Balanced Boolean Functions”, In advances in Cryptology EUROCRYPT’98, springer Verlag LNCS, pp:489-499, 1998.

7. Arnab Das, Bikas K. chakrabart, “ Simulated Annealing and Releted Optimization Methods”. Springer, 2005.

8. James R, and D.B. Carpenter., ”A distributed implementation of simulated annealing for the travellingsalesman problem”, parallel computing:10, pp:335-338, 1989.

9. Rich E. and Knight K., “Artificial Intelligence”, Second ed., McGraw-Hill, 1992.

Back to the journal content
Creative Commons License
This article is licensed under a
Creative Commons Attribution-ShareAlike 4.0 International License.
Home | Editorial Board | Author info | Archive | Contact
Copyright JACSM 2007-2024