Hi All,
The new LLR Version 3.8.0 is now available to download on my site :
http://jpenne.free.fr/index2.html
This version uses the most recent release (25.13) of George Woltman's Gwnum
library, to do fast multiplications and squarings of large integers modulo N.
Since version 25.11, gwnum library is no longer restricted to base two for
efficient computing modulo k*b^n+c numbers (but SSE2 is required if b != 2),
and LLR greatly takes advantage of this improvement.
Please see the Readme.txt file attached with the binaries for more details.
Note : the binary for Mac OS X is not yet available because I cannot build it,
but you can build it yourselves after downloading the source directory.
Please, let me know if you have any difficulty to use this code...
Best Regards,
Jean