Fast scalar multiplication for elliptic curve cryptosystems over prime fields
US8369517B2 · kind B2 · utility
8Cited by
2References
24Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 12, 2008 |
| Grant date | Feb 5, 2013 |
| Priority date | — |
| Expiry date | Mar 31, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2207/7261
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Fast scalar multiplication operations are disclosed for use in an elliptic curve cryptographic system The operations use binary representations of a secret key and points on an elliptic curve defined over a prime field expressed in a coordinate system (e.g., Jacobian coordinates). The operations can be based on a modified Montgomery ladder that uses modified Meloni addition formulas. The operations can be more efficient than a double-and-add operation, and can be more resistant to side-channel attacks by hackers.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.