crypto/rsa.PrivateKey.Primes (field)
41 uses
crypto/rsa (current package)
fips.go#L428: if len(priv.Primes) != 2 {
fips.go#L431: if priv.Primes[0] == nil || priv.Primes[1] == nil || priv.Primes[0].BitLen() != priv.Primes[1].BitLen() {
rsa.go#L110: Primes []*big.Int // prime factors of N, has >= 2 elements.
rsa.go#L133: if len(priv.Primes) != len(xx.Primes) {
rsa.go#L136: for i := range priv.Primes {
rsa.go#L137: if !bigIntEqual(priv.Primes[i], xx.Primes[i]) {
rsa.go#L234: if len(priv.Primes) < 2 {
rsa.go#L308: Primes: []*big.Int{P, Q},
rsa.go#L355: Primes: []*big.Int{
rsa.go#L478: priv.Primes = primes
rsa.go#L530: if len(priv.Primes) != 2 {
rsa.go#L533: if priv.Primes[0] == nil {
rsa.go#L536: if priv.Primes[1] == nil {
rsa.go#L543: priv.Primes[0].Bytes(), priv.Primes[1].Bytes(),
rsa.go#L555: priv.Primes[0].Bytes(), priv.Primes[1].Bytes())
rsa.go#L578: if len(priv.Primes) < 2 {
rsa.go#L583: for _, prime := range priv.Primes {
rsa.go#L592: precomputed.Dp = new(big.Int).Sub(priv.Primes[0], bigOne)
rsa.go#L595: precomputed.Dq = new(big.Int).Sub(priv.Primes[1], bigOne)
rsa.go#L598: precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
rsa.go#L603: r := new(big.Int).Mul(priv.Primes[0], priv.Primes[1])
rsa.go#L604: precomputed.CRTValues = make([]CRTValue, len(priv.Primes)-2)
rsa.go#L605: for i := 2; i < len(priv.Primes); i++ {
rsa.go#L606: 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]