
6 Sep
2005
6 Sep
'05
12:22 a.m.
Lucas Galfaso wrote:
The implementation I placed at the sandbox some few month ago, does have one of the fastest, pure C++, implementation of the modular exponentiation that I know about [and it has one of the poorest implementation of serialization/deserialization]. My goal in pursuing an implementation in Boost of big integers is not to have the _best_ implementation possible, but one that .) is really easy to use. .) fast (not fastest ever, just fast.) .) Boost like license. .) using C++ (not C as GMP)
Regards, LG
I looked around for this but couldn't find it. Could you post a link? Joel Eidsath