Yes GF(p) is generally faster than GF(2^n) in software. And I'm not aware of any relevant patents for what you want to do.
-------------------------------------------------- From: "zooko" <[EMAIL PROTECTED]> Sent: Sunday, January 13, 2008 1:30 PM To: "Crypto++ Users" <[EMAIL PROTECTED]> Subject: fastest unencumbered ECDSA key generation? > > Folks: > > I would like to wrap ECDSA for my pycryptopp library. If we use > ECDSA in the allmydata.org decentralized filesystem, then we'll be > very sensitive to key pair generation time. Looking at the Crypto++ > benchmarks suggests that Crypto++ can generate key pairs over GF(p) > 256 about three times as fast as over GF(2^n) 233. What I haven't > figured out yet, despite much scratching my head and searching the > Net, is whether there are any patents in effect which claim to cover > what Crypto++ does when you ask it to generate a key pair over GF(p) > 256 and then to sign and to verify signatures. > > Thanks, > > Regards, > > Zooko > > > > --~--~---------~--~----~------------~-------~--~----~ 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. -~----------~----~----~----~------~----~------~--~---
