crypto/rsa.PrivateKey.D (field)

18 uses

	crypto/rsa (current package)
		rsa.go#L112: 	D         *big.Int   // private exponent
		rsa.go#L133: 	if !priv.PublicKey.Equal(&xx.PublicKey) || !bigIntEqual(priv.D, xx.D) {
		rsa.go#L257: 	if !bigIntEqualToBytes(priv.N, N) || priv.E != e || !bigIntEqualToBytes(priv.D, d) {
		rsa.go#L341: 			D:      D,
		rsa.go#L390: 		D: new(big.Int).SetBytes(d),
		rsa.go#L513: 		priv.D = new(big.Int)
		rsa.go#L515: 		ok := priv.D.ModInverse(e, totient)
		rsa.go#L568: 	if priv.D == nil {
		rsa.go#L583: 		k, err := rsa.NewPrivateKeyWithPrecomputation(priv.N.Bytes(), priv.E, priv.D.Bytes(),
		rsa.go#L595: 	k, err := rsa.NewPrivateKey(priv.N.Bytes(), priv.E, priv.D.Bytes(),
		rsa.go#L613: 	k, err := rsa.NewPrivateKeyWithoutCRT(priv.N.Bytes(), priv.E, priv.D.Bytes())
		rsa.go#L634: 	precomputed.Dp.Mod(priv.D, precomputed.Dp)
		rsa.go#L637: 	precomputed.Dq.Mod(priv.D, precomputed.Dq)
		rsa.go#L651: 		values.Exp.Mod(priv.D, values.Exp)

	crypto/x509
		pkcs1.go#L87: 	key.D = priv.D
		pkcs1.go#L145: 		D:       key.D,

	github.com/gotd/td/crypto
		rsa.go#L51: 	m := new(big.Int).Exp(c, key.D, key.N)