math/big.Int.Bytes (method)

25 uses

	math/big (current package)
		int.go#L520: func (x *Int) Bytes() []byte {

	crypto/ecdsa
		ecdsa.go#L143: 	return subtle.ConstantTimeCompare(a.Bytes(), b.Bytes()) == 1
		ecdsa.go#L326: 	s, err := bigmod.NewNat().SetBytes(priv.D.Bytes(), c.N)
		ecdsa.go#L437: 	md.Write(priv.D.Bytes()) // the private key,
		ecdsa.go#L676: 	c.nMinus2 = new(big.Int).Sub(params.N, big.NewInt(2)).Bytes()
		ecdsa_legacy.go#L29: 	priv.PublicKey.X, priv.PublicKey.Y = c.ScalarBaseMult(k.Bytes())
		ecdsa_legacy.go#L95: 			r, _ = c.ScalarBaseMult(k.Bytes())
		ecdsa_legacy.go#L112: 	return encodeSignature(r.Bytes(), s.Bytes())
		ecdsa_legacy.go#L125: 	sig, err := encodeSignature(r.Bytes(), s.Bytes())
		ecdsa_legacy.go#L158: 	x1, y1 := c.ScalarBaseMult(u1.Bytes())
		ecdsa_legacy.go#L159: 	x2, y2 := c.ScalarMult(pub.X, pub.Y, u2.Bytes())

	crypto/rsa
		rsa.go#L152: 	return subtle.ConstantTimeCompare(a.Bytes(), b.Bytes()) == 1
		rsa.go#L660: 		m = bigmod.NewNat().Exp(c, priv.D.Bytes(), N)
		rsa.go#L664: 		Qinv, err := bigmod.NewNat().SetBytes(priv.Precomputed.Qinv.Bytes(), P)
		rsa.go#L674: 		m = bigmod.NewNat().Exp(t0.Mod(c, P), priv.Precomputed.Dp.Bytes(), P)
		rsa.go#L676: 		m2 := bigmod.NewNat().Exp(t0.Mod(c, Q), priv.Precomputed.Dq.Bytes(), Q)

	crypto/x509
		x509.go#L2395: 	if numBytes := template.Number.Bytes(); len(numBytes) > 20 || (len(numBytes) == 20 && numBytes[0]&0x80 != 0) {

	encoding/asn1
		marshal.go#L207: 		bytes := nMinus1.Bytes()
		marshal.go#L219: 		bytes := n.Bytes()

	vendor/golang.org/x/crypto/cryptobyte
		asn1.go#L80: 			bytes := nMinus1.Bytes()
		asn1.go#L91: 			bytes := n.Bytes()