Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Discrete Particle Swarm Optimizer for the Design of Cryptographic Boolean Functions

Published 9 Jan 2024 in cs.NE and cs.CR | (2401.04567v1)

Abstract: A Particle Swarm Optimizer for the search of balanced Boolean functions with good cryptographic properties is proposed in this paper. The algorithm is a modified version of the permutation PSO by Hu, Eberhart and Shi which preserves the Hamming weight of the particles positions, coupled with the Hill Climbing method devised by Millan, Clark and Dawson to improve the nonlinearity and deviation from correlation immunity of Boolean functions. The parameters for the PSO velocity equation are tuned by means of two meta-optimization techniques, namely Local Unimodal Sampling (LUS) and Continuous Genetic Algorithms (CGA), finding that CGA produces better results. Using the CGA-evolved parameters, the PSO algorithm is then run on the spaces of Boolean functions from $n=7$ to $n=12$ variables. The results of the experiments are reported, observing that this new PSO algorithm generates Boolean functions featuring similar or better combinations of nonlinearity, correlation immunity and propagation criterion with respect to the ones obtained by other optimization methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. An evolutionary multiobjective approach to design highly non-linear boolean functions. In H. Lipson, editor, Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pages 749–756. ACM, 2007.
  2. E. Biham and A. Shamir. Differential cryptanalysis of des-like cryptosystems. In A. Menezes and S. A. Vanstone, editors, Advances in Cryptology - CRYPTO ’90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings, volume 537 of Lecture Notes in Computer Science, pages 2–21. Springer, 1990.
  3. C. Carlet. Boolean functions for cryptography and coding theory. Cambridge University Press, 2021.
  4. Evolving constructions for balanced, highly nonlinear boolean functions. In J. E. Fieldsend and M. Wagner, editors, GECCO ’22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9 - 13, 2022, pages 1147–1155. ACM, 2022.
  5. Evolutionary algorithms-assisted construction of cryptographic boolean functions. In F. Chicano and K. Krawiec, editors, GECCO ’21: Genetic and Evolutionary Computation Conference, Lille, France, July 10-14, 2021, pages 565–573. ACM, 2021.
  6. P. Charpin and E. Pasalic. On propagation characteristics of resilient functions. In K. Nyberg and H. M. Heys, editors, Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, St. John’s, Newfoundland, Canada, August 15-16, 2002. Revised Papers, volume 2595 of Lecture Notes in Computer Science, pages 175–195. Springer, 2002.
  7. Almost boolean functions: The design of boolean functions by spectral inversion. Comput. Intell., 20(3):450–462, 2004.
  8. Evolving boolean functions satisfying multiple criteria. In A. Menezes and P. Sarkar, editors, Progress in Cryptology - INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16-18, 2002, volume 2551 of Lecture Notes in Computer Science, pages 246–259. Springer, 2002.
  9. I. Dinur and A. Shamir. Breaking grain-128 with dynamic cube attacks. In A. Joux, editor, Fast Software Encryption - 18th International Workshop, FSE 2011, Lyngby, Denmark, February 13-16, 2011, Revised Selected Papers, volume 6733 of Lecture Notes in Computer Science, pages 167–187. Springer, 2011.
  10. A survey of metaheuristic algorithms for the design of cryptographic boolean functions. Cryptogr. Commun., 15(6):1171–1197, 2023.
  11. Swarm intelligence for permutation optimization: a case study of n-queens problem. In 2003 IEEE Swarm Intelligence Symposium, SIS 2003, Indianapolis, IN, USA, April 24-26, 2003, pages 243–246. IEEE, 2003.
  12. J. Kennedy and R. Eberhart. Particle swarm optimization. In Proceedings of International Conference on Neural Networks (ICNN’95), Perth, WA, Australia, November 27 - December 1, 1995, pages 1942–1948. IEEE, 1995.
  13. J. Kennedy and R. C. Eberhart. A discrete binary version of the particle swarm algorithm. In 1997 IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation, volume 5, pages 4104–4108. IEEE, 1997.
  14. L. R. Knudsen. Truncated and higher order differentials. In B. Preneel, editor, Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14-16 December 1994, Proceedings, volume 1008 of Lecture Notes in Computer Science, pages 196–211. Springer, 1994.
  15. Balanced crossover operators in genetic algorithms. Swarm Evol. Comput., 54:100646, 2020.
  16. L. Mariot and A. Leporati. A genetic algorithm for evolving plateaued cryptographic boolean functions. In A. Dediu, L. Magdalena, and C. Martín-Vide, editors, Theory and Practice of Natural Computing - Fourth International Conference, TPNC 2015, Mieres, Spain, December 15-16, 2015. Proceedings, volume 9477 of Lecture Notes in Computer Science, pages 33–45. Springer, 2015.
  17. L. Mariot and A. Leporati. Heuristic search by particle swarm optimization of boolean functions for cryptographic applications. In S. Silva and A. I. Esparcia-Alcázar, editors, Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, July 11-15, 2015, Companion Material Proceedings, pages 1425–1426. ACM, 2015.
  18. Heuristic search of (semi-)bent functions based on cellular automata. Nat. Comput., 21(3):377–391, 2022.
  19. J. L. Massey. Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory, 15(1):122–127, 1969.
  20. M. Matsui. Linear cryptanalysis method for DES cipher. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT ’93, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, volume 765 of Lecture Notes in Computer Science, pages 386–397. Springer, 1993.
  21. W. Meier and O. Staffelbach. Fast correlation attacks on certain stream ciphers. J. Cryptol., 1(3):159–176, 1989.
  22. The fully informed particle swarm: Simpler, maybe better. IEEE Trans. Evol. Comput., 8(3):204–210, 2004.
  23. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Artificial intelligence. Springer, 1992.
  24. Heuristic design of cryptographically strong balanced boolean functions. In K. Nyberg, editor, Advances in Cryptology - EUROCRYPT ’98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding, volume 1403 of Lecture Notes in Computer Science, pages 489–499. Springer, 1998.
  25. E. Pasalic and T. Johansson. Further results on the relation between nonlinearity and resiliency for boolean functions. In M. Walker, editor, Cryptography and Coding, 7th IMA International Conference, Cirencester, UK, December 20-22, 1999, Proceedings, volume 1746 of Lecture Notes in Computer Science, pages 35–44. Springer, 1999.
  26. The covering radius of the (21515{}^{\mbox{15}}start_FLOATSUPERSCRIPT 15 end_FLOATSUPERSCRIPT, 16) reed-muller code is at least 16276. IEEE Trans. Inf. Theory, 29(3):354–355, 1983.
  27. Simplifying particle swarm optimization. Appl. Soft Comput., 10(2):618–628, 2010.
  28. S. Picek and D. Jakobovic. Evolving algebraic constructions for designing bent boolean functions. In T. Friedrich, F. Neumann, and A. M. Sutton, editors, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016, pages 781–788. ACM, 2016.
  29. Evolving cryptographically sound boolean functions. In C. Blum and E. Alba, editors, Genetic and Evolutionary Computation Conference, GECCO ’13, Amsterdam, The Netherlands, July 6-10, 2013, Companion Material Proceedings, pages 191–192. ACM, 2013.
  30. Cryptographic boolean functions: One output, many design criteria. Appl. Soft Comput., 40:635–653, 2016.
  31. R. Poli. Analysis of the publications on the applications of particle swarm optimisation. Journal of Artificial Evolution and Applications, 2008:1–10, 2008.
  32. N. J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Syst., 5(2), 1991.
  33. R. A. Rueppel and O. Staffelbach. Products of linear recurring sequences with maximum complexity. IEEE Trans. Inf. Theory, 33(1):124–131, 1987.
  34. P. Sarkar and S. Maitra. Nonlinearity bounds and constructions of resilient boolean functions. In M. Bellare, editor, Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings, volume 1880 of Lecture Notes in Computer Science, pages 515–532. Springer, 2000.
  35. Y. Shi and R. C. Eberhart. Parameter selection in particle swarm optimization. In V. W. Porto, N. Saravanan, D. E. Waagen, and A. E. Eiben, editors, Evolutionary Programming VII, 7th International Conference, EP98, San Diego, CA, USA, March 25-27, 1998, Proceedings, volume 1447 of Lecture Notes in Computer Science, pages 591–600. Springer, 1998.
  36. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. Inf. Theory, 30(5):776–780, 1984.
  37. I. C. Trelea. The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf. Process. Lett., 85(6):317–325, 2003.
  38. On the design of s-boxes. In H. C. Williams, editor, Advances in Cryptology - CRYPTO ’85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings, volume 218 of Lecture Notes in Computer Science, pages 523–534. Springer, 1985.
  39. G. Xiao and J. L. Massey. A spectral characterization of correlation-immune combining functions. IEEE Trans. Inf. Theory, 34(3):569–571, 1988.
  40. X.-M. Zhang and Y. Zheng. Gac—the criterion for global avalanche characteristics of cryptographic functions. J. UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 1995, pages 320–337, 1996.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up