Compact encoding of non-adjacent forms with applications to elliptic curve cryptography

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

Volumn 1992, Issue , 2001, Pages 353-364

  Joye, Marc ^a   Tymen, Christophe ^a  

^a GEMPLUS   (France)

Author keywords

Elliptic curves; Non adjacent forms; Public keycry ptography; Smart cards

Indexed keywords

CHROMIUM COMPOUNDS; ENCODING (SYMBOLS); GEOMETRY; SIGNAL ENCODING; SMART CARDS;

COMPACT ENCODING; CRYPTOGRAPHIC PRIMITIVES; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; EXPONENT RECODING; NON-ADJACENT FORM; SCALAR MULTIPLICATION; STRAIGHTFORWARD TECHNIQUES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937395009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_26     Document Type: Conference Paper

References (14)

1. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. on Information Theory, vol. 22, pp. 644–654, 1976.
2. T. El Gamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. on Information Theory, vol. 31, pp. 469–472, 1985.
3. D. M. Gordon, “A surveyof fast exponentiation methods,” J. Algorithms, vol. 27, pp. 129–146, 1998.
4. IEEE Std P1363-2000, IEEE Standard Specifications for Public-Key Cryptography, IEEE Computer Society, August 20, 2000.
5. M. Joye and S.-M. Yen, “Optimal left-to-right binary signed-digit recoding,” IEEE Trans. Computers, vol. 49, pp. 740–748, 2000.
6. N. Koblitz, “CM-curves with good cryptographic properties,” Advances in Cryptology – CRYPTO’91, LNCS 576, pp. 279–287, Springer-Verlag, 1992.
7. W. Meier and O. Staffelbach, “Efficient multiplication on certain non-supersingular elliptic curves,” Advances in Cryptology – CRYPTO’92, LNCS 740, pp. 333–344, Springer-Verlag, 1993.
8. F. Morain and J. Olivos, “Speeding up the computations on an elliptic curve using addition-subtraction chains,” Theoretical Informatics and Applications, vol. 24, pp. 531–543, 1990.
9. P. Nguyen and J. Stern, “The hardness of the hidden subset sum problem and its cryptographic implications,” Advances in Cryptology – CRYPTO’99, LNCS 1666, pp. 31–46, Springer-Verlag, 1999.
10. A. Pinkus and S. Zafrany, Fourier Series and Integral Transforms, Cambridge UniversityPress, 1997.
11. G. W. Reitwiesner, “Binaryarithmetic,” Advances in Computers, vol. 1, pp. 231– 308, 1960.
12. J. H. Silverman, The Arithmetic of Elliptic Curves, GTM 106, Springer-Verlag, 1986.
13. J. A. Solinas, “An improved algorithm for arithmetic on a family of elliptic curves,” Advances in Cryptology – CRYPTO’97, LNCS 1294, pp. 357–371, Springer-Verlag, 1997.
14. J. H. van Lint, Introduction to Coding Theory, GTM 86, Springer-Verlag, 3rd edition, 1999.