New answers tagged

2 votes
Accepted

Carry-less multiplication vs. multiplication in $GF(2^k)$

Firstly, your code is almost correct for multiplication in $GF(2^{32})$ provided that $p$ represents the bit coefficients for the monomials $x^{31},x^{30},\ldots,x^2,x,1$ in a degree 32 irreducible ...
user avatar
  • 9,596
11 votes
Accepted

On what Galois field AES really works?

No, in AES the $a_i$ are not bytes. They are bits. The 8 bits $a_i$ together form a byte, and are considered a single element of the Galois Field ${\operatorname{GF}\left(2^8\right)}$, also noted $\...
user avatar
  • 122k
4 votes

On what Galois field AES really works?

You can see an algebraists view of AES at in a document written by H. W. Lenstra. There is also the more detailed The Design of Rijndael document by the designers at Daemen's homepage. Specifically ...
user avatar
  • 16.1k

Top 50 recent answers are included