jonniram at gmail.com
Wed Jul 7 09:02:37 EDT 2010
Right, if it's just a JCT problem I may have to look elsewhere, though
decent RSA implementations in JS are quite scarce. Regarding inverse_mod, I
actually did use that when I made the Botan key that the test script uses,
though for the exponent I think I did new BigInt(65537) instead of get_e().
On Wed, Jul 7, 2010 at 8:02 AM, Jack Lloyd <lloyd at randombit.net> wrote:
> On Tue, Jul 06, 2010 at 07:33:29PM -0400, jonny ram wrote:
> > Haven't had any luck yet as far as getting Botan keys to work. I even
> > them on both sides to make sure it's not just an issue with the way JCT
> > decodes base 64 or something, but the hashes are identical. If you have
> > time, I've attached a simple test script with the private keys I
> > included, and it lets you choose which key to use. The botan key was
> > generated with the method you suggested (and it will lock up your browser
> > tab if you choose it). I appreciate any help.
> I'll take a look at this later today if I have time, but this really
> sounds like an issue with JCT.
> > > Instead of get_d(), give it the result of (get_p()-1)*(get_q()-1)
> > > as the private key.
> I made a mistake here: the private key for JCT should be:
> inverse_mod(key.get_e(), (key.get_p()-1)*(key.get_q()-1));
> inverse_mod is declared in numthry.h
> botan-devel mailing list
> botan-devel at randombit.net
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the botan-devel