Hello,
I am new to applied cryptography and I have some questions concerning the above code and in general Lagrange method and crypto. If the points of the polynomial are selected from a Galois Field (e.g. 2^128) will the Lagrange method be able to estimate the right polynomial? I ask that because in your implementation, you used float numbers instead of integers that GF demands. Also, is there significant difference in using integer arithmetic than finite filed arithmetic? And if there is, when is preferred to use one or the other?
Thank you for your time,
Yiannis
|