An analysis of double base number systems and a sublinear scalar multiplication algorithm

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

Volumn 3715 LNCS, Issue , 2005, Pages 171-182

  Ciet, Mathieu ^a   Sica, Francesco ^b  

^a GEMPLUS   (France)

^b MOUNT ALLISON UNIVERSITY   (Canada)

Author keywords

Exponentiation algorithms; Integer decomposition

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CRYPTOGRAPHY; NETWORK PROTOCOLS; NUMBER THEORY;

EXPONENTIATION ALGORITHMS; INTEGER DECOMPOSITION; SCALAR MULTIPLICATION ALGORITHM; SUPERSINGULAR ELLIPTIC CURVES;

MATHEMATICAL TECHNIQUES;

EID: 33646198552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_12     Document Type: Conference Paper

References (12)

1. P. Barreto, H.Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In M. Yung, editor, Advances in Cryptology - Proceedings of CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 354-369. Springer, 2002.
2. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. Journal of Cryptology, 17(4):297-319, September 2004.
3. M. Ciet, T. Lange, F. Sica, and J-J. Quisquater. Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms. In E. Biham, editor, Advances in Cryptology - Proceedings of Eurocrypt 2003, volume 2656 of Lecture Notes in Computer Science, pages 388-400. Springer, 2003.
4. V. S. Dimitrov, L. Imbert, and P. K. Mishra. Fast elliptic curve point multiplication using double-base chains. Cryptology ePrint Archive, Report 2005/069, 2005. http: //eprint.iacr.org/.
5. V. S. Dimitrov, G. A. Jullien, and W. C. Miller. Theory and applications for a double-base number system. In IEEE Symposium on Computer Arithmetic, pages 44-53, 1997.
6. V. S. Dimitrov, G. A. Jullien, and W. C. Miller. An algorithm for modular exponentiation. Information Processing Letters, 66(3):155-159, 1998.
7. N. Gouillon. Minorations explicites de formes linéaires en deux logarithmes. PhD thesis, Université de la Méditerranée Aix-Marseille II, Faculté des Sciences de Luminy, 2003.
8. A. Joux. A one round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Algorithmic Number Theory, 4th International Symposium, ANTS-IV, volume 1838 of Lecture Notes in Computer Science, pages 385-394. Springer, 2000.
9. A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
10. P. Morain and J. Olivos. Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains. Inform. Theor. Appl., 24:531-543, 1990.
11. J. A. Solinas. An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In Burton S. Kaliski Jr., editor,Advances in Cryptology - Proceedings of CRYPTO 1997, volume 1294 ofLecture Notes in Computer Science, pages 357-371. Springer, 1997.
12. R. Tijdeman. On the maximal distance between integers composed of small primes. Comp. Mathematica, 28:159-162, 1974.