math/big.Int.BitLen (method)

28 uses

	math/big (current package)
		float.go#L598: 	bits := uint32(x.BitLen())
		int.go#L472: func (x *Int) BitLen() int {

	crypto/dsa
		dsa.go#L124: 			if p.BitLen() < L {
		dsa.go#L165: 	xBytes := make([]byte, priv.Q.BitLen()/8)
		dsa.go#L210: 	n := priv.Q.BitLen()
		dsa.go#L292: 	n := pub.Q.BitLen()

	crypto/ecdsa
		ecdsa.go#L162: 	orderBits := c.Params().N.BitLen()

	crypto/elliptic
		elliptic.go#L334: 	bitSize := N.BitLen()
		p224.go#L67: 	if x.BitLen() > 224 || y.BitLen() > 224 {
		p384.go#L72: 	if x.BitLen() > 384 || y.BitLen() > 384 {
		p521.go#L77: 	if x.BitLen() > 521 || y.BitLen() > 521 {

	crypto/rand
		util.go#L99: 		if p.ProbablyPrime(20) && p.BitLen() == bits {
		util.go#L113: 	bitLen := n.BitLen()

	crypto/rsa
		pss.go#L211: 	emBits := priv.N.BitLen() - 1
		pss.go#L272: 		saltLength = (priv.N.BitLen()-1+7)/8 - 2 - hash.Size()
		pss.go#L296: 	emBits := pub.N.BitLen() - 1
		pss.go#L298: 	if m.BitLen() > emLen*8 {
		rsa.go#L53: 	return (pub.N.BitLen() + 7) / 8
		rsa.go#L306: 			todo -= primes[i].BitLen()
		rsa.go#L326: 		if n.BitLen() != bits {

	crypto/tls
		handshake_server_tls13.go#L626: 			rsaKey.N.BitLen()/8 < sigHash.Size()*2+2 { // key too small for RSA-PSS

	crypto/x509
		sec1.go#L55: 	privateKey := make([]byte, (key.Curve.Params().N.BitLen()+7)/8)
		sec1.go#L102: 	privateKey := make([]byte, (curveOrder.BitLen()+7)/8)

	go/constant
		value.go#L351: 	return x.BitLen() < maxExp
		value.go#L644: 		return x.val.BitLen()