| 摘要 |
<p>A method, apparatus and computer program product are provided to more efficiently perform aspects of elliptic curve cryptography such as by more efficiently multiplying an integer k by a point P on an elliptic curve by decomposing the integer into integers k1 and k2. In this regard, respective bounds for k1 and k2 may be determined (100, 102) and, subject to the respective bounds, k1 and k2 may then be determined (114, 116) such that the product of k and the point P on the elliptic curve may be determined based upon k1 and k2 without requiring the point P to be multiplied by k.</p> |
