Skip to main content
SpringerLink
Log in

Designing Stream Cipher Systems Using Genetic Programming

  • Conference paper
Learning and Intelligent Optimization (LION 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6683))

Included in the following conference series:

Abstract

Genetic programming is a good technique for finding near-global optimal solutions for complex problems, by finding the program used to solve the problems. One of these complex problems is designing stream cipher systems automatically. Steam cipher is an important encryption technique used to protect private information from an unauthorized access, and it plays an important role in the communication and storage systems. In this work, we propose a new approach for designing stream cipher systems of good properties, such as high degree of security and efficiency. The proposed approach is based on the genetic programming. Three algorithms are presented here, which are simple genetic programming, simulated annealing programming, and adaptive genetic programming. Experiments were performed to study the effectiveness of these algorithms in solving the underlying problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Szaban, M., Seredynski, F., Bouvry, P.: Collective Behavior of Rules for Cellular Automata-Based Stream Ciphers. In: IEEE Congress on Evolutionary Computation, pp. 179–183 (2006)

    Google Scholar 

  2. Clark, A., Jacob, L.J.: Almost Boolean functions: the design of Boolean functions by spectral inversion. Computational Intelligence 20(3), 450–462 (2004)

    Article  MathSciNet  Google Scholar 

  3. Millan, W., Clark, A., Dawson, E.: An effective genetic algorithm for finding highly nonlinear Boolean functions. In: Proc. 1st Int. Conf. on Information and Communications Security, China, Beijing, pp. 149–158 (1997)

    Google Scholar 

  4. Awad, W.S.: The applications of GA in cryptology. Far East Journal of Experimental and Theoretical Artificial Intelligence 2(1), 59–76 (2008)

    MATH  Google Scholar 

  5. Eiben, A.E., Hinterding, R., Michalewic, Z.: Parameters control in evolutionary algorithms. IEEE Trans. Syst. Man Cybern. 16(1), 122–128 (1999)

    Google Scholar 

  6. Van Laarhoven, P.J.M., et al.: Simulated Annealing: Theory and applications. Reidel, Holland (1987)

    Book  MATH  Google Scholar 

  7. Sadegheih: Sequence optimization and design of allocation using GA and SA. Applied Mathematics and Computation 186(2), 1723–1730 (2007)

    Article  MATH  Google Scholar 

  8. Yuichiro, U., Mitsunori, M., Tomoyuki, H.: Simulated Annealing Programming Using Effective Subtrees. Doshisha Daigaku Rikogaku Kenkyu Hokoku 49(4), 205–209 (2009)

    Google Scholar 

  9. Miki, M., Hashimoto, M., Fujita, Y.: Program Search with Simulated Annealing. In: Proc. of the 9th Annual Conference on Genetic and Evolutionary Computation, London, England, pp. 1754–1754 (2007)

    Google Scholar 

  10. Sivanandam, S.N., Deepa, S.N.: Introduction to genetic algorithms. Springer, New York (2008)

    MATH  Google Scholar 

  11. Srinivas, M., Patnaik, L.M.: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms. IEEE Trans. Systems, Man and Cybernetics 24(4), 656–667 (1994)

    Article  Google Scholar 

  12. Zhang, J., Hu, T.: Adaptive Genetic Algorithm Based on Population Diversity. Computer Engineering and Applications 9(1), 49–51 (2002)

    Google Scholar 

  13. Forouzan, B.A.: Cryptography and network security. McGraw-Hill, New York (2008)

    Google Scholar 

  14. Rueppel, R.A.: Analysis and Design of Stream Cipher. Springer, New York (1986)

    Book  MATH  Google Scholar 

  15. Schneier, B.: Applied cryptography. John Wiley and Sons, New York (1996)

    MATH  Google Scholar 

  16. Golomb, S.W.: Shift Register Sequence. Holden-Day, San Francisco (1967)

    Google Scholar 

  17. Beker, P.F.: Cipher Systems. John Wiley, New York (1982)

    MATH  Google Scholar 

  18. Klapper, G.M.: Feedback shift registers, 2-adic span and combiners with memory. Journal of Cryptology 10(1), 111–147 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Dubrova, E., Teslenko, M., Tenhunen, H.: Analysis and Synthesis of (n,k)-Non-Linear Feedback Shift Registers. In: Proc. of the Conf. on Design, Automation and Test, Munich, Germany, pp. 1286–1290 (2008)

    Google Scholar 

  20. Goresky, M., Klapper, A.: Pseudonoise Sequence Based on Algebraic Feedback Shift Registers. IEEE Trans. Inf. Theory 52(4), 1649–1662 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gustafson, H., et al.: A computer package for measuring the strength of encryption algorithm. Comp. and Sec. 14(1), 687–697 (1994)

    Article  Google Scholar 

  22. Zeng, K., Yang, C., Rao, T.R.N.: Pseudorandom Bit Generator in Stream Cipher Cryptography. Comp. 2(24), 8–17 (1991)

    Article  Google Scholar 

  23. L’ecuyer, P., Simard, R.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22–40 (2007)

    Article  MathSciNet  Google Scholar 

  24. Massey, J.L.: Shift register sequences and BCH decoding. IEEE Trans. on Inf. Theory IT 15(1), 122–127 (1976)

    Article  MATH  Google Scholar 

  25. Eberhart, R., Shi, Y.: Computational Intelligence: concepts to implementation. Morgan Kaufmann, San Francisco (2008)

    MATH  Google Scholar 

  26. Koza, J.R.: Genetic programming. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  27. Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, New York (1989)

    MATH  Google Scholar 

  28. Mitchell, M.: An Introduction to Genetic Algorithm. MIT Press, Cambridge (1996)

    Google Scholar 

  29. Holland, J.H.: Adaptive in natural and artificial systems. University of Michigan, Ann Arbor (1975)

    Google Scholar 

  30. Hirsh, H., Banzhaf, W., Koza, J.R., Ryan, C., Spector, L., Jacob, C.: Genetic programming. IEEE Intelligent Systems 15(3), 74–84 (2000)

    Article  Google Scholar 

  31. Koza, J.R., Keane, M.A., Streeter, M.: What’s AI done for me lately? - genetic programming’s human competitive results. IEEE Intelligent Systems 18(3), 25–31 (2003)

    Article  Google Scholar 

  32. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  33. Kirkpatrik, S., et al.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  34. Yong, L., Lishan, K., Evans, D.J.: The annealing evolution algorithm as function optimizer. Parallel Computing 21(3), 389–400 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  35. Cordon, O., et al.: An Inductive Query by Example Technique for Extended Boolean Queries Based on Simulated-Annealing Programming. In: The Proc. of 7th International ISKO Conference on Challenges in Knowledge Representation and Organization for the 21st Century, pp. 429–436. Integration of Knowledge Across Boundaries, Granada (2002)

    Google Scholar 

  36. Haynes, T., et al.: Strongly typed GP in evolving cooperation strategies. In: Proc. of the sixth Int. Conf. on GA, pp. 271–278. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, College of Information Technology, University of Bahrain, Sakheer, Bahrain

    Wasan Shaker Awad

Authors
  1. Wasan Shaker Awad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departmento de Computation, Centro de Investigacion y de Estudios, Avanzados del Instituto Politecnico Nacional (CINVESTAV-IPN), Av. IPN No. 2508, Col. San Pedro Zacatenco, D.F. 0360, Mexico, Mexico

    Carlos A. Coello Coello

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Awad, W.S. (2011). Designing Stream Cipher Systems Using Genetic Programming. In: Coello, C.A.C. (eds) Learning and Intelligent Optimization. LION 2011. Lecture Notes in Computer Science, vol 6683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25566-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25566-3_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25565-6

  • Online ISBN: 978-3-642-25566-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation