Hi, Sorry I am not much of a C++ expert so instead of pulling my hair out I'd like to ask this question:
Does it take a long time to do DH bignum math (powMod) with sizes higher than 8192 bit prime groups? The RFC spec says it will take an impractical amount of time @ http://tools.ietf.org/html/rfc3526 , but I am thinking maybe the times have changed with faster computers. The reason is I want to securely do DH for 256 bit symmetric keys, and the RFC seems to think that you'll need very high prime groups to do it. Also, is there a limit for the group size in Crypto++? Does it have the RFC groups hardcoded in them, or must you generate your own primes for its DH? Thanks for any tips in advance. -- smu johnson <[email protected]> -- 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.
