On Dec 3, 5:56 am, pulsedrone <[email protected]> wrote:
> Hello everyone,
>
> for a couple of days i am trying the RSA-function "Initalize(n,e,d)"
> with values i get from a procedure that i have written in Java. But
> each time filling and running the Initialize i get the
> message:InvertibleRSAFunction:
> input is not a valid RSA private key....ok...so far so good.
>From http://www.cryptopp.com/docs/ref/class_invertible_r_s_a_function.html,
Initialize(n, e,d) should work properly. If its not, I would suspect
your Java algorithms.
> Now, i found the PrimeAndGenerator from Crypto++ and try to do the
> same as with the Java procedure. Is there(within Crypto++) an
> efficient way for finding the coprime e for phi(n) which
> "Initalize(n,e,d)" will accept. Its because when i try it with 20000
> bit long primes it takes a while for calculating?
Initialize (RandomNumberGenerator &rng, unsigned int modulusBits,
const Integer &e=17) will create a key (rather than load it from
{n,e,d}. After the parameters are selected, they are verified. You
might want to step the verification code.
> And then...how can i be really sure that all the values i
> generated(p,q,phi(n),e,d) are correct before using them in
> "Initialize"?
Initialize (rng, modulusBits,e) begins near line 145 of rsa.cpp
(http://www.cryptopp.com/docs/ref/rsa_8cpp_source.html).
Also of interest might be Validate(rng, rounds). See
http://www.cryptopp.com/wiki/Keys_and_formats#Validating_Keys.
Jeff
--
You received this message because you are subscribed to the "Crypto++ Users"
Google Group.
To unsubscribe, send an email to [email protected].
More information about Crypto++ and this group is available at
http://www.cryptopp.com.
