Non-modular multiplier, method for non-modular multiplication and computational device
US-10133554-B2 · Nov 20, 2018 · US
US8984040B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8984040-B2 |
| Application number | US-201213469139-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 11, 2012 |
| Priority date | May 11, 2011 |
| Publication date | Mar 17, 2015 |
| Grant date | Mar 17, 2015 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method and apparatus for performing modular exponentiation using iterative modular multiplications steps and taking as input a first modulus N, a secret exponent d and a base x. During at least one modular multiplication step aiming at computing a result c from two values a, b and the first modulus N so that c=a·b mod N, a processor takes as input the two values a, b and the first modulus N from which are obtained two operands a′, b′ and a second modulus N′ using operations with at most linear complexity—at least one of the two operands a′, b′ is different from the two values a, b, and the two operands a′, b′ are different when a is equal to b—so that the modular multiplication c=a·b mod N from a side-channel viewpoint behaves like a modular squaring except for when a′ equals b′ . An intermediate result c′=a′·b′ mod N′ is computed, and the result c is derived from the intermediate result c′ using an operation with at most linear complexity; and the result c is used in the modular exponentiation.
Opening claim text (preview).
The invention claimed is: 1. A method of performing in an electronic device a modular exponentiation in a cryptographic operation comprising iterative modular multiplications steps and taking as input a first modulus N, a secret exponent d and a base x, the method being performed in a processor of the electronic device and comprising the steps, during at least one modular multiplication step aiming at computing a result c from two values a, b and the first modulus N so that c=a·b m…
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Answers are generated from the same data shown on this page.