Extending Nyberg construction on Galois fields of odd characteristic
DOI:
https://doi.org/10.3103/S0735272717120032Keywords:
S-box, Nyberg construction, three-valued logicAbstract
As is known, the Nyberg design S-boxes possess the cryptographic properties valuable for practical application. Up to date this construction has been considered only for fields of characteristic 2. This paper presents an extension of the Nyberg construction to the fields of odd characteristic. The notion of nonlinearity distance of p-function is introduced, and the affine ternary code is built. The Nyberg design S-boxes with fields characteristic p = 3 for all lengths N <= 243 are built. The nonlinearity distances are calculated, and it is shown that with an increase of S-box length, these distances increase essentially faster as compared to the fields of characteristic p = 2.References
ZHDANOV, O.N. The Technique of Core Information Selection for Block Encryption Algorithm [in Russian]. Moscow: INFRA-M, 2013.
SOKOLOV, A.V. New Methods for Synthesis of Nonlinear Transformations of Modern Ciphers [in Russian]. Germany: Lap Lambert Academic Publishing, 2015.
Standard GOST 28147-89. Data Processing Systems. Cryptographic Security. Cryptographic Transformation Algorithm. Moscow: IPK Izdatel’stvo standartov, 1996.
MISTER, S.; ADAMS, C. Practical S-box design. Proc. of Workshop in Selected Areas of Cryptography, SAC’96, 1996, p.61-76. URI: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.7715&rep=rep1&type=pdf.
MEDVEDEVA, T.E. The S-boxes cryptography robustness assessment of GOST 28147-89 algorithm.” Reshetnevskie Chteniya, p.666-667, 2012. URI: http://disk.sibsau.ru/website/reshetnevsite/materials/2012_2.pdf.
CHALKIN, T.A. Development of the parameter selection technique for the algorithm of constructing S-boxes of the block cipher standard GOST 28147-89. Proc. of III Int. Conf. on Pressing Security Problems of Information Technologies, 2009, Sib. Gos. Aerokosmich. Un-t, Russia. Krasnoyarsk, 2009.
FIPS 197. Advanced encryption standard, 2001. URI: http://csrc.nist.gov/publications/.
NYBERG, K. Differentially uniform mappings for cryptography. Advances in cryptology. Proc. of EUROCRYPT’93, Lecture Notes in Computer Science, v.765, p.55-65, 1994. DOI: https://doi.org/10.1007/3-540-48285-7_6.
MAZURKOV, M.I.; SOKOLOV, A.V. Nonlinear transformations based on complete classes of isomorphic and automorphic representations of field GF(256). Radioelectron. Commun. Syst., v.56, n.11, p.513-521, 2013. DOI: https://doi.org/10.3103/S0735272713110022.
MAZURKOV, M.I.; SOKOLOV, A.V. Cryptographic properties of nonlinear transform of Rijndael cipher based on complete classes of irreducible polynomials. Odes’kyi Politechnichnyi Universystet. Pratsi, n.2, p.183, 2012. URI: http://pratsi.opu.ua/articles/show/864.
AMBROSIMOV, A.S. Properties of bent functions of q-valued logic over finite fields. Discrete Math. Appl., v.4, n.4, p.341, 1994. DOI: https://doi.org/10.1515/dma.1994.4.4.341.
LIDL, R.; NIEDERREITER, H. Finite Fields, 2nd ed. CUP, 1994.
KIM, Y.-S.; JANG, J.-W.; NO, J.-S.; HELLESETH, T. On p-ary bent functions defined on finite fields. Mathematical Properties of Sequences and Other Combinatorial Structures. The Springer International Series in Engineering and Computer Science, v.726. Boston, MA: Springer, 2002, p.65-76. DOI: https://doi.org/10.1007/978-1-4615-0304-0_8.
ZHDANOV, O.N.; SOKOLOV, A.V. Block symmetric cryptographic algorithm based on principles of variable block length and many-valued logic. Far East J. Electronics Commun., v.16, n.3, p.573-589, 2016. DOI: http://dx.doi.org/10.17654/EC016030573.
