harmony-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Daniel Fridlender (JIRA)" <j...@apache.org>
Subject [jira] Created: (HARMONY-1981) [classlib][java.math] optimization of BigInteger.modPow and BigInteger.pow
Date Thu, 26 Oct 2006 14:49:16 GMT
[classlib][java.math] optimization of BigInteger.modPow and BigInteger.pow
--------------------------------------------------------------------------

                 Key: HARMONY-1981
                 URL: http://issues.apache.org/jira/browse/HARMONY-1981
             Project: Harmony
          Issue Type: Improvement
            Reporter: Daniel Fridlender
            Priority: Minor


The method modPow is important for cryptographic applications.  We optimized it by

+ using sliding windows instead of the simpleminded square-and-multiply technique
+ optimizing Montogomery multiplication when computing squares

We also optimized pow with a more efficient computation of squares.

-- 
This message is automatically generated by JIRA.
-
If you think it was sent incorrectly contact one of the administrators: http://issues.apache.org/jira/secure/Administrators.jspa
-
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

Mime
View raw message