Method of Performing a Modular Multiplication and Method of Performing a Euclidean Multiplication Using Numbers with 2N Bits
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Mar 13, 2008
app pub date -
Aug 20, 2004
filing date -
Aug 21, 2003
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
The invention relates to method of performing a modular multiplication using numbers with 2n bits. The method includes the steps of breaking the numbers (A, B) down into a 2.sup.n base or a U base, U being a suitable integer; and, subsequently, performing MultModDiv--and/or MultModDivlnit-type elementary operations on the numbers with n bits resulting from the first step. The invention also relates to a method of calculating a Euclidean multiplication/division. The invention can be used for cryptographic calculations.
First Claim
Family
International Classification(s)
- [Classification Symbol]
- [Patents Count]
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully