public class RSAMultiPrimePrivateCrtKeySpec extends RSAPrivateKeySpec
Defined in the PKCS #1 v2.1 standard.
Constructor and Description |
---|
RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus,
BigInteger publicExponent,
BigInteger privateExponent,
BigInteger primeP,
BigInteger primeQ,
BigInteger primeExponentP,
BigInteger primeExponentQ,
BigInteger crtCoefficient,
RSAOtherPrimeInfo[] otherPrimeInfo)
Creates a new
RSAMultiPrimePrivateCrtKeySpec with the specified
modulus, public exponent, private exponent, prime factors, prime
exponents, crt coefficient, and additional primes. |
Modifier and Type | Method and Description |
---|---|
BigInteger |
getCrtCoefficient()
Returns the CRT coefficient,
q^-1 mod p . |
RSAOtherPrimeInfo[] |
getOtherPrimeInfo()
Returns the information for the additional primes.
|
BigInteger |
getPrimeExponentP()
Returns the exponent of the prime
p . |
BigInteger |
getPrimeExponentQ()
Returns the exponent of the prime
q . |
BigInteger |
getPrimeP()
Returns the prime factor
p . |
BigInteger |
getPrimeQ()
Returns the prime factor
q . |
BigInteger |
getPublicExponent()
Returns the public exponent
e . |
getModulus, getPrivateExponent
public RSAMultiPrimePrivateCrtKeySpec(BigInteger modulus, BigInteger publicExponent, BigInteger privateExponent, BigInteger primeP, BigInteger primeQ, BigInteger primeExponentP, BigInteger primeExponentQ, BigInteger crtCoefficient, RSAOtherPrimeInfo[] otherPrimeInfo)
RSAMultiPrimePrivateCrtKeySpec
with the specified
modulus, public exponent, private exponent, prime factors, prime
exponents, crt coefficient, and additional primes.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
- the exponent of the prime p
.primeExponentQ
- the exponent of the prime q
.crtCoefficient
- the CRT coefficient q^-1 mod p
.otherPrimeInfo
- the information for the additional primes or null
if
there are only the two primes (p, q
).IllegalArgumentException
- if otherPrimeInfo
is not null but empty.public BigInteger getCrtCoefficient()
q^-1 mod p
.q^-1 mod p
.public RSAOtherPrimeInfo[] getOtherPrimeInfo()
null
if
there are only the two primes (p, q
).public BigInteger getPrimeExponentP()
p
.p
.public BigInteger getPrimeExponentQ()
q
.q
.public BigInteger getPrimeP()
p
.p
.public BigInteger getPrimeQ()
q
.q
.public BigInteger getPublicExponent()
e
.e
.