4 ms·
If you take it one step further and show how it still works modulo p, the algorithm serves as a great introduction to how and why finite fields are used in cry
by bradleyjg 8y ago
If you take it one step further and show how it still works modulo p, the algorithm serves as a great introduction to how and why finite fields are used in cryptography.