Hi All,

I hope you are doing fine. I am working on a project related to OpenSSL and
interested in knowing, whether the bntest.c (which calls bn_mont.c:
montgomery multiplication algorithm) implements Karatsuba-Ofman
multiplication with Comba multiplication method or Classical multiplication
method (There exists a file called comba.pl). Also, references are given to
Dr. Cetin Koc's methods (SOS/CIOS/FIOS) in the code. How are these
implemented (If they are) ?

Please give your vital inputs on this (links or pointers). Looking forward
to hear from you.


Arise, Awake and Stop not, Till the GOAL is reached !!!