1. Why are we only working in the GF(4)? I understand that mod 2 is too small, but I don't understand why we don't go higher. At the end, it says we use GF(2^n). Were we just limiting it for this section?
2. I am really interested to learn and understand how the laws of GF fit together with elliptic curves and cryptography. I hope to be able to do that in class today.
No comments:
Post a Comment