Timeline for Design properties of the Rijndael finite field?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14 at 10:02 | comment | added | poncho | @SamGinrich: actually, what I pointed out is that the choice of polynomial is an internal detail; the implementation can tweak the inputs/outputs to make everything work, even if you use a nonstandard polynomial. A side channel attack (which looks at the internal values) may care; an attack that looks at only inputs/outputs does not. | |
| Jun 13 at 21:28 | comment | added | Sam Ginrich | A brute force attack might run with guesses which are not applicable with assumption of the wrong polynomial. | |
| Jul 15, 2017 at 20:36 | comment | added | poncho | @Raza: an irreducible polynomial $P$ is one where there is no nontrivial factorization $P = X \times Y$ (where the factorization $P = 1 \times P = P \times 1$ are considered trivial). A primitive polynomial $P$ is one where the polynomial $x^i \bmod P$ can take on all possible polynomials (except for 0) of degree less than the degree of $P$. If a polynomial is primitive, it will also be irreducible (but not necessarily the other way around) | |
| Jul 15, 2017 at 18:49 | comment | added | crypt | whats the difference between primitive polynomial and irreducible polynomial? | |
| Jan 22, 2012 at 8:24 | comment | added | Jyrki Lahtonen | +1 for the last paragraph alone! A polynomial with an even number of terms is never irreducible over GF(2). | |
| Nov 28, 2011 at 22:58 | history | answered | poncho | CC BY-SA 3.0 |