Hi
I wanted some input on a problem. I need to use bn_exp for some big calculation but I hit a limit where it take age to get a result (after two day I stopped the process). I tried for fun to run a bn_mod_exp and it took 2 seconds.
The manpage state that;
BN_exp() raises a to the p-th power and places the result in r ("r=a^p"). This function is faster than repeated
applications of BN_mul().
BN_mod_exp() computes a to the p-th power modulo m ("r=a^p % m"). This function uses less time and space than
BN_exp().
Is there a tip there to get the exp result from bn_mod_exp ? or to optimize bn_exp ?
Thanks
Philippe
nb. Sorry if the question might have been answered in the past, I didn't find any way to search the mailing-list's archive.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mta.openssl.org/pipermail/openssl-users/attachments/20160115/65e02fea/attachment.html>
