Talk:Rijndael S-box

Cryptography: Computer science Low‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
Low	This article has been rated as Low-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Low-importance).

Miscellaneous discussions

As of yet, this page contains lots of tables and code, and little info on the actual design. I'm going to try to add more content about the S-Box itself and how it was designed Ufretin 12:33, 26 January 2007 (UTC)[reply]

The constant part of the affine transformation is wrong. It should be [11000110] (transposed). See the FIPS standard. 84.196.107.235 14:39, 4 March 2007 (UTC)[reply]

Corrected it myself. It is now correct. 84.196.107.235 17:19, 4 March 2007 (UTC)[reply]

Corrected it once more. Somebody changed it back without any explanation. I think if Wikipedia wants to encourage users to correct content they should not undo corrections without proper checking first. I felt really shocked by this. 84.196.107.235 19:00, 4 March 2007 (UTC)[reply]

That was me. My apologies. I've encountered several incidents lately where anonymous users just change numbers with no valid reason. You didn't include an edit summary in your first edit, but I should have checked the talk page anyhow. Thanks for catching the error and making the correction (twice) and I hope you'll continue contributing to Wikipedia.--agr 12:30, 5 March 2007 (UTC)[reply]

Whoever the anonymous user (200.38.123.252) was who edited the page at 22:13, 15 October 2008, that column vector was the right way up before you edited it. Please look at FIPS-197, and try to compute the S-box entry for 1, if you still disagree - you'll see that it is correct like this James mcl (talk) 14:33, 24 October 2008 (UTC)[reply]

This page seems rather unbalanced. Is the assumption that lots of people know how to find the multiplicative inverse in a finite field generated by a polynomial over GF(2), but don't know how matrix multiplication works? 84.127.238.182 (talk) 12:19, 4 October 2011 (UTC)[reply]

initialization of the table left blank

The section where there should be a vector for the sbox in c/c++ is left blank.As well in the inverse sbox. why is that? — Preceding unsigned comment added by 201.54.129.14 (talk) 20:21, 27 July 2012 (UTC)[reply]

Origin of "a given number in $GF(2^{8})$ "

Can someone coomment on where "a given number in $GF(2^{8})$ " comes from? Is it generated from the key or is it a fixed value on all hosts? Or something different entirely? — Preceding unsigned comment added by 129.215.59.137 (talk) 17:00, 22 February 2014 (UTC)[reply]

C implementation of S-box does not actually work

According to http://www.samiam.org/galois.html, the generators of Rijndael's galois field include 3, 5, 6, 9, ..., but not 2. So the code, which multiplies and divides by 2, will not be able to calculate the S-box for all elements of the field. 74.79.8.168 (talk) 08:27, 22 May 2017 (UTC)[reply]

The code itself is actually correct, it was only the comments that were wrong. The generator 3 and the inverse f6 are used. — Preceding unsigned comment added by Markus Wamser (talk • contribs) 22:12, 25 November 2017 (UTC)[reply]

Dead link

The link under References 3. is dead

Miscellaneous discussions

initialization of the table left blank

Origin of "a given number in G F ( 2 8 ) {\displaystyle GF(2^{8})} "

C implementation of S-box does not actually work

Dead link

Origin of "a given number in $GF(2^{8})$ "