Aslan, BoraSakallı, Muharrem TolgaBuluş, Ercan2022-05-112022-05-112008978-3-540-69498-40302-97431611-3349https://hdl.handle.net/20.500.11776/60612nd International Workshop on Arithmetic of Finite Fields -- JUL 06-09, 2008 -- Siena, ITALYS-boxes are vital elements in the design of symmetric ciphers. To date, the techniques for the construction of S-boxes have included pseudo-random generation, finite field inversion, power mappings and heuristic techniques. From these techniques, the use of finite field inversion in the construction of an S-box is so popular because it presents good cryptographic properties. On the other hand, while S-boxes such as AES, Shark, Square and Hierocrypt that are based on inversion mapping over GF(2(n)) use an affine transformation after the output of the S-box, in some ciphers like Camellia, an additional affine transformation is used before the input. In this paper, we classify 8-bit to 8-bit S-boxes based on power mappings into classes according to DDT and LAT distributions. Moreover, a formula is given for the calculation of the number of terms in the algebraic expression for a power mapping based S-box according to the given three probable cases.eninfo:eu-repo/semantics/closedAccessS-boxespower mappingsclassificationDDTLATBinary M-SequencesCross-CorrelationGf(2(N))WelchProofConference Object5130123+N/AWOS:0002583193000112-s2.0-49949108557Q3