[jira] Updated: (HARMONY-5825) [classlib][math] RSA-related performance optimization

["Aleksey Shipilev (JIRA)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/HARMONY-5825?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Aleksey Shipilev updated HARMONY-5825:
--------------------------------------

    Attachment: cl-math-rsa-rc1.patch

cl-math-rsa-rc1.patch
Proposed patch.

There are many changes, but they're depend on each other:
 - eliminates redundant zero extensions ( (int)i & ffffffffL ) and changes the signatures of several internal methods accordingly
 - extracts frequent (a*b + c + d) as separate methods thus allowing magic generation
 - breaks monPro into three pieces: array multiplication, Montgomery reduction, final substractio
 - eliminates monSquare(x, ...) and moves the algos to monPro(x, x, ...) usage
 - optimizes j.m.Division.multiplyAndSubstract to be faster and clearer
 - optimizes j.m.Division.modInverseMontgomery to be faster
 - caches and reuses BigIntegers that are powers of 2
 - does not perform bit shifting for zero values


> [classlib][math] RSA-related performance optimization
> -----------------------------------------------------
>
>                 Key: HARMONY-5825
>                 URL: https://issues.apache.org/jira/browse/HARMONY-5825
>             Project: Harmony
>          Issue Type: Improvement
>          Components: Classlib
>            Reporter: Aleksey Shipilev
>         Attachments: cl-math-rsa-rc1.patch
>
>
> This issue optimizes java.math.* parts involved in RSA computation.
> SPECjvm2008:crypto.rsa is used as reference RSA implementation.

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.