This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version)
August 2006 (vol. 55 no. 8)
pp. 1000-1010
In the current work, we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed by a series of point additions and doublings. The pipelining scheme is based on a key observation: To start the subsequent operation, one need not wait until the current one exits. The next operation can begin while a part of the current operation is still being processed. To our knowledge, this is the first attempt to compute the scalar multiplication in such a pipelined manner. Also, the proposed scheme can be made resistant to sidechannel attacks (SCA). Our scheme compares favorably with all SCA-resistant sequential and parallel methods.

[1] K. Aoki, F. Hoshino, T. Kobayashi, and H. Oguro, “Elliptic Curve Arithmetic Using SIMD,” Proc. Int'l Symp. Computing (ISC 2001), pp. 235-247, 2001.
[2] R.M. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen, and F. Vercauteren, Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, 2005.
[3] E. Briér and M. Joye, “Weierstrass Elliptic Curves and Side-Channel Attacks,” Proc. Int'l Workshop Practice and Theory in Public Key Cryptography (PKC 2002), pp. 335-345, 2002.
[4] B. Chevallier-Mames, M. Ciet, and M. Joye, “Low-Cost Solutions for Preventing Simple Side-Channel Analysis: Sidechannel Atomicity,” IEEE Trans. Computers, vol. 53, no. 6, pp. 760-768, June 2004.
[5] M. Ciet, “Aspects of Fast and Secure Arithmetics for Elliptic Curve Cryptography,” PhD thesis, Louvain-la-Neuve, Belgium, 2003.
[6] H. Cohen, “Analysis of the Window Powering Algorithm,” J. Cryptology, vol. 18, no. 1, pp. 63-76, Jan. 2005.
[7] H. Cohen, A. Miyaji, and T. Ono, “Efficient Elliptic Curve Exponentiation Using Mixed Coordinates,” Proc. ASIACRYPT '98, pp. 51-65, 1998.
[8] J.-S. Coron, “Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems,” Proc. Workshop Cryptography Hardware and Embedded Systems (CHES 1999), pp. 292-302, 1999.
[9] W. Fischer, C. Giraud, E.W. Knudsen, J.-P. Seifert, “Parallel Scalar Multiplication on General Elliptic Curves over ${\bf F}_p$ Hedged against Non-Differential Side-Channel Attacks,” IACR eprint archive, Technical Report No 2002/007, http:/www.iacr.org, 2002.
[10] K. Fong, D. Hankerson, J. López, and A. Menezes, “Field Inversion and Point Halving Revisited,” IEEE Trans. Computers, vol. 53, no. 8, pp. 1047-1059, Aug. 2004.
[11] D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. Springer-Verlag, 2004.
[12] IEEE P1363 Standard Specification for Public Key Cryptography, Section A10.3 Elliptic Curve Scalar Multiplication, http://grouper.ieee.org/groups/1363index.html , 2000.
[13] T. Izu, B. Möller, and T. Takagi, “Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks,” Proc. Indocrypt 2002, pp. 296-313, 2002.
[14] T. Izu and T. Takagi, “Fast Elliptic Curve Multiplications with SIMD Operation,” Proc. Int'l Conf. Information and Comm. Security (ICICS 2002), pp. 217-230, 2002.
[15] M. Joye and C. Tymen, “Protection against Differential Attacks for Elliptic Curve Cryptography,” Proc. CHES 2001, pp. 402-410, 2001.
[16] N. Koblitz, “Elliptic Curve Cryptosystems,” Math. of Computations, vol. 48, pp. 203-209, 1987.
[17] P. Kocher, “Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS and Other Systems,” Proc. CRYPTO '96, pp. 104-113, 1996.
[18] P. Kocher, J. Jaffe, and B. Jun, “Differential Power Analysis,” Proc. CRYPTO '99, pp. 388-397, 1999.
[19] K. Koyama and Y. Tsuruoka, “Speeding Up Elliptic Curve Cryptosystems Using a Signed Binary Windows Method,” Proc. CRYPTO '92, pp. 345-357, 1992.
[20] C.H. Lim and P.J. Lee, “More Flexible Exponentiation with Precomputations,” Proc. CRYPTO 94, pp. 95-107, 1994.
[21] V.S. Miller, “Use of Elliptic Curves in Cryptography,” Proc. CRYPTO '85, pp. 417-426, 1985.
[22] P.K. Mishra, “Pipelined Computation of Scalar Multiplication in Use of Elliptic Curves Cryptosystems,” Proc. CHES '04, pp. 328-342, 2004.
[23] J. Solinas, “Efficient Arithmetic on Koblitz Curves,” Designs, Codes, and Cryptography, vol. 19, pp. 195-249, 2000.

Index Terms:
Elliptic Curve Cryptosystems, ECC, EC-operations, pipelining, scalar multiplication, comb methods, binary methods, Jacobian coordinates, sidechannel attacks, sidechannel atomicity.
Citation:
Pradeep Kumar Mishra, "Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version)," IEEE Transactions on Computers, vol. 55, no. 8, pp. 1000-1010, Aug. 2006, doi:10.1109/TC.2006.129
Usage of this product signifies your acceptance of the Terms of Use.