You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@harmony.apache.org by "Alexey Petrenko (JIRA)" <ji...@apache.org> on 2006/11/07 16:26:52 UTC
[jira] Resolved: (HARMONY-1981) [classlib][java.math] optimization
of BigInteger.modPow and BigInteger.pow
[ http://issues.apache.org/jira/browse/HARMONY-1981?page=all ]
Alexey Petrenko resolved HARMONY-1981.
--------------------------------------
Resolution: Fixed
The patch has been applied.
Daniel, please verify and add your impressive performance comparision.
> [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
> Assigned To: Alexey Petrenko
> 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