public class RSAPrivateCrtKeySpec extends RSAPrivateKeySpec
Key,
KeyFactory,
KeySpec,
PKCS8EncodedKeySpec,
RSAPrivateKeySpec,
RSAPublicKeySpec
| Constructor and Description |
|---|
RSAPrivateCrtKeySpec(BigInteger
Creates a new
RSAPrivateCrtKeySpec given the modulus, publicExponent, privateExponent, primeP, primeQ, primeExponentP, primeExponentQ, and crtCoefficient as defined in PKCS#1.
|
| Modifier and Type | Method and Description |
|---|---|
BigInteger |
getCrtCoefficient()
Returns the crtCoefficient.
|
BigInteger |
getPrimeExponentP()
Returns the primeExponentP.
|
BigInteger |
getPrimeExponentQ()
Returns the primeExponentQ.
|
BigInteger |
getPrimeP()
Returns the primeP.
|
BigInteger |
getPrimeQ()
Returns the primeQ.
|
BigInteger |
getPublicExponent()
Returns the public exponent.
|
getModulus, getPrivateExponentpublic RSAPrivateCrtKeySpec(BigIntegermodulus, BigInteger publicExponent, BigInteger privateExponent, BigInteger primeP, BigInteger primeQ, BigInteger primeExponentP, BigInteger primeExponentQ, BigInteger crtCoefficient)
RSAPrivateCrtKeySpec given the modulus, publicExponent, privateExponent, primeP, primeQ, primeExponentP, primeExponentQ, and crtCoefficient as defined in PKCS#1.
modulus - the modulus n
publicExponent - the public exponent e
privateExponent - the private exponent d
primeP - the prime factor p of n
primeQ - the prime factor q of n
primeExponentP - this is d mod (p-1)
primeExponentQ - this is d mod (q-1)
crtCoefficient - the Chinese Remainder Theorem coefficient q-1 mod p
public BigIntegergetPublicExponent()
public BigIntegergetPrimeP()
public BigIntegergetPrimeQ()
public BigIntegergetPrimeExponentP()
public BigIntegergetPrimeExponentQ()
public BigIntegergetCrtCoefficient()