Determining a Division Remainder and Ascertaining Prime Number Candidates for a Cryptographic Application
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Sep 25, 2014
app pub date -
Oct 25, 2012
filing date -
Oct 28, 2011
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
A device and/or computer program uses a method including determining the division remainder of a first value (b) modulo a second value (p′) and executing a first Montgomery multiplication with the first value (b) as one of the factors and the second value (p′) as a module. A correction factor is determined, and a second Montgomery multiplication is executed with the result of the first Montgomery multiplication as one of the factors and the correction factor as the other factor and the second value (p′) as a module. A method for ascertaining prime number candidates includes determining a base value (b) for a sieve, and several sieve iterations are executed, in which respectively one marking value (p′) is ascertained and multiples of the marking value (p′) in the sieve are marked as composite numbers.
First Claim
Family
International Classification(s)
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