For the latest news and information visit
The GNU Crypto project

Serialized Form


Package gnu.crypto.jce

Class gnu.crypto.jce.GnuCrypto implements Serializable


Package gnu.crypto.jce.prng

Class gnu.crypto.jce.prng.ARCFourRandomSpi implements Serializable

Serialized Fields

adaptee

IRandom adaptee
Our underlying prng instance.


virgin

boolean virgin
Have we been initialized?

Class gnu.crypto.jce.prng.ICMRandomSpi implements Serializable

Serialized Fields

adaptee

ICMGenerator adaptee
Our underlying prng instance.

Class gnu.crypto.jce.prng.MD2RandomSpi implements Serializable

Class gnu.crypto.jce.prng.MD4RandomSpi implements Serializable

Class gnu.crypto.jce.prng.MD5RandomSpi implements Serializable

Class gnu.crypto.jce.prng.RipeMD128RandomSpi implements Serializable

Class gnu.crypto.jce.prng.RipeMD160RandomSpi implements Serializable

Class gnu.crypto.jce.prng.Sha160RandomSpi implements Serializable

Class gnu.crypto.jce.prng.UMacRandomSpi implements Serializable

Serialized Fields

adaptee

UMacGenerator adaptee
Our underlying prng instance.

Class gnu.crypto.jce.prng.WhirlpoolRandomSpi implements Serializable


Package gnu.crypto.pad

Class gnu.crypto.pad.WrongPaddingException implements Serializable


Package gnu.crypto.prng

Class gnu.crypto.prng.LimitReachedException implements Serializable


Package gnu.crypto.sig.dss

Class gnu.crypto.sig.dss.DSSKey implements Serializable

Serialized Fields

p

java.math.BigInteger p
A prime modulus, where 2L-1 < p < 2L for 512 <= L <= 1024 and L a multiple of 64.


q

java.math.BigInteger q
A prime divisor of p - 1, where 2159 < q < 2160.


g

java.math.BigInteger g
g = h(p-1)/q mod p, where h is any integer with 1 < h < p - 1 such that h (p-1)/q mod p > 1 (g has order q mod p ).

Class gnu.crypto.sig.dss.DSSPrivateKey implements Serializable

Serialized Fields

x

java.math.BigInteger x

A randomly or pseudorandomly generated integer with 0 < x < q.

Class gnu.crypto.sig.dss.DSSPublicKey implements Serializable

Serialized Fields

y

java.math.BigInteger y
y = gx mod p where x is the private part of the DSA key.


Package gnu.crypto.sig.rsa

Class gnu.crypto.sig.rsa.GnuRSAKey implements Serializable

Serialized Fields

n

java.math.BigInteger n
The modulus of an RSA key pair.

Class gnu.crypto.sig.rsa.GnuRSAPrivateKey implements Serializable

Serialized Fields

p

java.math.BigInteger p
The first prime divisor of the modulus.


q

java.math.BigInteger q
The second prime divisor of the modulus.


e

java.math.BigInteger e
The public exponent of an RSA key.


d

java.math.BigInteger d
The private exponent of an RSA private key.


dP

java.math.BigInteger dP
The first factor's exponent.


dQ

java.math.BigInteger dQ
The second factor's exponent.


qInv

java.math.BigInteger qInv
The CRT (Chinese Remainder Theorem) coefficient.

Class gnu.crypto.sig.rsa.GnuRSAPublicKey implements Serializable

Serialized Fields

e

java.math.BigInteger e
The public exponent of an RSA public key.


For the latest news and information visit
The GNU Crypto project

Copyright ©2001, 2002 Free Software Foundation, Inc.. All Rights Reserved.