Matrix Power S-Box Construction

Eligijus Sakalauskas; Kestutis Luksys

Paper 2007/214

Matrix Power S-Box Construction

Eligijus Sakalauskas and 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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: symmetric cipher S-box matrix power one-way functions
Contact author(s): kestutis luksys @ ktu lt
History: 2007-06-06: received
Short URL: https://ia.cr/2007/214
License: CC BY

BibTeX

@misc{cryptoeprint:2007/214,
      author = {Eligijus Sakalauskas and Kestutis Luksys},
      title = {Matrix Power S-Box Construction},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/214},
      year = {2007},
      url = {https://eprint.iacr.org/2007/214}
}