JXTA

jxta.security.publickey
Interface RSAPrivateKey


public interface RSAPrivateKey
extends Description, Key


Field Summary
static java.lang.String name
           
 
Method Summary
 boolean equals(RSAPrivateKey key)
           
 int getCrtCoefficient(byte[] crtCoefficient, int offset)
           
 int getCrtCoefficientLength()
           
 int getModulus(byte[] modulus, int offset)
           
 int getPrimeExponentP(byte[] primeExponentP, int offset)
           
 int getPrimeExponentPLength()
           
 int getPrimeExponentQ(byte[] primeExponentQ, int offset)
           
 int getPrimeExponentQLength()
           
 int getPrimeP(byte[] primeP, int offset)
           
 int getPrimePLength()
           
 int getPrimeQ(byte[] primeQ, int offset)
           
 int getPrimeQLength()
           
 int getPrivateExponent(byte[] exponent, int offset)
           
 void setCrtCoefficient(byte[] crtCoefficient, int offset, int length)
           
 void setModulus(byte[] modulus, int offset, int length)
           
 void setPrimeExponentP(byte[] primeExponentP, int offset, int length)
           
 void setPrimeExponentQ(byte[] primeExponentQ, int offset, int length)
           
 void setPrimeP(byte[] primeP, int offset, int length)
           
 void setPrimeQ(byte[] primeQ, int offset, int length)
           
 void setPrivateExponent(byte[] exponent, int offset, int length)
          Given two primes, p and q, and [e,(p-1)(q-1)] = 1, n = pq Private Key: d = 1/e mod n c = m**d mod n, d is exponent, n modulus We also have methods to set parameters for the Chinese remainder theorem algorithm d mod p-1, d mod q-1, 1/q mod p
 
Methods inherited from interface jxta.security.util.Description
clearDebug, getAlgorithmName, setDebug
 
Methods inherited from interface jxta.security.cipher.Key
clearKey, getLength, getSize, getType, isInitialized
 

Field Detail

name

public static final java.lang.String name
Method Detail

equals

public boolean equals(RSAPrivateKey key)

setPrivateExponent

public void setPrivateExponent(byte[] exponent,
                               int offset,
                               int length)
                        throws CryptoException
Given two primes, p and q, and [e,(p-1)(q-1)] = 1, n = pq Private Key: d = 1/e mod n c = m**d mod n, d is exponent, n modulus We also have methods to set parameters for the Chinese remainder theorem algorithm d mod p-1, d mod q-1, 1/q mod p

setModulus

public void setModulus(byte[] modulus,
                       int offset,
                       int length)
                throws CryptoException

getPrimePLength

public int getPrimePLength()

getPrimeQLength

public int getPrimeQLength()

getPrimeExponentPLength

public int getPrimeExponentPLength()

getPrimeExponentQLength

public int getPrimeExponentQLength()

getCrtCoefficientLength

public int getCrtCoefficientLength()

setPrimeP

public void setPrimeP(byte[] primeP,
                      int offset,
                      int length)
               throws CryptoException

setPrimeQ

public void setPrimeQ(byte[] primeQ,
                      int offset,
                      int length)
               throws CryptoException

setPrimeExponentP

public void setPrimeExponentP(byte[] primeExponentP,
                              int offset,
                              int length)
                       throws CryptoException

setPrimeExponentQ

public void setPrimeExponentQ(byte[] primeExponentQ,
                              int offset,
                              int length)
                       throws CryptoException

setCrtCoefficient

public void setCrtCoefficient(byte[] crtCoefficient,
                              int offset,
                              int length)
                       throws CryptoException

getPrivateExponent

public int getPrivateExponent(byte[] exponent,
                              int offset)

getModulus

public int getModulus(byte[] modulus,
                      int offset)

getPrimeP

public int getPrimeP(byte[] primeP,
                     int offset)

getPrimeQ

public int getPrimeQ(byte[] primeQ,
                     int offset)

getPrimeExponentP

public int getPrimeExponentP(byte[] primeExponentP,
                             int offset)

getPrimeExponentQ

public int getPrimeExponentQ(byte[] primeExponentQ,
                             int offset)

getCrtCoefficient

public int getCrtCoefficient(byte[] crtCoefficient,
                             int offset)

JXTA