Finding linear equivalence of keystream generators using genetic simulated annealing

Information Technology Journal

Volumn 7, Issue 3, 2008, Pages 541-544

  Awad, Wasan Shaker ^a  

^a UNIVERSITY OF BAHRAIN   (Bahrain)

Author keywords

Genetic algorithm; Linear equivalence; Simulated annealing; Stream cipher

Indexed keywords

ANNEALING; CRYPTOGRAPHY; GENETIC ALGORITHMS;

CANDIDATE SOLUTIONS; GENETIC OPERATIONS; KEY STREAMS; KEYSTREAM GENERATORS; LINEAR EQUIVALENCE; LINEAR EQUIVALENCES; NEW APPROACHES; PERFORMANCE EVALUATIONS; SIMULATED ANNEALING ALGORITHMS; STREAM CIPHER;

SIMULATED ANNEALING;

EID: 57149109636     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2008.541.544     Document Type: Article

References (16)

1. Caballero-Gil, P., 2000. New upper bounds on the linear complexity. Comput. Math. Appl., 39 (3): 31-38.
2. Cheng, Y.M. et al., 2007. Performance studies on six heuristic global optimization methods in the location of critical slip surface. Doi: 10.1016/j.compgeo.Ol.004.
3. Clark, J.A. et al., 2004. Searching for Cost Functions. Evolutionary Computation, CEC20004 Special Session on Security and Cryptology, Congress, Portland Oregon, USA., pp: 1517-1524. 4
4. Clark, J.A. and J.L. Jacob, 2004. Almost Boolean functions: The design of Boolean functions by special inversion. Comput. Intel., 20 (3): 450-462.
5. Clark, J.A. et al., 2005. The design of S-boxes by simulated annealing. Evolutionary Comput, 23(3): 219-231.
6. Garcia, L.J. and A. Fuster-Sabater, 2000. On the linear complexity of the sequences generated by nonlinear filtering. Inform. Process. Lett, 76 (1): 67-73.
7. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison- Wesley.
8. Golic, J.D.J. et al., 1996. Discrete optimization and fast correlation attacks. Lecture Notes Comput. Sci., 1029: 186-200.
9. Holland, J.H., 1975. Adaptive in natural and artificial systems. Ann Arbor, University of Michigan.
10. Kirkpatrik, S. et al., 1983. Optimization by simulated annealing. Science, 220(4598): 671-680.
11. Massey, J.L., 1969. Shift register synthesis and BCH decoding. IEEE Trans. Inform. Theor. IT., 15(1): 122-127.
12. Sadegheih, A., 2007. Sequence optimization and design of allocation using GA and SA. Applied Math. Comput., 186(2): 1723-1730.
13. Schneier, B., 1996. Applied Cryptography. John Wiley and Sons.
14. Wong, Z., M. Rahman and Y. Wong, 2005. GECCO 05, June 25-29, Washington, DC, USA.
15. Yong, L., K. Lishan and D.J. Evans, 1995. The annealing evolution algorithm as function optimizer. Parallel Comput., 21 (3): 389-400.
16. Zeng, K., C. Yang and T.R.N. Rao, 1991. Pseudorandom bit generator in stream cipher cryptography. Computer, 24(2): 8-17.