Serialized Form
Package cryptix.provider.elgamal |
x
java.math.BigInteger x
p
java.math.BigInteger p
g
java.math.BigInteger g
y
java.math.BigInteger y
Package cryptix.provider.key |
algorithm
java.lang.String algorithm
data
byte[] data
Package cryptix.provider.rsa |
n
java.math.BigInteger n
- Public decryption modulus. It is the product of the two p
and q factors.
d
java.math.BigInteger d
- Private encryption exponent. Traditionally referred to as d.
p
java.math.BigInteger p
- The first factor of the public modulus n traditionally
referred to as p.
q
java.math.BigInteger q
- The second factor of the public modulus n traditionally
referred to as q.
u
java.math.BigInteger u
- The result of q^-1 (mod p), called the 'multiplicative
inverse' and traditionally referred to as u. This is used in
modular exponentiation operations using the Chinese Remainder
Theorem (CRT).
n
java.math.BigInteger n
- Public modulus. It is the product of the two p and q
factors but for a public key we usually do not have access to them.
e
java.math.BigInteger e
- Public exponent.
allVerbose
boolean allVerbose
alg
Cipher alg
alg
Cipher alg
alg
Cipher alg
alg
Cipher alg
alg
Cipher alg
alg
Cipher alg
aKey
SecretKey aKey
aKey
SecretKey aKey
this$0
KAT this$0
key
byte[] key
this$0
MCT this$0
key
byte[] key
Package cryptix.util.checksum |
Package cryptix.util.math |
bits
byte[] bits
size
int size
L
int L
- Number of stages/delay elements in this LFSR which is also
the degree of the connection trinomial.
K
int K
- Degree (power) of the mid-tap connection.
slice
int slice
- Clocking is the process of computing the new feedback bit from
the output one and feeding it back to the end of the register.
On a bit by bit basis, this looks like so:
out = getBit(L-1);
in = out ^ getBit(L-K-1);
shiftLeft(1);
if (in == 1) setBit(0);
It is clear from the above that better efficiency and speed
can be achieved if we can process a larger chunck of bits at
a time than just one bit.
This variable is here for exactly this purpose. It tells us
how many bits we can alter with maximum efficiency. It is
computed at instantiation time as the min(64, K, L-K).
warpFactor
int warpFactor
Package cryptix.util.test |
status
java.io.PrintWriter status
- The PrintWriter to which immediate output is sent.
out
java.io.PrintWriter out
- The PrintWriter to which delayed output is sent.
name
java.lang.String name
- The name of this test.
sw
java.io.StringWriter sw
- A StringWriter that collects delayed output.
failures
int failures
- The number of failures so far.
errors
int errors
- The number of errors so far.
passes
int passes
- The number of passes so far.
skipped
int skipped
- The number of skipped tests so far.
expectedPasses
int expectedPasses
- The number of expected passes.
overallPass
boolean overallPass
- true if there is an overall pass.
verbose
boolean verbose
- true if output is to be printed even if all tests pass.
commandLine
boolean commandLine
- true if the program was run from the command line.
gui
TestGUI gui
- The GUI implementation (in a separate class to avoid creating unwanted
dependencies in this one).
errorcode
int errorcode
frame
java.awt.Frame frame
owner
BaseTest owner
output
java.io.PrintWriter output
textArea
java.awt.TextArea textArea
allowExit
boolean allowExit
Package netscape.security |
blockSize
int blockSize
- Deprecated. Use getBlockSize().
- The block size of the cipher.
dataSize
int dataSize
- Deprecated. Use getDataSize().
- The size of the data passed to the cipher.