Find a number x (mod pa*pb) such that x = a (mod pa) and x = b (mod pb).

Derives a random number uniformly chosen below the given limit from a random 256 bit seed generated when the application starts.

GetHashNumber uses a hash to generate random numbers of a given bitlength in the fiat-shamir heuristic.

hashCommit computes the sha256 hash over the asn1 representation of a slice of big integers and returns a positive big integer that can be represented with that hash.

intHashSha256 is a utility function compute the sha256 hash over a byte array and return this hash as a big.Int.

legendreSymbol calculates the Legendre symbol (a/p).

modInverse returns ia, the inverse of a in the multiplicative group of prime order n.

modPow computes x^y mod m.

Calculate Sqrt modulo a number with given prime factors.

Calculate sqrt modulo a prime.

RandomBigInt returns a random big integer value in the range [0,(2^numBits)-1], inclusive.

RandomPrimeInRange returns a random probable prime in the range [2^start, 2^start + 2^length] This code is an adaption of Go's own Prime function in rand/util.go.

RepresentToPublicKey returns a representation of the given exponents in terms of the R bases from the public key.

Simple threadsafe cryptographically secure pseudo-random number generator.