math/big.Int.Bytes (method)
35 uses
math/big (current package)
int.go#L527: func (x *Int) Bytes() []byte {
crypto/ecdsa
ecdsa.go#L229: return subtle.ConstantTimeCompare(a.Bytes(), b.Bytes()) == 1
ecdsa_legacy.go#L35: priv.PublicKey.X, priv.PublicKey.Y = c.ScalarBaseMult(k.Bytes())
ecdsa_legacy.go#L100: for i, b := range priv.D.Bytes() {
ecdsa_legacy.go#L123: r, _ = c.ScalarBaseMult(k.Bytes())
ecdsa_legacy.go#L140: return encodeSignature(r.Bytes(), s.Bytes())
ecdsa_legacy.go#L153: sig, err := encodeSignature(r.Bytes(), s.Bytes())
ecdsa_legacy.go#L190: x1, y1 := c.ScalarBaseMult(u1.Bytes())
ecdsa_legacy.go#L191: x2, y2 := c.ScalarMult(pub.X, pub.Y, u2.Bytes())
crypto/rsa
rsa.go#L150: return subtle.ConstantTimeCompare(a.Bytes(), b.Bytes()) == 1
rsa.go#L583: k, err := rsa.NewPrivateKeyWithPrecomputation(priv.N.Bytes(), priv.E, priv.D.Bytes(),
rsa.go#L584: priv.Primes[0].Bytes(), priv.Primes[1].Bytes(),
rsa.go#L585: priv.Precomputed.Dp.Bytes(), priv.Precomputed.Dq.Bytes(), priv.Precomputed.Qinv.Bytes())
rsa.go#L595: k, err := rsa.NewPrivateKey(priv.N.Bytes(), priv.E, priv.D.Bytes(),
rsa.go#L596: priv.Primes[0].Bytes(), priv.Primes[1].Bytes())
rsa.go#L613: k, err := rsa.NewPrivateKeyWithoutCRT(priv.N.Bytes(), priv.E, priv.D.Bytes())
rsa.go#L666: N, err := bigmod.NewModulus(pub.N.Bytes())
crypto/x509
x509.go#L2505: 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()
golang.org/x/tools/internal/gcimporter
iexport.go#L1414: b := x.Bytes()
golang.org/x/tools/internal/pkgbits
encoder.go#L381: b := v.Bytes()
vendor/golang.org/x/crypto/cryptobyte
asn1.go#L80: bytes := nMinus1.Bytes()
asn1.go#L91: bytes := n.Bytes()