[Resource Topic] 2007/214: Matrix Power S-Box Construction

Welcome to the resource topic for 2007/214

Title:
Matrix Power S-Box Construction

Authors: Eligijus Sakalauskas, Kestutis Luksys

Abstract:

The new symmetric cipher S-box construction based on matrix power function is presented. The matrix consisting of plain data bit strings is combined with three round key matrices using arithmetical addition and exponent operations. The matrix power means the matrix powered by other matrix. The left and right side matrix powers are introduced. This operation is linked with two sound one-way functions: the discrete logarithm problem and decomposition problem. The latter is used in the infinite non-commutative group based public key cryptosystems. It is shown that generic S-box equations are not transferable to the multivariate polynomial equations in respect of input and key variables and hence the algebraic attack to determine the key variables cannot be applied in this case. The mathematical description of proposed S-box in its nature possesses a good confusion and diffusion'' properties and contains variables of a complex type’’ as was formulated by Shannon. Some comparative simulation results are presented.

ePrint: https://eprint.iacr.org/2007/214

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .