type math/big.Int
658 uses
math/big (current package)
float.go#L592: func (z *Float) SetInt(x *Int) *Float {
float.go#L1074: func (x *Float) Int(z *Int) (*Int, Accuracy) {
float.go#L1080: z = new(Int)
float.go#L1102: z = new(Int)
int.go#L25: type Int struct {
int.go#L30: var intOne = &Int{false, natOne}
int.go#L38: func (x *Int) Sign() int {
int.go#L49: func (z *Int) SetInt64(x int64) *Int {
int.go#L61: func (z *Int) SetUint64(x uint64) *Int {
int.go#L68: func NewInt(x int64) *Int {
int.go#L69: return new(Int).SetInt64(x)
int.go#L73: func (z *Int) Set(x *Int) *Int {
int.go#L86: func (x *Int) Bits() []Word {
int.go#L95: func (z *Int) SetBits(abs []Word) *Int {
int.go#L102: func (z *Int) Abs(x *Int) *Int {
int.go#L109: func (z *Int) Neg(x *Int) *Int {
int.go#L116: func (z *Int) Add(x, y *Int) *Int {
int.go#L137: func (z *Int) Sub(x, y *Int) *Int {
int.go#L158: func (z *Int) Mul(x, y *Int) *Int {
int.go#L176: func (z *Int) MulRange(a, b int64) *Int {
int.go#L197: func (z *Int) Binomial(n, k int64) *Int {
int.go#L202: var a, b Int
int.go#L211: func (z *Int) Quo(x, y *Int) *Int {
int.go#L220: func (z *Int) Rem(x, y *Int) *Int {
int.go#L238: func (z *Int) QuoRem(x, y, r *Int) (*Int, *Int) {
int.go#L247: func (z *Int) Div(x, y *Int) *Int {
int.go#L249: var r Int
int.go#L264: func (z *Int) Mod(x, y *Int) *Int {
int.go#L267: y0 = new(Int).Set(y)
int.go#L269: var q Int
int.go#L296: func (z *Int) DivMod(x, y, m *Int) (*Int, *Int) {
int.go#L299: y0 = new(Int).Set(y)
int.go#L320: func (x *Int) Cmp(y *Int) (r int) {
int.go#L347: func (x *Int) CmpAbs(y *Int) int {
int.go#L373: func (x *Int) Int64() int64 {
int.go#L383: func (x *Int) Uint64() uint64 {
int.go#L388: func (x *Int) IsInt64() bool {
int.go#L397: func (x *Int) IsUint64() bool {
int.go#L424: func (z *Int) SetString(s string, base int) (*Int, bool) {
int.go#L430: func (z *Int) setFromScanner(r io.ByteScanner, base int) (*Int, bool) {
int.go#L443: func (z *Int) SetBytes(buf []byte) *Int {
int.go#L452: func (x *Int) Bytes() []byte {
int.go#L461: func (x *Int) FillBytes(buf []byte) []byte {
int.go#L472: func (x *Int) BitLen() int {
int.go#L478: func (x *Int) TrailingZeroBits() uint {
int.go#L488: func (z *Int) Exp(x, y, m *Int) *Int {
int.go#L496: inverse := new(Int).ModInverse(x, m)
int.go#L531: func (z *Int) GCD(x, y, a, b *Int) *Int {
int.go#L572: func lehmerSimulate(A, B *Int) (u0, u1, v0, v1 Word, even bool) {
int.go#L623: func lehmerUpdate(A, B, q, r, s, t *Int, u0, u1, v0, v1 Word, even bool) {
int.go#L647: func euclidUpdate(A, B, Ua, Ub, q, r, s, t *Int, extended bool) {
int.go#L671: func (z *Int) lehmerGCD(x, y, a, b *Int) *Int {
int.go#L672: var A, B, Ua, Ub *Int
int.go#L674: A = new(Int).Abs(a)
int.go#L675: B = new(Int).Abs(b)
int.go#L681: Ua = new(Int).SetInt64(1)
int.go#L682: Ub = new(Int)
int.go#L686: q := new(Int)
int.go#L687: r := new(Int)
int.go#L688: s := new(Int)
int.go#L689: t := new(Int)
int.go#L794: func (z *Int) Rand(rnd *rand.Rand, n *Int) *Int {
int.go#L808: func (z *Int) ModInverse(g, n *Int) *Int {
int.go#L811: var n2 Int
int.go#L815: var g2 Int
int.go#L818: var d, x Int
int.go#L838: func Jacobi(x, y *Int) int {
int.go#L847: var a, b, c Int
int.go#L897: func (z *Int) modSqrt3Mod4Prime(x, p *Int) *Int {
int.go#L898: e := new(Int).Add(p, intOne) // e = p + 1
int.go#L910: func (z *Int) modSqrt5Mod8Prime(x, p *Int) *Int {
int.go#L913: e := new(Int).Rsh(p, 3) // e = (p - 5) / 8
int.go#L914: tx := new(Int).Lsh(x, 1) // tx = 2*x
int.go#L915: alpha := new(Int).Exp(tx, e, p)
int.go#L916: beta := new(Int).Mul(alpha, alpha)
int.go#L930: func (z *Int) modSqrtTonelliShanks(x, p *Int) *Int {
int.go#L932: var s Int
int.go#L938: var n Int
int.go#L948: var y, b, g, t Int
int.go#L981: func (z *Int) ModSqrt(x, p *Int) *Int {
int.go#L991: x = new(Int).Mod(x, p)
int.go#L1008: func (z *Int) Lsh(x *Int, n uint) *Int {
int.go#L1015: func (z *Int) Rsh(x *Int, n uint) *Int {
int.go#L1032: func (x *Int) Bit(i int) uint {
int.go#L1055: func (z *Int) SetBit(x *Int, i int, b uint) *Int {
int.go#L1072: func (z *Int) And(x, y *Int) *Int {
int.go#L1102: func (z *Int) AndNot(x, y *Int) *Int {
int.go#L1135: func (z *Int) Or(x, y *Int) *Int {
int.go#L1165: func (z *Int) Xor(x, y *Int) *Int {
int.go#L1195: func (z *Int) Not(x *Int) *Int {
int.go#L1211: func (z *Int) Sqrt(x *Int) *Int {
intconv.go#L21: func (x *Int) Text(base int) string {
intconv.go#L30: func (x *Int) Append(buf []byte, base int) []byte {
intconv.go#L39: func (x *Int) String() string {
intconv.go#L67: func (x *Int) Format(s fmt.State, ch rune) {
intconv.go#L182: func (z *Int) scan(r io.ByteScanner, base int) (*Int, int, error) {
intconv.go#L238: func (z *Int) Scan(s fmt.ScanState, ch rune) error {
intmarsh.go#L18: func (x *Int) GobEncode() ([]byte, error) {
intmarsh.go#L33: func (z *Int) GobDecode(buf []byte) error {
intmarsh.go#L36: *z = Int{}
intmarsh.go#L49: func (x *Int) MarshalText() (text []byte, err error) {
intmarsh.go#L57: func (z *Int) UnmarshalText(text []byte) error {
intmarsh.go#L69: func (x *Int) MarshalJSON() ([]byte, error) {
intmarsh.go#L74: func (z *Int) UnmarshalJSON(text []byte) error {
prime.go#L26: func (x *Int) ProbablyPrime(n int) bool {
prime.go#L171: intD := &Int{abs: d}
prime.go#L172: intN := &Int{abs: n}
rat.go#L29: a, b Int
rat.go#L303: func (z *Rat) SetFrac(a, b *Int) *Rat {
rat.go#L333: func (z *Rat) SetInt(x *Int) *Rat {
rat.go#L409: func (x *Rat) Num() *Int {
rat.go#L420: func (x *Rat) Denom() *Int {
rat.go#L426: return &Int{abs: nat{1}}
rat.go#L471: func (z *Int) scaleDenom(x *Int, f nat) {
rat.go#L487: var a, b Int
rat.go#L495: var a1, a2 Int
rat.go#L505: var a1, a2 Int
rat.go#L537: var a, b Int
crypto/dsa
dsa.go#L27: P, Q, G *big.Int
dsa.go#L33: Y *big.Int
dsa.go#L39: X *big.Int
dsa.go#L92: q := new(big.Int)
dsa.go#L93: p := new(big.Int)
dsa.go#L94: rem := new(big.Int)
dsa.go#L95: one := new(big.Int)
dsa.go#L138: h := new(big.Int)
dsa.go#L140: g := new(big.Int)
dsa.go#L142: pm1 := new(big.Int).Sub(p, one)
dsa.go#L143: e := new(big.Int).Div(pm1, q)
dsa.go#L164: x := new(big.Int)
dsa.go#L179: priv.Y = new(big.Int)
dsa.go#L188: func fermatInverse(k, P *big.Int) *big.Int {
dsa.go#L190: pMinus2 := new(big.Int).Sub(P, two)
dsa.go#L191: return new(big.Int).Exp(k, pMinus2, P)
dsa.go#L205: func Sign(rand io.Reader, priv *PrivateKey, hash []byte) (r, s *big.Int, err error) {
dsa.go#L219: k := new(big.Int)
dsa.go#L238: r = new(big.Int).Exp(priv.G, k, priv.P)
dsa.go#L247: s = new(big.Int).Mul(priv.X, r)
dsa.go#L273: func Verify(pub *PublicKey, hash []byte, r, s *big.Int) bool {
dsa.go#L287: w := new(big.Int).ModInverse(s, pub.Q)
dsa.go#L296: z := new(big.Int).SetBytes(hash)
dsa.go#L298: u1 := new(big.Int).Mul(z, w)
crypto/ecdsa
ecdsa.go#L47: Inverse(k *big.Int) *big.Int
ecdsa.go#L52: CombinedMult(bigX, bigY *big.Int, baseScalar, scalar []byte) (x, y *big.Int)
ecdsa.go#L62: X, Y *big.Int
ecdsa.go#L89: D *big.Int
ecdsa.go#L129: var one = new(big.Int).SetInt64(1)
ecdsa.go#L133: func randFieldElement(c elliptic.Curve, rand io.Reader) (k *big.Int, err error) {
ecdsa.go#L141: k = new(big.Int).SetBytes(b)
ecdsa.go#L142: n := new(big.Int).Sub(params.N, one)
ecdsa.go#L168: func hashToInt(hash []byte, c elliptic.Curve) *big.Int {
ecdsa.go#L175: ret := new(big.Int).SetBytes(hash)
ecdsa.go#L187: func fermatInverse(k, N *big.Int) *big.Int {
ecdsa.go#L189: nMinus2 := new(big.Int).Sub(N, two)
ecdsa.go#L190: return new(big.Int).Exp(k, nMinus2, N)
ecdsa.go#L200: func Sign(rand io.Reader, priv *PrivateKey, hash []byte) (r, s *big.Int, err error) {
ecdsa.go#L240: func signGeneric(priv *PrivateKey, csprng *cipher.StreamReader, c elliptic.Curve, hash []byte) (r, s *big.Int, err error) {
ecdsa.go#L245: var k, kInv *big.Int
ecdsa.go#L268: s = new(big.Int).Mul(priv.D, r)
ecdsa.go#L291: func Verify(pub *PublicKey, hash []byte, r, s *big.Int) bool {
ecdsa.go#L305: func verifyGeneric(pub *PublicKey, c elliptic.Curve, hash []byte, r, s *big.Int) bool {
ecdsa.go#L307: var w *big.Int
ecdsa.go#L312: w = new(big.Int).ModInverse(s, N)
ecdsa.go#L321: var x, y *big.Int
ecdsa.go#L341: r, s = &big.Int{}, &big.Int{}
ecdsa_noasm.go#L15: func sign(priv *PrivateKey, csprng *cipher.StreamReader, c elliptic.Curve, hash []byte) (r, s *big.Int, err error) {
ecdsa_noasm.go#L19: func verify(pub *PublicKey, c elliptic.Curve, hash []byte, r, s *big.Int) bool {
crypto/elliptic
elliptic.go#L31: IsOnCurve(x, y *big.Int) bool
elliptic.go#L33: Add(x1, y1, x2, y2 *big.Int) (x, y *big.Int)
elliptic.go#L35: Double(x1, y1 *big.Int) (x, y *big.Int)
elliptic.go#L37: ScalarMult(x1, y1 *big.Int, k []byte) (x, y *big.Int)
elliptic.go#L40: ScalarBaseMult(k []byte) (x, y *big.Int)
elliptic.go#L46: P *big.Int // the order of the underlying field
elliptic.go#L47: N *big.Int // the order of the base point
elliptic.go#L48: B *big.Int // the constant of the curve equation
elliptic.go#L49: Gx, Gy *big.Int // (x,y) of the base point
elliptic.go#L59: func (curve *CurveParams) polynomial(x *big.Int) *big.Int {
elliptic.go#L60: x3 := new(big.Int).Mul(x, x)
elliptic.go#L63: threeX := new(big.Int).Lsh(x, 1)
elliptic.go#L73: func (curve *CurveParams) IsOnCurve(x, y *big.Int) bool {
elliptic.go#L75: y2 := new(big.Int).Mul(y, y)
elliptic.go#L84: func zForAffine(x, y *big.Int) *big.Int {
elliptic.go#L85: z := new(big.Int)
elliptic.go#L94: func (curve *CurveParams) affineFromJacobian(x, y, z *big.Int) (xOut, yOut *big.Int) {
elliptic.go#L96: return new(big.Int), new(big.Int)
elliptic.go#L99: zinv := new(big.Int).ModInverse(z, curve.P)
elliptic.go#L100: zinvsq := new(big.Int).Mul(zinv, zinv)
elliptic.go#L102: xOut = new(big.Int).Mul(x, zinvsq)
elliptic.go#L105: yOut = new(big.Int).Mul(y, zinvsq)
elliptic.go#L110: func (curve *CurveParams) Add(x1, y1, x2, y2 *big.Int) (*big.Int, *big.Int) {
elliptic.go#L118: func (curve *CurveParams) addJacobian(x1, y1, z1, x2, y2, z2 *big.Int) (*big.Int, *big.Int, *big.Int) {
elliptic.go#L120: x3, y3, z3 := new(big.Int), new(big.Int), new(big.Int)
elliptic.go#L134: z1z1 := new(big.Int).Mul(z1, z1)
elliptic.go#L136: z2z2 := new(big.Int).Mul(z2, z2)
elliptic.go#L139: u1 := new(big.Int).Mul(x1, z2z2)
elliptic.go#L141: u2 := new(big.Int).Mul(x2, z1z1)
elliptic.go#L143: h := new(big.Int).Sub(u2, u1)
elliptic.go#L148: i := new(big.Int).Lsh(h, 1)
elliptic.go#L150: j := new(big.Int).Mul(h, i)
elliptic.go#L152: s1 := new(big.Int).Mul(y1, z2)
elliptic.go#L155: s2 := new(big.Int).Mul(y2, z1)
elliptic.go#L158: r := new(big.Int).Sub(s2, s1)
elliptic.go#L167: v := new(big.Int).Mul(u1, i)
elliptic.go#L194: func (curve *CurveParams) Double(x1, y1 *big.Int) (*big.Int, *big.Int) {
elliptic.go#L201: func (curve *CurveParams) doubleJacobian(x, y, z *big.Int) (*big.Int, *big.Int, *big.Int) {
elliptic.go#L203: delta := new(big.Int).Mul(z, z)
elliptic.go#L205: gamma := new(big.Int).Mul(y, y)
elliptic.go#L207: alpha := new(big.Int).Sub(x, delta)
elliptic.go#L211: alpha2 := new(big.Int).Add(x, delta)
elliptic.go#L219: x3 := new(big.Int).Mul(alpha, alpha)
elliptic.go#L220: beta8 := new(big.Int).Lsh(beta, 3)
elliptic.go#L228: z3 := new(big.Int).Add(y, z)
elliptic.go#L260: func (curve *CurveParams) ScalarMult(Bx, By *big.Int, k []byte) (*big.Int, *big.Int) {
elliptic.go#L261: Bz := new(big.Int).SetInt64(1)
elliptic.go#L262: x, y, z := new(big.Int), new(big.Int), new(big.Int)
elliptic.go#L277: func (curve *CurveParams) ScalarBaseMult(k []byte) (*big.Int, *big.Int) {
elliptic.go#L285: func GenerateKey(curve Curve, rand io.Reader) (priv []byte, x, y *big.Int, err error) {
elliptic.go#L304: if new(big.Int).SetBytes(priv).Cmp(N) >= 0 {
elliptic.go#L315: func Marshal(curve Curve, x, y *big.Int) []byte {
elliptic.go#L329: func MarshalCompressed(curve Curve, x, y *big.Int) []byte {
elliptic.go#L340: func Unmarshal(curve Curve, data []byte) (x, y *big.Int) {
elliptic.go#L349: x = new(big.Int).SetBytes(data[1 : 1+byteLen])
elliptic.go#L350: y = new(big.Int).SetBytes(data[1+byteLen:])
elliptic.go#L363: func UnmarshalCompressed(curve Curve, data []byte) (x, y *big.Int) {
elliptic.go#L372: x = new(big.Int).SetBytes(data[1:])
elliptic.go#L405: p384.P, _ = new(big.Int).SetString("39402006196394479212279040100143613805079739270465446667948293404245721771496870329047266088258938001861606973112319", 10)
elliptic.go#L406: p384.N, _ = new(big.Int).SetString("39402006196394479212279040100143613805079739270465446667946905279627659399113263569398956308152294913554433653942643", 10)
elliptic.go#L407: p384.B, _ = new(big.Int).SetString("b3312fa7e23ee7e4988e056be3f82d19181d9c6efe8141120314088f5013875ac656398d8a2ed19d2a85c8edd3ec2aef", 16)
elliptic.go#L408: p384.Gx, _ = new(big.Int).SetString("aa87ca22be8b05378eb1c71ef320ad746e1d3b628ba79b9859f741e082542a385502f25dbf55296c3a545e3872760ab7", 16)
elliptic.go#L409: p384.Gy, _ = new(big.Int).SetString("3617de4a96262c6f5d9e98bf9292dc29f8f41dbd289a147ce9da3113b5f0b8c00a60b1ce1d7e819d7a431d7c90ea0e5f", 16)
elliptic.go#L416: p521.P, _ = new(big.Int).SetString("6864797660130609714981900799081393217269435300143305409394463459185543183397656052122559640661454554977296311391480858037121987999716643812574028291115057151", 10)
elliptic.go#L417: p521.N, _ = new(big.Int).SetString("6864797660130609714981900799081393217269435300143305409394463459185543183397655394245057746333217197532963996371363321113864768612440380340372808892707005449", 10)
elliptic.go#L418: p521.B, _ = new(big.Int).SetString("051953eb9618e1c9a1f929a21a0b68540eea2da725b99b315f3b8b489918ef109e156193951ec7e937b1652c0bd3bb1bf073573df883d2c34f1ef451fd46b503f00", 16)
elliptic.go#L419: p521.Gx, _ = new(big.Int).SetString("c6858e06b70404e9cd9e3ecb662395b4429c648139053fb521f828af606b4d3dbaa14b5e77efe75928fe1dc127a2ffa8de3348b3c1856a429bf97e7e31c2e5bd66", 16)
elliptic.go#L420: p521.Gy, _ = new(big.Int).SetString("11839296a789a3bc0045c8a5fb42c7d1bd998f54449579b446817afbd17273e662c97ee72995ef42640c550b9013fad0761353c7086a272c24088be94769fd16650", 16)
p224.go#L26: p224.P, _ = new(big.Int).SetString("26959946667150639794667015087019630673557916260026308143510066298881", 10)
p224.go#L27: p224.N, _ = new(big.Int).SetString("26959946667150639794667015087019625940457807714424391721682722368061", 10)
p224.go#L28: p224.B, _ = new(big.Int).SetString("b4050a850c04b3abf54132565044b0b7d7bfd8ba270b39432355ffb4", 16)
p224.go#L29: p224.Gx, _ = new(big.Int).SetString("b70e0cbd6bb4bf7f321390b94a03c1d356c21122343280d6115c1d21", 16)
p224.go#L30: p224.Gy, _ = new(big.Int).SetString("bd376388b5f723fb4c22dfe6cd4375a05a07476444d5819985007e34", 16)
p224.go#L50: func (curve p224Curve) IsOnCurve(bigX, bigY *big.Int) bool {
p224.go#L80: func (p224Curve) Add(bigX1, bigY1, bigX2, bigY2 *big.Int) (x, y *big.Int) {
p224.go#L98: func (p224Curve) Double(bigX1, bigY1 *big.Int) (x, y *big.Int) {
p224.go#L109: func (p224Curve) ScalarMult(bigX1, bigY1 *big.Int, scalar []byte) (x, y *big.Int) {
p224.go#L120: func (curve p224Curve) ScalarBaseMult(scalar []byte) (x, y *big.Int) {
p224.go#L685: func p224ToAffine(x, y, z *p224FieldElement) (*big.Int, *big.Int) {
p224.go#L690: return new(big.Int), new(big.Int)
p224.go#L726: func p224FromBig(out *p224FieldElement, in *big.Int) {
p224.go#L739: func p224ToBig(in *p224FieldElement) *big.Int {
p224.go#L777: return new(big.Int).SetBytes(buf[:])
p256_asm.go#L41: p256.P, _ = new(big.Int).SetString("115792089210356248762697446949407573530086143415290314195533631308867097853951", 10)
p256_asm.go#L42: p256.N, _ = new(big.Int).SetString("115792089210356248762697446949407573529996955224135760342422259061068512044369", 10)
p256_asm.go#L43: p256.B, _ = new(big.Int).SetString("5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b", 16)
p256_asm.go#L44: p256.Gx, _ = new(big.Int).SetString("6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296", 16)
p256_asm.go#L45: p256.Gy, _ = new(big.Int).SetString("4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5", 16)
p256_asm.go#L113: func (curve p256Curve) Inverse(k *big.Int) *big.Int {
p256_asm.go#L116: k = new(big.Int).Neg(k)
p256_asm.go#L121: k = new(big.Int).Mod(k, p256.N)
p256_asm.go#L197: return new(big.Int).SetBytes(xOut)
p256_asm.go#L201: func fromBig(out []uint64, big *big.Int) {
p256_asm.go#L215: n := new(big.Int).SetBytes(in)
p256_asm.go#L228: func maybeReduceModP(in *big.Int) *big.Int {
p256_asm.go#L232: return new(big.Int).Mod(in, p256.P)
p256_asm.go#L235: func (curve p256Curve) CombinedMult(bigX, bigY *big.Int, baseScalar, scalar []byte) (x, y *big.Int) {
p256_asm.go#L267: func (curve p256Curve) ScalarBaseMult(scalar []byte) (x, y *big.Int) {
p256_asm.go#L276: func (curve p256Curve) ScalarMult(bigX, bigY *big.Int, scalar []byte) (x, y *big.Int) {
p256_asm.go#L313: func (p *p256Point) p256PointToAffine() (x, y *big.Int) {
p256_asm.go#L331: return new(big.Int).SetBytes(xOut), new(big.Int).SetBytes(yOut)
crypto/rand
util.go#L26: var smallPrimesProduct = new(big.Int).SetUint64(16294579238595022365)
util.go#L31: func Prime(rand io.Reader, bits int) (p *big.Int, err error) {
util.go#L43: p = new(big.Int)
util.go#L45: bigMod := new(big.Int)
util.go#L106: func Int(rand io.Reader, max *big.Int) (n *big.Int, err error) {
util.go#L110: n = new(big.Int)
crypto/rsa
pkcs1v15.go#L61: m := new(big.Int).SetBytes(em)
pkcs1v15.go#L62: c := encrypt(new(big.Int), pub, m)
pkcs1v15.go#L146: c := new(big.Int).SetBytes(ciphertext)
pkcs1v15.go#L252: m := new(big.Int).SetBytes(em)
pkcs1v15.go#L285: c := new(big.Int).SetBytes(sig)
pkcs1v15.go#L286: m := encrypt(new(big.Int), pub, c)
pss.go#L216: m := new(big.Int).SetBytes(em)
pss.go#L294: s := new(big.Int).SetBytes(sig)
pss.go#L295: m := encrypt(new(big.Int), pub, s)
rsa.go#L43: N *big.Int // modulus
rsa.go#L102: D *big.Int // private exponent
rsa.go#L103: Primes []*big.Int // prime factors of N, has >= 2 elements.
rsa.go#L184: Dp, Dq *big.Int // D mod (P-1) (or mod Q-1)
rsa.go#L185: Qinv *big.Int // Q^-1 mod P
rsa.go#L196: Exp *big.Int // D mod (prime-1).
rsa.go#L197: Coeff *big.Int // R·Coeff ≡ 1 mod Prime.
rsa.go#L198: R *big.Int // product of primes prior to this (inc p and q).
rsa.go#L209: modulus := new(big.Int).Set(bigOne)
rsa.go#L226: congruence := new(big.Int)
rsa.go#L227: de := new(big.Int).SetInt64(int64(priv.E))
rsa.go#L230: pminus1 := new(big.Int).Sub(prime, bigOne)
rsa.go#L281: primes := make([]*big.Int, nprimes)
rsa.go#L318: n := new(big.Int).Set(bigOne)
rsa.go#L319: totient := new(big.Int).Set(bigOne)
rsa.go#L320: pminus1 := new(big.Int)
rsa.go#L333: priv.D = new(big.Int)
rsa.go#L387: func encrypt(c *big.Int, pub *PublicKey, m *big.Int) *big.Int {
rsa.go#L440: m := new(big.Int)
rsa.go#L442: c := encrypt(new(big.Int), pub, m)
rsa.go#L463: priv.Precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne)
rsa.go#L466: priv.Precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
rsa.go#L469: priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
rsa.go#L471: r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
rsa.go#L477: values.Exp = new(big.Int).Sub(prime, bigOne)
rsa.go#L480: values.R = new(big.Int).Set(r)
rsa.go#L481: values.Coeff = new(big.Int).ModInverse(r, prime)
rsa.go#L489: func decrypt(random io.Reader, priv *PrivateKey, c *big.Int) (m *big.Int, err error) {
rsa.go#L499: var ir *big.Int
rsa.go#L508: var r *big.Int
rsa.go#L509: ir = new(big.Int)
rsa.go#L524: rpowe := new(big.Int).Exp(r, bigE, priv.N) // N != 0
rsa.go#L525: cCopy := new(big.Int).Set(c)
rsa.go#L532: m = new(big.Int).Exp(c, priv.D, priv.N)
rsa.go#L535: m = new(big.Int).Exp(c, priv.Precomputed.Dp, priv.Primes[0])
rsa.go#L536: m2 := new(big.Int).Exp(c, priv.Precomputed.Dq, priv.Primes[1])
rsa.go#L569: func decryptAndCheck(random io.Reader, priv *PrivateKey, c *big.Int) (m *big.Int, err error) {
rsa.go#L577: check := encrypt(new(big.Int), &priv.PublicKey, m)
rsa.go#L606: c := new(big.Int).SetBytes(ciphertext)
crypto/tls
key_schedule.go#L154: x, y *big.Int // public key
crypto/x509
pkcs1.go#L17: N *big.Int
pkcs1.go#L19: D *big.Int
pkcs1.go#L20: P *big.Int
pkcs1.go#L21: Q *big.Int
pkcs1.go#L23: Dp *big.Int `asn1:"optional"`
pkcs1.go#L24: Dq *big.Int `asn1:"optional"`
pkcs1.go#L25: Qinv *big.Int `asn1:"optional"`
pkcs1.go#L31: Prime *big.Int
pkcs1.go#L34: Exp *big.Int
pkcs1.go#L35: Coeff *big.Int
pkcs1.go#L40: N *big.Int
pkcs1.go#L78: key.Primes = make([]*big.Int, 2+len(priv.AdditionalPrimes))
sec1.go#L93: k := new(big.Int).SetBytes(privKey.PrivateKey)
x509.go#L151: SerialNumber *big.Int
x509.go#L163: P, Q, G *big.Int
x509.go#L643: SerialNumber *big.Int
x509.go#L949: var p *big.Int
x509.go#L2745: Number *big.Int
crypto/x509/pkix
pkix.go#L313: SerialNumber *big.Int
encoding/asn1
asn1.go#L134: func parseBigInt(bytes []byte) (*big.Int, error) {
asn1.go#L138: ret := new(big.Int)
asn1.go#L663: bigIntType = reflect.TypeOf(new(big.Int))
asn1.go#L881: case **big.Int:
marshal.go#L197: func makeBigInt(n *big.Int) (encoder, error) {
marshal.go#L207: nMinus1 := new(big.Int).Neg(n)
marshal.go#L476: return makeBigInt(value.Interface().(*big.Int))
github.com/go-git/gcfg
set.go#L116: reflect.TypeOf(big.Int{}): types.Dec | types.Hex,
set.go#L167: reflect.TypeOf(big.Int{}): intSetter,
github.com/jackc/pgtype
numeric.go#L23: var big0 *big.Int = big.NewInt(0)
numeric.go#L24: var big1 *big.Int = big.NewInt(1)
numeric.go#L25: var big10 *big.Int = big.NewInt(10)
numeric.go#L26: var big100 *big.Int = big.NewInt(100)
numeric.go#L27: var big1000 *big.Int = big.NewInt(1000)
numeric.go#L29: var bigMaxInt8 *big.Int = big.NewInt(math.MaxInt8)
numeric.go#L30: var bigMinInt8 *big.Int = big.NewInt(math.MinInt8)
numeric.go#L31: var bigMaxInt16 *big.Int = big.NewInt(math.MaxInt16)
numeric.go#L32: var bigMinInt16 *big.Int = big.NewInt(math.MinInt16)
numeric.go#L33: var bigMaxInt32 *big.Int = big.NewInt(math.MaxInt32)
numeric.go#L34: var bigMinInt32 *big.Int = big.NewInt(math.MinInt32)
numeric.go#L35: var bigMaxInt64 *big.Int = big.NewInt(math.MaxInt64)
numeric.go#L36: var bigMinInt64 *big.Int = big.NewInt(math.MinInt64)
numeric.go#L37: var bigMaxInt *big.Int = big.NewInt(int64(maxInt))
numeric.go#L38: var bigMinInt *big.Int = big.NewInt(int64(minInt))
numeric.go#L40: var bigMaxUint8 *big.Int = big.NewInt(math.MaxUint8)
numeric.go#L41: var bigMaxUint16 *big.Int = big.NewInt(math.MaxUint16)
numeric.go#L42: var bigMaxUint32 *big.Int = big.NewInt(math.MaxUint32)
numeric.go#L43: var bigMaxUint64 *big.Int = (&big.Int{}).SetUint64(uint64(math.MaxUint64))
numeric.go#L44: var bigMaxUint *big.Int = (&big.Int{}).SetUint64(uint64(maxUint))
numeric.go#L46: var bigNBase *big.Int = big.NewInt(nbase)
numeric.go#L47: var bigNBaseX2 *big.Int = big.NewInt(nbase * nbase)
numeric.go#L48: var bigNBaseX3 *big.Int = big.NewInt(nbase * nbase * nbase)
numeric.go#L49: var bigNBaseX4 *big.Int = big.NewInt(nbase * nbase * nbase * nbase)
numeric.go#L52: Int *big.Int
numeric.go#L107: *dst = Numeric{Int: (&big.Int{}).SetUint64(value), Status: Present}
numeric.go#L111: *dst = Numeric{Int: (&big.Int{}).SetUint64(uint64(value)), Status: Present}
numeric.go#L361: func (dst *Numeric) toBigInt() (*big.Int, error) {
numeric.go#L366: num := &big.Int{}
numeric.go#L369: mul := &big.Int{}
numeric.go#L375: div := &big.Int{}
numeric.go#L377: remainder := &big.Int{}
numeric.go#L423: func parseNumericString(str string) (n *big.Int, exp int32, err error) {
numeric.go#L436: accum := &big.Int{}
numeric.go#L478: accum := &big.Int{}
numeric.go#L485: var mul *big.Int
numeric.go#L525: reduced := &big.Int{}
numeric.go#L526: remainder := &big.Int{}
numeric.go#L604: absInt := &big.Int{}
numeric.go#L605: wholePart := &big.Int{}
numeric.go#L606: fracPart := &big.Int{}
numeric.go#L607: remainder := &big.Int{}
numeric.go#L628: divisor := &big.Int{}
golang.org/x/crypto/openpgp/elgamal
elgamal.go#L25: G, P, Y *big.Int
elgamal.go#L31: X *big.Int
elgamal.go#L37: func Encrypt(random io.Reader, pub *PublicKey, msg []byte) (c1, c2 *big.Int, err error) {
elgamal.go#L55: m := new(big.Int).SetBytes(em)
elgamal.go#L62: c1 = new(big.Int).Exp(pub.G, k, pub.P)
elgamal.go#L63: s := new(big.Int).Exp(pub.Y, k, pub.P)
elgamal.go#L77: func Decrypt(priv *PrivateKey, c1, c2 *big.Int) (msg []byte, err error) {
elgamal.go#L78: s := new(big.Int).Exp(c1, priv.X, priv.P)
golang.org/x/crypto/openpgp/packet
encrypted_key.go#L86: c1 := new(big.Int).SetBytes(e.encryptedMPI1.bytes)
encrypted_key.go#L87: c2 := new(big.Int).SetBytes(e.encryptedMPI2.bytes)
packet.go#L559: func writeBig(w io.Writer, i *big.Int) error {
private_key.go#L315: rsaPriv.D = new(big.Int).SetBytes(d)
private_key.go#L316: rsaPriv.Primes = make([]*big.Int, 2)
private_key.go#L317: rsaPriv.Primes[0] = new(big.Int).SetBytes(p)
private_key.go#L318: rsaPriv.Primes[1] = new(big.Int).SetBytes(q)
private_key.go#L341: dsaPriv.X = new(big.Int).SetBytes(x)
private_key.go#L360: priv.X = new(big.Int).SetBytes(x)
private_key.go#L379: D: new(big.Int).SetBytes(d),
public_key.go#L175: func fromBig(n *big.Int) parsedMPI {
public_key.go#L331: N: new(big.Int).SetBytes(pk.n.bytes),
public_key.go#L363: dsa.P = new(big.Int).SetBytes(pk.p.bytes)
public_key.go#L364: dsa.Q = new(big.Int).SetBytes(pk.q.bytes)
public_key.go#L365: dsa.G = new(big.Int).SetBytes(pk.g.bytes)
public_key.go#L366: dsa.Y = new(big.Int).SetBytes(pk.y.bytes)
public_key.go#L388: elgamal.P = new(big.Int).SetBytes(pk.p.bytes)
public_key.go#L389: elgamal.G = new(big.Int).SetBytes(pk.g.bytes)
public_key.go#L390: elgamal.Y = new(big.Int).SetBytes(pk.y.bytes)
public_key.go#L535: if !dsa.Verify(dsaPublicKey, hashBytes, new(big.Int).SetBytes(sig.DSASigR.bytes), new(big.Int).SetBytes(sig.DSASigS.bytes)) {
public_key.go#L541: if !ecdsa.Verify(ecdsaPublicKey, hashBytes, new(big.Int).SetBytes(sig.ECDSASigR.bytes), new(big.Int).SetBytes(sig.ECDSASigS.bytes)) {
public_key.go#L585: if !dsa.Verify(dsaPublicKey, hashBytes, new(big.Int).SetBytes(sig.DSASigR.bytes), new(big.Int).SetBytes(sig.DSASigS.bytes)) {
public_key_v3.go#L107: rsa := &rsa.PublicKey{N: new(big.Int).SetBytes(pk.n.bytes)}
signature.go#L539: var r, s *big.Int
signature.go#L563: func unwrapECDSASig(b []byte) (r, s *big.Int, err error) {
signature.go#L565: R, S *big.Int
golang.org/x/crypto/ssh
kex.go#L88: g, p, pMinus1 *big.Int
kex.go#L91: func (group *dhGroup) diffieHellman(theirPublic, myPrivate *big.Int) (*big.Int, error) {
kex.go#L95: return new(big.Int).Exp(theirPublic, myPrivate, group.p), nil
kex.go#L101: var x *big.Int
kex.go#L112: X := new(big.Int).Exp(group.g, x, group.p)
kex.go#L164: var y *big.Int
kex.go#L174: Y := new(big.Int).Exp(group.g, y, group.p)
kex.go#L276: func unmarshalECKey(curve elliptic.Curve, pubkey []byte) (x, y *big.Int, err error) {
kex.go#L289: func validateECPublicKey(curve elliptic.Curve, x, y *big.Int) bool {
kex.go#L392: p, _ := new(big.Int).SetString("FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE65381FFFFFFFFFFFFFFFF", 16)
kex.go#L394: g: new(big.Int).SetInt64(2),
kex.go#L396: pMinus1: new(big.Int).Sub(p, bigOne),
kex.go#L401: p, _ = new(big.Int).SetString("FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AACAA68FFFFFFFFFFFFFFFF", 16)
kex.go#L404: g: new(big.Int).SetInt64(2),
kex.go#L406: pMinus1: new(big.Int).Sub(p, bigOne),
kex.go#L475: ki := new(big.Int).SetBytes(secret[:])
kex.go#L523: ki := new(big.Int).SetBytes(secret[:])
kex.go#L556: g, p *big.Int
kex.go#L566: func (gex *dhGEXSHA) diffieHellman(theirPublic, myPrivate *big.Int) (*big.Int, error) {
kex.go#L570: return new(big.Int).Exp(theirPublic, myPrivate, gex.p), nil
kex.go#L605: var pMinusOne = &big.Int{}
kex.go#L612: var pHalf = &big.Int{}
kex.go#L618: X := new(big.Int).Exp(gex.g, x, gex.p)
kex.go#L704: p, _ := new(big.Int).SetString("FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E088A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE649286651ECE45B3DC2007CB8A163BF0598DA48361C55D39A69163FA8FD24CF5F83655D23DCA3AD961C62F356208552BB9ED529077096966D670C354E4ABC9804F1746C08CA18217C32905E462E36CE3BE39E772C180E86039B2783A2EC07A28FB5C55DF06F4C52C9DE2BCBF6955817183995497CEA956AE515D2261898FA051015728E5A8AACAA68FFFFFFFFFFFFFFFF", 16)
kex.go#L726: var pHalf = &big.Int{}
kex.go#L734: Y := new(big.Int).Exp(gex.g, y, gex.p)
keys.go#L345: E *big.Int
keys.go#L346: N *big.Int
keys.go#L368: e := new(big.Int).SetInt64(int64(r.E))
keys.go#L373: E *big.Int
keys.go#L374: N *big.Int
keys.go#L425: P, Q, G, Y *big.Int
keys.go#L453: P, Q, G, Y *big.Int
keys.go#L481: r := new(big.Int).SetBytes(sig.Blob[:20])
keys.go#L482: s := new(big.Int).SetBytes(sig.Blob[20:])
keys.go#L683: R *big.Int
keys.go#L684: S *big.Int
keys.go#L787: R *big.Int
keys.go#L788: S *big.Int
keys.go#L1022: R, S *big.Int
keys.go#L1189: P *big.Int
keys.go#L1190: Q *big.Int
keys.go#L1191: G *big.Int
keys.go#L1192: Pub *big.Int
keys.go#L1193: Priv *big.Int
keys.go#L1332: N *big.Int
keys.go#L1333: E *big.Int
keys.go#L1334: D *big.Int
keys.go#L1335: Iqmp *big.Int
keys.go#L1336: P *big.Int
keys.go#L1337: Q *big.Int
keys.go#L1356: Primes: []*big.Int{key.P, key.Q},
keys.go#L1393: D *big.Int
messages.go#L75: X *big.Int `sshtype:"30"`
messages.go#L96: Y *big.Int
messages.go#L104: P *big.Int `sshtype:"31"`
messages.go#L105: G *big.Int
messages.go#L111: X *big.Int `sshtype:"32"`
messages.go#L118: Y *big.Int
messages.go#L472: var n *big.Int
messages.go#L561: var n *big.Int
messages.go#L622: func parseInt(in []byte) (out *big.Int, rest []byte, ok bool) {
messages.go#L627: out = new(big.Int)
messages.go#L660: func intLength(n *big.Int) int {
messages.go#L663: nMinus1 := new(big.Int).Neg(n)
messages.go#L695: func marshalInt(to []byte, n *big.Int) []byte {
messages.go#L705: nMinus1 := new(big.Int).Neg(n)
messages.go#L742: func writeInt(w io.Writer, n *big.Int) {
messages.go#L773: var bigIntType = reflect.TypeOf((*big.Int)(nil))
golang.org/x/crypto/ssh/agent
client.go#L491: N *big.Int
client.go#L492: E *big.Int
client.go#L493: D *big.Int
client.go#L494: Iqmp *big.Int // IQMP = Inverse Q Mod P
client.go#L495: P *big.Int
client.go#L496: Q *big.Int
client.go#L503: P *big.Int
client.go#L504: Q *big.Int
client.go#L505: G *big.Int
client.go#L506: Y *big.Int
client.go#L507: X *big.Int
client.go#L516: D *big.Int
client.go#L611: D *big.Int
client.go#L612: Iqmp *big.Int // IQMP = Inverse Q Mod P
client.go#L613: P *big.Int
client.go#L614: Q *big.Int
client.go#L622: X *big.Int
client.go#L630: D *big.Int
server.go#L254: Primes: []*big.Int{k.P, k.Q},
server.go#L303: func unmarshalECDSA(curveName string, keyBytes []byte, privScalar *big.Int) (priv *ecdsa.PrivateKey, err error) {
server.go#L386: E *big.Int
server.go#L387: N *big.Int
server.go#L403: Primes: []*big.Int{k.Q, k.P},
server.go#L431: P, Q, G, Y *big.Int
google.golang.org/api/idtoken
validate.go#L176: N: new(big.Int).SetBytes(dn),
validate.go#L177: E: int(new(big.Int).SetBytes(de).Int64()),
validate.go#L202: X: new(big.Int).SetBytes(dx),
validate.go#L203: Y: new(big.Int).SetBytes(dy),
vendor/golang.org/x/crypto/cryptobyte
asn1.go#L67: func (b *Builder) AddASN1BigInt(n *big.Int) {
asn1.go#L78: nMinus1 := new(big.Int).Neg(n)
asn1.go#L254: var bigIntType = reflect.TypeOf((*big.Int)(nil)).Elem()
asn1.go#L280: return s.readASN1BigInt(out.(*big.Int))
asn1.go#L303: func (s *String) readASN1BigInt(out *big.Int) bool {
asn1.go#L627: out.(*big.Int).Set(defaultValue.(*big.Int))
 |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |