Accelerated finite field operations on an elliptic curve
US6782100B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 2, 2000 |
| Grant date | Aug 24, 2004 |
| Priority date | — |
| Expiry date | Apr 11, 2022 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/3252
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method for multiplication of a point P on elliptic curve E by a value k in order to derive a point kP comprises the steps of representing the number k as vector of binary digits stored in a register and forming a sequence of point pairs (P1, P2) wherein the point pairs differed most by P and wherein the successive series of point pairs are selected either by computing (2mP,(2m+1)P) from (mP,(m+1)P) or ((2m+1)P,(2m+2)P) from (mP,(m+1)P). The computations may be performed without using the y-coordinate of the points during the computation while allowing the y-coordinate to be extracted at the end of the computations, thus, avoiding the use of inversion operations during the computation and therefore, speeding up the cryptographic processor functions. A method is also disclosed for accelerating signature verification between two parties.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.