Comments on: AES Explained

By: CPUs Notebooks mit AES-NI - AES-Hardwarebeschleunigung für TrueCrypt-Verschlüsselung ... ScareWare.de

Fri, 27 Aug 2010 09:01:08 +0000

[...] AES erklärt, mit C-Schnipseln [...]

By: X-N2O

X-N2O — Fri, 23 Jul 2010 10:03:03 +0000

Hello Nathan,

Yes, m(x) is irreducible. It needs to be irreducible, because else the result of the multiplication cannot have a multiplicative inverse. http://en.wikipedia.org/wiki/Modular_multiplicative_inverse states clearly that “The multiplicative inverse of a modulo m exists iff a and m are coprime (i.e., if gcd(a, m) = 1).”

The definition of irreducible polynomials is as follows (fips-197.pdf page 10): “A polynomial is
irreducible if its only divisors are one and itself.” That’s pretty much also the definition of prime numbers.

By: Nathan

Nathan — Fri, 23 Jul 2010 01:34:59 +0000

Is m(x) irreducible? Would you mind elaborating on the necessity of modulo an irreducible polynomial over finite fields?

By: ali farmani

ali farmani — Thu, 20 May 2010 12:15:14 +0000

hi
i implement aes algorithm your algorithm is funny and good .

By: casperDT

casperDT — Sun, 02 May 2010 10:54:10 +0000

This article is just PERFECT

thank you, keep going