Sakallı, Muharrem TolgaAslan, BoraBuluş, ErcanMesut, Andaç ŞahinBüyüksaraço?lu, FatmaKaraahmeto?lu, Osman2022-05-112022-05-112010364214291597836421429181865-0929https://doi.org/10.1007/978-3-642-14292-5_23https://hdl.handle.net/20.500.11776/6063Springer2nd International Conference on 'Networked Digital Technologies', NDT 2010 -- 7 July 2010 through 9 July 2010 -- Prague -- 81400In the literature, there are several proposed block ciphers like AES, Square, Shark and Hierocrypt which use S-boxes that are based on inversion mapping over a finite field. Because of the simple algebraic structure of S-boxes generated in this way, these ciphers usually use a bitwise affine transformation after the inversion mapping. In some ciphers like Camellia, an additional affine transformation is used before the input of the S-box as well. In this paper, we study algebraic expressions of S-boxes based on power mappings with the aid of finite field theory and show that the number of terms in the algebraic expression of an S-box based on power mappings changes according to the place an affine transformation is added. Moreover, a new method is presented to resolve the algebraic expression of the AES S-box like S-boxes according to the given three probable cases. © 2010 Springer-Verlag.en10.1007/978-3-642-14292-5_23info:eu-repo/semantics/closedAccessAlgebraic ExpressionFinite FieldsPower MappingsS-boxesAffine transformationsAlgebraic expressionAlgebraic structuresBlock ciphersFinite field theoryFinite fieldsPower MappingsS-boxesCryptographyFinite element methodMappingAlgebraConference Object87 CCISPART 12132272-s2.0-77955750133Q4