lambdaworks icon indicating copy to clipboard operation
lambdaworks copied to clipboard

Add GCD as a standalone function

Open dbejarano820 opened this issue 2 years ago • 1 comments
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.

dbejarano820 avatar Sep 14 '23 13:09 dbejarano820

Would this be a GCD for UnsignedInteger? Or some algorithm to use in the of the MontgomeryBackendPrimeFIeld?

MauroToscano avatar Sep 20 '23 17:09 MauroToscano