Research Article Open Access

On Partial Linearization of Byte Substitution Transformation of Rijndael-The AES

Y. Talwar, C. E.V. Madhavan and Navin Rajpal

Abstract

Rijndael-The AES[1-3] is 128-bit block cipher based on an elegant algebraic structure over F28. This cipher employs a simple approach to its substitution, permutation (SP) operations. We take a close look at its internals; the byte substitution transformation function is the only non-linear function in Rijndael - The AES. This transformation comprises of two steps operating on each byte. Here we are trying to remodel this to one step operation using indicator vector matrix representation. This representation is further extended to mathematically represent one complete encryption or decryption round of Rijndael the using indicator vector matrix representation that can be explored for better crypto-analysis[4,5] of the cipher.

Journal of Computer Science
Volume 2 No. 1, 2006, 48-52

DOI: https://doi.org/10.3844/jcssp.2006.48.52

Submitted On: 11 July 2005 Published On: 31 January 2006

How to Cite: Talwar, Y., Madhavan, C. E. & Rajpal, N. (2006). On Partial Linearization of Byte Substitution Transformation of Rijndael-The AES. Journal of Computer Science, 2(1), 48-52. https://doi.org/10.3844/jcssp.2006.48.52

  • 2,724 Views
  • 2,426 Downloads
  • 3 Citations

Download

Keywords

  • Rijndael
  • byte substitution transformation
  • indicator vector matrix