|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object part2.Utilities
Method Summary | |
static java.lang.String |
crack(SimpleRSAPublicKey key,
java.util.AbstractList text)
A method to crack RSA given a public key key and ciphertext text . |
static java.math.BigInteger |
divm(java.math.BigInteger m,
java.math.BigInteger a,
java.math.BigInteger b)
A method to compute the a divided by b modulo m . |
static java.lang.String |
ecrack(SimpleRSAPublicKey key,
java.util.AbstractList text)
A method to crack RSA given a public key key and ciphertext text . |
static java.util.AbstractList |
efactors(java.math.BigInteger n)
A method to factorize a big integer n that is the product of two primes. |
static java.math.BigInteger |
expm(java.math.BigInteger m,
java.math.BigInteger a,
java.math.BigInteger b)
A method to compute the a to the power b modulo m . |
static java.util.AbstractList |
factors(java.math.BigInteger n)
A method to factorize n . |
static java.math.BigInteger |
gcd(java.math.BigInteger a,
java.math.BigInteger b)
A method to determine the GCD of two positive big integers. |
static java.util.AbstractList |
gcde(java.math.BigInteger a,
java.math.BigInteger b)
A method that implements the Extended Euclidean Algorithm. |
static java.math.BigInteger |
generate(int d,
java.security.SecureRandom rnd,
PrimeTester tester)
A method to generate a probable prime of length d bits
where rnd is a source of randomness and tester
is a primality tester. |
static java.math.BigInteger |
invm(java.math.BigInteger m,
java.math.BigInteger a)
A method to compute the inverse of a modulo m . |
static java.math.BigInteger |
phi(java.math.BigInteger n)
A method to compute the Euler phi Function. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
public static java.math.BigInteger gcd(java.math.BigInteger a, java.math.BigInteger b) throws java.lang.Exception
java.lang.Exception
public static java.util.AbstractList gcde(java.math.BigInteger a, java.math.BigInteger b) throws java.lang.Exception
java.lang.Exception
public static java.math.BigInteger invm(java.math.BigInteger m, java.math.BigInteger a) throws java.lang.Exception
a
modulo m
.
java.lang.Exception
- if the inverse does not exist.public static java.math.BigInteger divm(java.math.BigInteger m, java.math.BigInteger a, java.math.BigInteger b) throws java.lang.Exception
a
divided by b
modulo m
.
java.lang.Exception
- if division not possible.public static java.math.BigInteger expm(java.math.BigInteger m, java.math.BigInteger a, java.math.BigInteger b) throws java.lang.Exception
a
to the power b
modulo m
.
java.lang.Exception
public static java.util.AbstractList factors(java.math.BigInteger n) throws java.lang.Exception
n
.
java.lang.Exception
public static java.util.AbstractList efactors(java.math.BigInteger n) throws java.lang.Exception
n
that is the product of two primes. The result of this method is
a list containing two big integer values.
java.lang.Exception
public static java.math.BigInteger phi(java.math.BigInteger n) throws java.lang.Exception
java.lang.Exception
public static java.lang.String crack(SimpleRSAPublicKey key, java.util.AbstractList text) throws java.lang.Exception
key
and ciphertext text
.
java.lang.Exception
public static java.lang.String ecrack(SimpleRSAPublicKey key, java.util.AbstractList text) throws java.lang.Exception
key
and ciphertext text
.
java.lang.Exception
public static java.math.BigInteger generate(int d, java.security.SecureRandom rnd, PrimeTester tester) throws java.lang.Exception
d
bits
where rnd
is a source of randomness and tester
is a primality tester.
java.lang.Exception
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |