crypto/rsa.PrivateKey.Primes (field)

44 uses

	crypto/rsa (current package)
		fips.go#L447: 	if len(priv.Primes) != 2 {
		fips.go#L450: 	if priv.Primes[0] == nil || priv.Primes[1] == nil || priv.Primes[0].BitLen() != priv.Primes[1].BitLen() {
		rsa.go#L113: 	Primes    []*big.Int // prime factors of N, has >= 2 elements.
		rsa.go#L136: 	if len(priv.Primes) != len(xx.Primes) {
		rsa.go#L139: 	for i := range priv.Primes {
		rsa.go#L140: 		if !bigIntEqual(priv.Primes[i], xx.Primes[i]) {
		rsa.go#L237: 	if len(priv.Primes) < 2 {
		rsa.go#L260: 	if len(priv.Primes) != 2 {
		rsa.go#L263: 	return bigIntEqualToBytes(priv.Primes[0], P) &&
		rsa.go#L264: 		bigIntEqualToBytes(priv.Primes[1], Q) &&
		rsa.go#L342: 			Primes: []*big.Int{P, Q},
		rsa.go#L391: 		Primes: []*big.Int{
		rsa.go#L518: 			priv.Primes = primes
		rsa.go#L571: 	if len(priv.Primes) != 2 {
		rsa.go#L574: 	if priv.Primes[0] == nil {
		rsa.go#L577: 	if priv.Primes[1] == nil {
		rsa.go#L584: 			priv.Primes[0].Bytes(), priv.Primes[1].Bytes(),
		rsa.go#L596: 		priv.Primes[0].Bytes(), priv.Primes[1].Bytes())
		rsa.go#L619: 	if len(priv.Primes) < 2 {
		rsa.go#L624: 	for _, prime := range priv.Primes {
		rsa.go#L633: 	precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne)
		rsa.go#L636: 	precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
		rsa.go#L639: 	precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
		rsa.go#L644: 	r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
		rsa.go#L645: 	precomputed.CRTValues = make([]CRTValue, len(priv.Primes)-2)
		rsa.go#L646: 	for i := 2; i < len(priv.Primes); i++ {
		rsa.go#L647: 		prime := priv.Primes[i]

	crypto/x509
		pkcs1.go#L88: 	key.Primes = make([]*big.Int, 2+len(priv.AdditionalPrimes))
		pkcs1.go#L89: 	key.Primes[0] = priv.P
		pkcs1.go#L90: 	key.Primes[1] = priv.Q
		pkcs1.go#L98: 		key.Primes[i+2] = a.Prime
		pkcs1.go#L137: 	if len(key.Primes) > 2 {
		pkcs1.go#L146: 		P:       key.Primes[0],
		pkcs1.go#L147: 		Q:       key.Primes[1],
		pkcs1.go#L155: 		priv.AdditionalPrimes[i].Prime = key.Primes[2+i]