func IsSafePrime(p *big.Int) bool
IsSafePrime reports whether p is (probably) a safe prime. The prime p=2*q+1 is safe prime if both p and q are primes. Note that ProbablyPrime is not suitable for judging primes that an adversary may have crafted to fool the test.
func OmegaNAF(n *big.Int, w uint) (L []int32)
OmegaNAF obtains the window-w Non-Adjacent Form of a positive number n and 1 < w < 32. The returned slice L holds n = sum( L[i]*2^i ).
Reference:
func SafePrime(random io.Reader, bits int) (*big.Int, error)
SafePrime returns a number of the given bit length that is a safe prime with high probability. The number returned p=2*q+1 is a safe prime if both p and q are primes. SafePrime will return error for any error returned by rand.Read or if bits < 2.
func SignedDigit(n *big.Int, w, l uint) []int32
SignedDigit obtains the signed-digit recoding of n and returns a list L of digits such that n = sum( L[i]*2^(i*(w-1)) ), and each L[i] is an odd number in the set {±1, ±3, ..., ±2^(w-1)-1}. The third parameter ensures that the output has ceil(l/(w-1)) digits.
Restrictions:
References:
| Name | Synopsis |
|---|---|
| .. | |
| fp25519 | Package fp25519 provides prime field arithmetic over GF(2^255-19). |
| fp448 | Package fp448 provides prime field arithmetic over GF(2^448-2^224-1). |
| mlsbset | Package mlsbset provides a constant-time exponentiation method with precomputation. |
| polynomial | Package polynomial provides representations of polynomials over the scalars of a group. |