You are viewing a plain text version of this content. The canonical link for it is here.

Posted to commits@harmony.apache.org by "Daniel Fridlender (JIRA)" <ji...@apache.org> on 2006/11/08 01:40:52 UTC

[jira] Updated: (HARMONY-2091) [classlib][java.math] optimization of BigInteger.modInverse

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

Daniel Fridlender updated HARMONY-2091:
---------------------------------------

    Attachment: modInverse_gcd.diff

This patch contains the aforementioned optimization.

>  [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
>            Priority: Minor
>         Attachments: 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