Abstract
Strength of modern ciphers depends largely on cryptographic properties of substitution boxes, such as nonlinearity and transparency order. It is difficult to optimize all such properties because they often contradict each other. In this paper we compare two of the most popular multi-objective genetic algorithms, NSGA-II and its steady-state version, in solving the problem of optimizing invertible substitution boxes. In our research we defined objectives as cryptographic properties and observed how they change within population during experiments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aguirre, H., Okazaki, H., Fuwa, Y.: An evolutionary multiobjective approach to design highly non-linear boolean functions. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 749–756. ACM, New York (2007)
Chafekar, D., Xuan, J., Rasheed, K.: Constrained multi-objective optimization using steady state genetic algorithms. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 813–824. Springer, Heidelberg (2003). doi:10.1007/3-540-45105-6_95
Daemen, J., Rijmen, V.: AES proposal: rijndael (1999)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Durillo, J.J., Nebro, A.J.: jmetal: a Java framework for multi-objective optimization. Adv. Eng. Softw. 42(10), 760–771 (2011)
El-Samak, A.F., Ashour, W.: Optimization of traveling salesman problem using affinity propagation clustering and genetic algorithm. J. Artif. Intell. Soft Comput. Res. 5(4), 239–245 (2015)
Ivanov, G., Nikolov, N., Nikova, S.: Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties. Crypt. Commun. 8(2), 1–30 (2016)
Kapuściński, T., Nowicki, R.K., Napoli, C.: Application of genetic algorithms in the construction of invertible substitution boxes. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2016. LNCS, vol. 9692, pp. 380–391. Springer, Cham (2016). doi:10.1007/978-3-319-39378-0_33
Nebro, A.J., Durillo, J.J.: On the effect of applying a steady-state selection scheme in the multi-objective genetic algorithm nsga-ii. Nat.-Inspired Algorithms Optim. 193, 435–456 (2009)
Parker, M.: Generalised s-box nonlinearity. NESSIE Public Document NES/DOC/UIB/WP5/020/A (2003)
Prouff, E.: DPA attacks and S-boxes. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 424–441. Springer, Heidelberg (2005). doi:10.1007/11502760_29
Shannon, C.E.: Communication theory of secrecy systems*. Bell Syst. Tech. J. 28(4), 656–715 (1949)
Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221–248 (1994)
Yang, C.H., Moi, S.H., Lin, Y.D., Chuang, L.Y.: Genetic algorithm combined with a local search method for identifying susceptibility genes. J. Artif. Intell. Soft Comput. Res. 6(3), 203–212 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kapuściński, T., Nowicki, R.K., Napoli, C. (2017). Comparison of Effectiveness of Multi-objective Genetic Algorithms in Optimization of Invertible S-Boxes. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2017. Lecture Notes in Computer Science(), vol 10246. Springer, Cham. https://doi.org/10.1007/978-3-319-59060-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-59060-8_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59059-2
Online ISBN: 978-3-319-59060-8
eBook Packages: Computer ScienceComputer Science (R0)