- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for fermatInverse (0.25 sec)
-
src/crypto/dsa/dsa.go
priv.Y = new(big.Int) priv.Y.Exp(priv.G, x, priv.P) return nil } // fermatInverse calculates the inverse of k in GF(P) using Fermat's method. // This has better constant-time properties than Euclid's method (implemented // in math/big.Int.ModInverse) although math/big itself isn't strictly // constant-time so it's not perfect. func fermatInverse(k, P *big.Int) *big.Int { two := big.NewInt(2) pMinus2 := new(big.Int).Sub(P, two)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:09:47 UTC 2023 - 7.2K bytes - Viewed (0)