×

Cryptographic properties of small bijective S-boxes with respect to modular addition. (English) Zbl 1468.94422

Summary: We define affine equivalence of S-boxes with respect to modular addition, and explore its use in cryptanalysis. We have identified classes of small bijective S-boxes with respect to this new equivalence, and experimentally computed their properties.

MSC:

94A60 Cryptography
11T71 Algebraic coding theory; cryptography (number-theoretic aspects)
14G50 Applications to coding theory and cryptography of arithmetic geometry
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Biham, E., Anderson, R., Knudsen, L.: Serpent: a new block cipher proposal. In: International workshop on fast software encryption, pp 222-238. Springer (1998) · Zbl 1385.94015
[2] Biham, E.; Shamir, A., Differential cryptanalysis of DES-like cryptosystems, J Cryptol, 4, 1, 3-72 (1991) · Zbl 0729.68017 · doi:10.1007/BF00630563
[3] Bilgin, B., Nikova, S., Nikov, V., Rijmen, V., Stütz, G.: Threshold implementations of all 3× 3 and 4× 4 S-boxes. In: International workshop on cryptographic hardware and embedded systems, pp 76-91. Springer (2012) · Zbl 1366.94478
[4] Biryukov, A., Perrin, L., Udovenko, A.: Reverse-engineering the S-box of Streebog, Kuznyechik and STRIBOBr1. In: Annual international conference on the theory and applications of cryptographic techniques, pp 372-402. Springer (2016) · Zbl 1385.94016
[5] Bogdanov, A.; Knudsen, LR; Leander, G.; Paar, C.; Poschmann, A.; Robshaw, MJ; Seurin, Y.; Vikkelsoe, C., PRESENT: an ultra-lightweight block cipher (2007), Berlin: Springer, Berlin · Zbl 1142.94334
[6] Brunetta, C.; Calderini, M.; Sala, M., On hidden sums compatible with a given block cipher diffusion layer, Discret. Math., 342, 2, 373-386 (2019) · Zbl 1417.94048 · doi:10.1016/j.disc.2018.10.003
[7] Budaghyan, L., Carlet, C.: CCZ-equivalence of single and multi output Boolean functions. In: Post-proceedings of the 9th international conference on finite fields and their applications Fq, vol. 9, pp 43-54 (2010) · Zbl 1206.94055
[8] Calderini, M., Sala, M.: Elementary abelian regular subgroups as hidden sums for cryptographic trapdoors. arXiv:1702.00581 (2017)
[9] Carlet, C., Vectorial boolean functions for cryptography, Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 134, 398-469 (2010) · Zbl 1209.94036 · doi:10.1017/CBO9780511780448.012
[10] Civino, R.; Blondeau, C.; Sala, M., Differential attacks: using alternative operations, Des. Codes Crypt., 87, 2-3, 225-247 (2019) · Zbl 1454.94059 · doi:10.1007/s10623-018-0516-z
[11] Daemen, J.; Rijmen, V., The design of Rijndael: AES-the advanced encryption standard (2013), Berlin: Springer, Berlin · Zbl 1065.94005
[12] Fontanari, C.; Pulice, V.; Rimoldi, A.; Sala, M., On weakly APN functions and 4-bit S-boxes, Finite Fields and their Applications, 18, 3, 522-528 (2012) · Zbl 1271.94019 · doi:10.1016/j.ffa.2011.11.003
[13] Grošek, O.; Nemoga, K.; Satko, L., Generalized perfectly nonlinear functions, Tatra Mountains Pub., 20, 121-131 (2000)
[14] Kumar, Y.; Mishra, P.; Pillai, NR; Sharma, RK, Affine equivalence and non-linearity of permutations over \(\mathbb{Z}_n\) ℤn, Applicable Algebra in Engineering, Communication and Computing, 28, 3, 257-279 (2017) · Zbl 1366.05003 · doi:10.1007/s00200-016-0307-6
[15] Kutzner, S., Nguyen, P.H., Poschmann, A.: Enabling 3-share threshold implementations for all 4-bit S-boxes. In: International Conference on Information Security and Cryptology, pp 91-108. Springer (2013) · Zbl 1445.94025
[16] Leander, G., Poschmann, A.: On the classification of 4 bit S-boxes. In: International Workshop on the Arithmetic of Finite Fields, pp 159-176. Springer (2007) · Zbl 1184.94239
[17] Matsui, M.: Linear cryptanalysis method for DES cipher. In: Workshop on the Theory and Application of Cryptographic Techniques, pp 386-397. Springer (1993) · Zbl 0951.94519
[18] Nyberg, K.: Perfect nonlinear S-boxes. In: Workshop on the Theory and Application of Of Cryptographic Techniques, pp 378-386. Springer (1991) · Zbl 0766.94012
[19] Nyberg, K.: Differentially uniform mappings for cryptography. In: Workshop on the Theory and Application of Of Cryptographic Techniques, pp 55-64. Springer (1993) · Zbl 0951.94510
[20] Oliynykov, R.; Gorbenko, I.; Kazymyrov, O.; Ruzhentsev, V.; Kuznetsov, O.; Gorbenko, Y.; Dyrda, O.; Dolgov, V.; Pushkaryov, A.; Mordvinov, R., A new encryption standard of Ukraine: The Kalyna block cipher, IACR Cryptology ePrint Archive, 2015, 650 (2015)
[21] Picek, S., Ege, B., Papagiannopoulos, K., Batina, L., Jakobović, D.: Optimality and beyond: the case of 4× 4 S-boxes. In: 2014 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp 80-83. IEEE (2014) · Zbl 1337.94062
[22] Pott, A.; Zhou, Y., CCZ and EA equivalence between mappings over finite abelian groups, Designs, Codes and Cryptography, 66, 1-3, 99-109 (2013) · Zbl 1257.05176 · doi:10.1007/s10623-012-9661-y
[23] Rejewski, M., Mathematical solution of the Enigma cipher, Cryptologia, 6, 1, 1-18 (1982) · doi:10.1080/0161-118291856731
[24] Saarinen, M.J.O.: Cryptographic analysis of all 4× 4-bit S-boxes. In: International Workshop on Selected Areas in Cryptography, pp 118-133. Springer (2011) · Zbl 1292.94132
[25] Zabotin, I., Glazkov, G., Isaeva, V.: Cryptographic protection for information processing systems. Government Standard of the USSR. GOST, pp. 28, 147-89 (1989)
[26] Zajac, P., Constructing S-boxes with low multiplicative complexity, Stud. Sci. Math. Hung., 52, 2, 135-153 (2015) · Zbl 1374.94817
[27] Zajac, P.; Jókay, M., Multiplicative complexity of bijective 4 × 4 S-boxes, Cryptogr. Commun., 6, 3, 255-277 (2014) · Zbl 1294.94087 · doi:10.1007/s12095-014-0100-y
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.