[jira] Updated: (HARMONY-1981) [classlib][java.math] optimization of BigInteger.modPow and BigInteger.pow

["Daniel Fridlender (JIRA)" <ji...@apache.org>]

     [ http://issues.apache.org/jira/browse/HARMONY-1981?page=all ]

Daniel Fridlender updated HARMONY-1981:
---------------------------------------

    Attachment: pow_modPow.diff

This patch improves the performance of pow and modPow methods.

It also fixes a bug in BigInteger.toString(int radix) when radix = 6, and removes "commented away" code from BigDecimal.


> [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
>         Attachments: pow_modPow.diff
>
>
> 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