On Jan 13, 2008, at 3:33 PM, Wei Dai wrote:
> > 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. Thanks, Wei! 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. -~----------~----~----~----~------~----~------~--~---
