Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 130))

Abstract

Feistel cipher based cryptographic algorithms like DES are very hard for the cryptanalysts as their internal structures are based on high nonlinearity and low autocorrelation. It has been shown that the traditional and brute-force type attacks are insignificant for the cryptanalysis of this type of algorithms. Swarm intelligence is an exciting new research field and shown their effectiveness, robustness to solve a wide variety of complex problems. Therefore, in this paper, Binary Particle Swarm Optimization (BPSO) strategy is used for cryptanalysis of DES symmetric key cryptographic algorithm. The reported results show that it is very promising to solve block cipher based cryptographic optimization problem through meta heuristic techniques.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Arumugam, M.S., Rao, M.V.C., Tan, A.W.C.: A novel and effective particle swarm optimization like algorithm with extrapolation technique. Applied Soft Computing 9(1), 308–320 (2009)

    Article  Google Scholar 

  2. Biham, E., Shamir, A.: Differential cryptanalysis of des-like cryptosystems. Journal of CRYPTOLOGY 4(1), 3–72 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 3. IEEE (1999)

    Google Scholar 

  4. Thakur, M., Deep, K.: A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation 188(1), 895–911 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Diffie, W., Hellman, M.E.: Special feature exhaustive cryptanalysis of the nbs data encryption standard. Computer 10(6), 74–84 (1977)

    Article  Google Scholar 

  6. Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 2. IEEE (1999)

    Google Scholar 

  7. Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 Congress on Evolutionary Computation, vol. 1, pp. 84–88. IEEE (2000)

    Google Scholar 

  8. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE (1995)

    Google Scholar 

  9. Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics, ’Computational Cybernetics and Simulation’, vol. 5, pp. 4104–4108. IEEE (1997)

    Google Scholar 

  10. Laskari, E.C., Meletiou, G.C., Stamatiou, Y.C., Vrahatis, M.N.: Evolutionary computation based cryptanalysis: A first study. Nonlinear Analysis 63(5-7), e823–e830 (2005)

    Article  MathSciNet  Google Scholar 

  11. Passino, K.M.: Bacterial foraging optimization. International Journal of Swarm Intelligence Research (IJSIR) 1(1), 1–16 (2010)

    Article  MathSciNet  Google Scholar 

  12. Price, K.V., Storn, R.M., Lampinen, J.A.: Differential evolution: a practical approach to global optimization. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  13. Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: The 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, pp. 69–73. IEEE (1998)

    Google Scholar 

  14. Shi, Y., Eberhart, R.: Parameter Selection in Particle Swarm Optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Williamson, D.F., Parker, R.A., Kendrick, J.S.: The box plot: a simple visual method to interpret data. Annals of Internal Medicine 110(11), 916 (1989)

    Google Scholar 

  16. Yagmahan, B., Yenisey, M.M.: Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering 54(3), 411–420 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shimpi Singh Jadon .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer India Pvt. Ltd.

About this paper

Cite this paper

Jadon, S.S., Sharma, H., Kumar, E., Bansal, J.C. (2012). Application of Binary Particle Swarm Optimization in Cryptanalysis of DES. In: Deep, K., Nagar, A., Pant, M., Bansal, J. (eds) Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011. Advances in Intelligent and Soft Computing, vol 130. Springer, India. https://doi.org/10.1007/978-81-322-0487-9_97

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-0487-9_97

  • Published:

  • Publisher Name: Springer, India

  • Print ISBN: 978-81-322-0486-2

  • Online ISBN: 978-81-322-0487-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics