On Wed, Dec 09, 2009 at 05:16:31PM -0700, D. R. Evans wrote: > Vadym Fedyukovych said the following at 12/09/2009 04:17 PM : > > a calculator would do it, GNU "bc" > > another big numbers library would likely help as well: NTL, openssl > > If bc can do this, then I'm being dense about how one would actually use > this in practice to perform the "exponentiation mod n" operation. Would you > care to elucidate how to do this in bc without having to perform the > exponentiation followed by the mod? Sorry, but it's not obvious to me.
Ok, gp/pari may be better for exactly this operation and production-grade key size. Group generator or the other party' DH public key can be initialized with "Mod(g,n)" syntax for some g and n, followed by g^x -- 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.
