Computing Rijndael's S-Box?

cobussteyn_at_absamail.co.za
Date: 08/28/05 

Date: Sun, 28 Aug 2005 23:02:23 +0200

I'm a newbie when it comes to cryptography and currently I'm hooked on
Rijndael. I know most of the implementations of it have the S-box
hard-coded into the app for speed gain, but I would like to compute
that s-box myself.

You probably know it is defined by the finite field mapping in GF(2^8)
onto its inverse, and then it is transformed by a certain matrix (i
have that one) and then 0x63 is added.

Can someone help me to compute that first mapping of GF(2^8) onto its
inverse? How do you compute the inverse?

Thanx !

Relevant Pages

  • Re: Computing Rijndaels S-Box?
    ... > Rijndael. ... I know most of the implementations of it have the S-box ... > You probably know it is defined by the finite field mapping in GF ...
    (sci.crypt)
  • Re: SPN-based hashing
    ... Any comment on the Anubis cipher? ... Khazad was analyzed in ... The S-box is not algebraic as it is in Rijndael, ... Slightly faster than Rijndael, at least according to the NESSIE Phase ...
    (sci.crypt)
  • Re: Minimum memory footprint implementations
    ... AES's S-Box being the only "big" part fo the cipher: ... I've looked into hardware ... implementations and decided the speed penalty wasn't worth it. ...
    (sci.crypt)