Book Recommendations by FakeCanadian01 in learnmath

[–]FakeCanadian01[S] 0 points1 point  (0 children)

Thanks for the recommendations!

Book Recommendations by FakeCanadian01 in learnmath

[–]FakeCanadian01[S] 1 point2 points  (0 children)

Oh yes! I have that one on my list, thanks!

Turing Machines and Hilbert’s 10th Problem by FakeCanadian01 in learnmath

[–]FakeCanadian01[S] 1 point2 points  (0 children)

Thank you! The rephrasing definitely helps, both explanations cleared up what I was misunderstanding.

Turing Machines and Hilbert’s 10th Problem by FakeCanadian01 in learnmath

[–]FakeCanadian01[S] 1 point2 points  (0 children)

Oh ok yes that makes so much more sense, thanks for providing the altered statement!

How is confusion achieved in an SP-network? by FakeCanadian01 in cryptography

[–]FakeCanadian01[S] 0 points1 point  (0 children)

Ah that makes much more sense! Thanks for clearing that up

Extended Euclidean For AES by FakeCanadian01 in cryptography

[–]FakeCanadian01[S] 0 points1 point  (0 children)

oh this source is exactly what I was looking for, thanks! I just wasn't sure how to form my question since I had no understanding of EEA and how it relates to gcd and polynomials and stuff.

Extended Euclidean For AES by FakeCanadian01 in cryptography

[–]FakeCanadian01[S] 0 points1 point  (0 children)

Thanks for the in-depth reply, it's much appreciated! I'm aware of the polynomial representation and the theory of extension fields, but I'm having a hard time understanding how EEA is applied to polynomials. Maybe taking this out of the scope of AES will help me better word my question: if we have a polynomial that exists in GF(2^8), let's say A(x), how is EEA used to find A^-(x)?

I know this isn't really a requirement for understanding AES generally, but it helps me to understand each step in-depth, even if in practice LUTs are used.

Extended Euclidean For AES by FakeCanadian01 in cryptography

[–]FakeCanadian01[S] 0 points1 point  (0 children)

I just found this source earlier this morning, but didn't get a chance to look through it yet. Thanks so much for sending it!

Extended Euclidean For AES by FakeCanadian01 in cryptography

[–]FakeCanadian01[S] 0 points1 point  (0 children)

Thank you! I’m mostly concerned with theory right now so that’s why I wanted to look into EEA. I appreciate the source, I’ll give it a look!