New composite operations and precomputation scheme for elliptic curve cryptosystems over prime fields

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4939 LNCS, Issue , 2008, Pages 229-247

  Longa, Patrick ^a   Miri, Ali ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Composite operation; Elliptic curve cryptosystem; Point operation; Precomputation scheme; Scalar multiplication

Indexed keywords

BRAIN; COMPUTER PRIVACY; PUBLIC KEY CRYPTOGRAPHY;

(+ MOD 2N) OPERATION; (E ,2E) THEORY; ELLIPTIC CURVE CRYPTOSYSTEMS (ECC); HEIDELBERG (CO); INTERNATIONAL (CO); PRE COMPUTATION; PUBLIC KEY (PK); SCALAR MULTIPLICATIONS; SPRINGER (CO); WINDOW-BASED;

CRYPTOGRAPHY;

EID: 40249109905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78440-1_14     Document Type: Conference Paper

References (24)

1. Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)
2. Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of the NIST elliptic curves over prime fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250-265. Springer, Heidelberg (2001)
3. Billet, O., Joye, M.: Fast Point Multiplication on Elliptic Curves through Isogenies. In: Fossorier, M.P.C., Høholdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 43-50. Springer, Heidelberg (2003)
4. Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Designs, Codes and Cryptography 39(2), 189-206 (2006)
5. Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation using Mixed Coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51-65. Springer, Heidelberg (1998)
6. Dahmen, E., Okeya, K., Schepers, D.: Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 245-258. Springer, Heidelberg (2007)
7. Dimitrov, V., Imbert, L., Mishra, P.K.: Efficient and Secure Elliptic Curve Point Multiplication using Double-Base Chains. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 59-78. Springer, Heidelberg (2005)
8. Doche, C., Icart, T., Kohel, D.: Efficient Scalar Multiplication by Isogeny Decompositions. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 191-206. Springer, Heidelberg (2006)
9. Eisentraeger, K., Lauter, K., Montgomery, P.: Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 343-354. Springer, Heidelberg (2003)
10. Elmegaard-Fessel, L.: Efficient Scalar Multiplication and Security against Power Analysis in Cryptosystems based on the NIST Elliptic Curves over Prime Fields, Master Thesis, University of Copenhagen (2006)
11. FIPS PUB 186-2. Digital Signature Standard (DSS). National Institute of Standards and Technology (NIST) (2000)
12. Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
13. IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. The Institute of Electrical and Electronics Engineers (IEEE) (2000)
14. Itoh, K., Takenaka, M., Torii, N., Temma, S., Kurihara, Y.: Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 61-72. Springer, Heidelberg (1999)
15. Lim, C.H., Hwang, H.S.: Fast implementation of Elliptic Curve Arithmetic in GF(pn). In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 405-421. Springer, Heidelberg (2000)
16. Longa, P.: Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields, Master's Thesis, University of Ottawa (June 2007)
17. Longa, P., Miri, A.: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields. IEEE Transactions on Computers (to appear, 2007), http://doi.ieeecomputersociety.org/10.1109/TC.2007.70815
18. Longa, P., Miri, A.: New Multibase Non-Adjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems (submitted, 2007)
19. Meloni, N.: Fast and Secure Elliptic Curve Scalar Multiplication over Prime Fields using Special Addition Chains. Cryptology ePrint Archive, Report 2006/216 (2006)
20. Mishra, P.: Scalar Multiplication in Elliptic Curve Cryptosystems: Pipelining with Precomputations. Cryptology ePrint Archive, Report 2004/191 (2004)
21. Mishra, P., Dimitrov, V.: Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication using Multibase Number Representation, Cryptology ePrint Archive, Report 2007/040 (2007)
22. Moller, B.: Improved Techniques for Fast Exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 298-312. Springer, Heidelberg (2003)
23. Solinas, J.: Generalized Mersenne Numbers, Technical Report CORR-99-39, Dept. of C&O, University of Waterloo (1999)
24. Takagi, T., Yen, S.-M., Wu, B.-C: Radix-r Non-Adjacent Form. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol. 3225, pp. 99-110. Springer, Heidelberg (2004)