lambdaworks
lambdaworks copied to clipboard
Add GCD as a standalone function
trafficstars
We are currently using the extended euclidean algorithm when calculating multiplicative inverses. We could also add the computation of the greatest common divisor as a standalone function.
Would this be a GCD for UnsignedInteger? Or some algorithm to use in the of the MontgomeryBackendPrimeFIeld?