TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Synthesis method for S-boxes satisfying the criterion of correlation immunity of Boolean and 4-functions

* ,

* Corresponding author · click or hover a name for details

pp. 1121–1133Vol. 26Issue 4June 2023DOI: 10.1080/09720529.2021.2018112 Crossmark XML
Received:
01 Jun 2021
Accepted:
01 Nov 2021
Published Online:
29 Mar 2022
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-1532
Pages:
1121–1133

Abstract

The improvement of cryptanalysis methods, in particular, using the mathematical apparatus of many-valued logic functions, determines the need to create methods for the synthesis of cryptographic primitives, first of all, S-boxes that satisfy the criteria of cryptographic quality both in the sense of component Boolean functions, and in the sense of their possible representations by functions of many-valued logic. The most important criterion characterizing the ability of the S-box, and hence, of the entire cryptographic transformation in which it is used, to resist attacks of correlation cryptoanalysis, is the criterion of the correlation immunity of component functions. At the moment, there are no methods for the synthesis of S-boxes that satisfy the criterion of correlation immunity both in the sense of component Boolean functions and in the sense of component functions of many-valued logic, which complicates the further development of symmetric cryptographic algorithms, considering their possible representation using many-valued logic functions. In this paper, we propose a method for the synthesis of a full class of S-boxes of length N=16 corresponding to both the criterion of the correlation immunity of component Boolean functions and the criterion of the correlation immunity of component 4-functions. With the help of the developed method, it was possible to construct a set of 18 304 S-boxes that satisfies the criterion of correlation immunity both in the sense of component Boolean functions and in the sense of component 4-functions. The synthesized class of S-boxes can be used to increase the diffusion and confusion of modern symmetric cryptographic algorithms, as well as to increase their protection against promising cryptanalysis attacks based on many-valued logic functions.

Keywords

Subject Classifications

Classification: (2010) 94A60

References

[1] Shannon C. E. Communication Theory of Secrecy Systems, Bell System Technical Journal, 1949, Vol. 28-4, P. 656-715. DOI: 10.1002/j.1538-7305.1949.tb00928.x
[2] Zhdanov O. N. Methodology for selecting key information for a block cipher algorithm, Moscow : INFRA-M, 2013, 90 p.
[3] Sokolov A. V. New methods of synthesis of nonlinear transformations for modern ciphers. Lap Lambert Academic Publishing, Germany, 2015. 100 p.
[4] Baigneres T., Stern J., Vaudenay S. Linear cryptanalysis of non binary ciphers. International Workshop on Selected Areas in Cryptography, Springer, Berlin, Heidelberg, 2007. P. 184-211. DOI: 10.1007/978-3-540-77360-3_13
[5] Sokolov A. V., Zhdanov O. N. Cryptographic constructions based on many-valued logic functions. Monograph, Moscow: Scientific Thought, 2020, 192 p. DOI: 10.12737/1045434
[6] Salnikov A. A., Logachev O. A. Boolean Functions in Coding Theory & Cryptography, Universities Press (India) Private Limited, 2017, 334 p.
[7] Karelina E. K. On a method of synthesis of correlation-immune Boolean functions. Discrete Mathematics and Applications, 2020, Vol. 30, No. 2, P. 79-91. DOI: 10.1515/dma-2020-0008
[8] Yakovlev S. V. Balanced criteria for the quality of long-term key elements in the GOST 28147-89 algorithm, Information technology and computer engineering, 2009, P. 5-12.
[9] Enaul Haq Shaik & Nakkeeran Rangaswamy. Implementation of 1×2 decoder and XOR-XNOR logic functions on a PhC structure, Journal of Information and Optimization Sciences, 2017, 38:6, P. 953-960. DOI: 10.1080/02522667.2017.1372142
[10] Kim K. Construction of DES-like S-boxes Based on Boolean Functions Satisfying the SAC. Proc. of Asiacrypt’91, Springer Verlag, 1991. P. 59-72. DOI: 10.1007/3-540-57332-1_5
[11] Mazurkov M. I. Synthesis method of optimal substitution constructions based on the criterion of zero correlation between the output and input data vectors, Radioelectronics and Communications Systems, 2012, Vol. 55, No. 12. P. 533-543. DOI: 10.3103/s0735272712120023
[12] Mazurkov M. I., Sokolov A. V. Method of S-boxes synthesis based on the criterion of zero correlation between the output and input data vectors and the strict avalanche criterion. Radioelectronics and Communications Systems, 2014, Vol. 57, No. 8, P. 376-381. DOI: 10.3103/s0735272714080068
[13] Monz T. et al.Realization of a scalable Shor algorithm, Science, 2016, Vol. 351, No. 6277. P. 1068-1070. DOI: 10.1126/science.aad9480
[14] Gerjuoy E. Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers, American journal of physics, 2005, Vol. 73, No. 6, P. 521-540. DOI: 10.1119/1.1891170
[15] Politi A., Matthews J. C. F., O’brien J. L. Shor’s quantum factoring algorithm on a photonic chip, Science, 2009, Vol. 325, No. 5945, P. 1221-1221. DOI: 10.1126/science.1173731
[16] GOST 34.12-2018, Information technology, Cryptographic data security, Block ciphers, Moscow, Standardinform, 17 p.
[17] Gopalakrishnan K. Stinson D. R. Three characterizations of non-binary correlation-immune and resilient functions, Designs, Codes and Cryptography, 1995, 5, P. 241-251. DOI: 10.1007/bf01388386
[18] Sokolov A. V., Zhdanov O. N. Correlation immunity of three-valued logic functions, Journal of Discrete Mathematical Sciences and Cryptography, 2020, P. 1-17. DOI: 10.1080/09720529.2020.1781882
[19] DSTU 7624:2014, Information technologies, Cryptographic data security, Symmetric block transformation algorithm, Ministry of Economic Development of Ukraine, 2016. 221 p.
[20] FIPS 197 [Electronic resource] Advanced encryption standard, 2001, http://csrc.nist.gov/publications/
[21] STB 34.101.31-2011, Information technology and security, Information protection, Cryptographic algorithms for encryption and integrity control, Minsk, Gosstandart, 31 p.

Views: 151Downloads: 5Citations: 5