Please send test code to reproduce this bug. I also need the following info:
# stack trace (please copy from the call stack window of your debugger, or
use the "bt" command in gdb)
# a minimal program with a main() function, that reproduces the problem
# version of Crypto++, operating system (output of "uname -a" command if
using Unix), and compiler (output of "gcc -v" if using GCC)
I tried to reproduce using the folloing code, but it worked fine:
AutoSeededRandomPool rng;
DH dh;
byte priv[1024], pub[1024];
dh.AccessGroupParameters().GenerateRandomWithKeySize(rng, 768);
for (int i=0; i<1000; i++)
dh.GenerateKeyPair(rng, priv, pub);
--------------------------------------------------
From: "Marco" <[email protected]>
Sent: Friday, January 30, 2009 10:48 AM
To: "Crypto++ Users" <[email protected]>
Subject: Diffie Helman bug
>
> I have been working with Crypto++ code and I have encountered a bug.
> While using DiffieHelman key generator - GenerateKeyPair function, my
> program got into endless recursion (stack overflow). Assemby showed
> RecursiveInverseModPower2 function and analyzing this function pointed
> to a bug - using key length dividable by 3 just flies into endless
> recursion. My test used 768bit / 96byte key. It would be great if this
> could be fixed...
> >
--~--~---------~--~----~------------~-------~--~----~
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.
-~----------~----~----~----~------~----~------~--~---
