You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@harmony.apache.org by "Mikhail Loenko (JIRA)" <ji...@apache.org> on 2006/11/13 07:05:38 UTC
[jira] Resolved: (HARMONY-2091) [classlib][java.math] optimization
of BigInteger.modInverse
[ http://issues.apache.org/jira/browse/HARMONY-2091?page=all ]
Mikhail Loenko resolved HARMONY-2091.
-------------------------------------
Resolution: Fixed
applied in revision 474164
Daniel, please confirm that it was applied as expected
> [classlib][java.math] optimization of BigInteger.modInverse
> ------------------------------------------------------------
>
> Key: HARMONY-2091
> URL: http://issues.apache.org/jira/browse/HARMONY-2091
> Project: Harmony
> Issue Type: Improvement
> Reporter: Daniel Fridlender
> Assigned To: Mikhail Loenko
> Priority: Minor
> Attachments: after.html, afterGcd.html, before.html, beforeGcd.html, modInverse_gcd.diff, modInverse_gcd.diff
>
>
> This is an optimization of modInverse consisting of implementing algorithms from the papers "The Montgomery Modular Inverse - Revisited" (by Savas, E; Koc, C) and "New Algorithm for Classical Modular Inverse" (by Lórencz, R) and also making some low-level optimizations like avoiding intermediate data construction by implementing specific ad-hoc combination of arithmetic operations.
--
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