The Community for Technology Leaders
Green Image
This paper presents two main results relating to elliptic curve cryptography. First, a double point compression scheme is proposed which allows a compact representation of elliptic curve points without the computational cost associated with ordinary single point compression. A triple point compression scheme is also proposed which can result in more savings in memory and/or bandwidth. Second, a new approach to speeding up random point multiplication is given for the case where the base point is variable but available in a certificate. In this approach, some redundant information (a few multiples of the base point) is added to the certificate. It is shown that a significant speed up can be obtained by optimizing the Möller's algorithm for the case where only a portion of the lookup table is available. It is also shown how to use redundant information to compute random point multiplication using parallel processors. The proposed point compression schemes can be employed to reduce the required bandwidth when single point compression is computationally expensive.
Cryptography, elliptic curves, point multiplication, point compression, fast computation, parallel processing.
Majid Khabbazian, T. Aaron Gulliver, Vijay K. Bhargava, "Double Point Compression with Applications to Speeding Up Random Point Multiplication", IEEE Transactions on Computers, vol. 56, no. , pp. 305-313, March 2007, doi:10.1109/TC.2007.47
95 ms
(Ver 3.3 (11022016))