|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
this point to the point p.
seed and the values needed to
instantiate a BBS Pseudo-Random Bit Generator.
p and q such that the
private key uses the Chinese Remainder Theorem.
p and q,
and priavte exponent d.
split().
key and ciphertext text.
p and
generators a & b.
part4.DLH hash function.seed and the values needed to
instantiate a part4.DLH object.
cipherText to a big integer value using the private key key.
cipherText to a string value using this private key.
cipherText to a big integer value using this private key.
cipherText to a string value using this private key.
cipherText to a big integer value using the private key key.
cipherText to a string value using this private key.
cipherText to a big integer value using this private key.
cipherText to a string value using this private key.
cipherText using this private key.
a divided by b modulo m.
c
and base point b.
c.
p
and a generator g for Zp*.
key and ciphertext text.
n that is the product of two primes.
m using this public key.
s using this public key.
m using this public key.
s using this public key.
m using this public key.
s using this public key.
m using this public key.
c.
a to the power b modulo m.
t is the number of iterations
for Fermat's Primality Test
and rnd is a source of randomness.
n.
Zp*
where p is a prime and factors are the prime factors of p-1.
SecureRandom object.d bits
where rnd is a source of randomness and tester
is a primality tester.
h.
stringToInt() into
a string.
this point.
a modulo m.
a is a generator for the group Zp*
where p is a prime and factors are the prime factors of p-1.
x using
Fermat's Primality Test.
x using
the Miller-Rabin Primality Test.
x using
a specific primility test.
a/n.
a/n
using Algorithm 2.149 of The Handbook of Applied Cryptography.
a/p where p is an odd prime.
b to the
base a (logab) in
Zp* where p is a prime
and a is a generator of Zp*.
this point to the base b.
t is the number of iterations
for the Miller-Rabin Primality Test
and rnd is a source of randomness.
c using this private key with
Menezes-Vanstone.
(x1,x2) using this public key with
Menezes-Vanstone.
x
for the moduli n1 and n2.
x1 and x2
for the moduli n1 and n2.
m bits using
a BBS Pseudo-Random Bit Generator.
m bits produced by make1() given the primes
p and q and the last value x (i.e., xm-1) of the internal sequence
generated by the BBS Pseudo-Random Bit Generator.
Zp and base point where p
is a large prime.
0 or 1.
0 or 1.
0 or 1.
0 or 1.
0 or 1.
x was produced by protect().
c satisfies the
condition 4a3+27b3 # 0 (mod p).
a in the group Zp*
where p is a prime and factors are the prime factors of p-1.
this point.
p
and exponent e.
Zp*
where d is the number of bits in p and rnd is a source of randomness.
c.
this point to the power e.
x.
n.
x in a quaratic residue (or nonresidue) modulo
n where q is the set of quaratic residues (or nonresidues)
restricted to Zn*.
seed and the values needed to
instantiate an RSA Pseudo-Random Bit Generator.
0..m-1.
b bits.
s using the redundancy object redundancy.
x produced by protect().
p*q.
p and q.
n and private exponent d.
n and public exponent e.
k 1-bits to an m-bit integer.m and k.
x modulo n.
str using the hash function hash
and pseudo-random number generator prng.
str using the hash function hash.
x using the redundancy object redundancy.
x into a non-empty list of big integers representing the
number to the base m.
signature is recorded and tested by passing it to this method along with
a description description of what type of
forgery it is and how it was created.
q method.s of a string str using the hash function hash.
s of a string str using the hash function hash.
s using the redundancy object redundancy.
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||