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.
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? And then...how can i be really shure that all the values i generated(p,q,phi(n),e,d) are correct before using them in "Initialize"? Hope someone can help me ;-) h,h,h -- 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.
