Efficient and constant-time modular arithmetic

XMLWordPrintable

        The design of some modern cryptographic algorithms enables the use of efficient and constant-time modular arithmetic that avoids carry operations by using a sparse representation. This arithmetic should go in a library that can be reused by multiple cryptographic algorithm implementations. This library will not have a public API, so it should only be used by the Sun providers.

              Assignee:
              Adam Petcher (Inactive)
              Reporter:
              Adam Petcher (Inactive)
              Votes:
              0 Vote for this issue
              Watchers:
              2 Start watching this issue

                Created:
                Updated:
                Resolved: