Signed bits and fast exponentiation

Journal de Theorie des Nombres de Bordeaux

Volumn 13, Issue 1, 2001, Pages 27-41

  Bosma, Wieb ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84962917855     PISSN: 12467405     EISSN: None     Source Type: Journal    
DOI: 10.5802/jtnb.301     Document Type: Article

References (11)

1. S. ARNO, F. S. WHEELER, Signed digit representations of minimal Hamming weight. IEEE Transactions on Computers 42 (1993), 1007-1010.
2. A. D. BOOTH, A signed binary multiplication technique. Quart. Journ. Mech. and Applied Math. 4 (1951), 236-240.
3. D. M. GORDON, A survey of fast exponentiation methods. Journal of Algorithms 27 (1998), 129-146.
4. R. L. GRAHAM, A. C.-C. YAO, F.-F. YAO, Addition chains with multiplicative cost. Discrete Math. 23 (1978), 115-119.
5. A. F. HORADAM, Jacobsthal representation numbers. Fibonacci Quart. 34 (1996), 40-54.
6. D. E. KNUTH, The Art of Computer Programming 2: Seminumerical Algorithms (third edition), Reading: Addison Wesley, 1998.
7. NEAL KOBLITZ, CM-curves with good cryptographic properties, in: Feigenbaum (ed), Advances in Cryptology 2014 Proceedings of Crypto ’91, Lecture Notes in Computer Science 576, (1991), 279-296.
8. D. P. McCARTHY, Effect of improved multiplication efficiency on exponentiation algorithms derived from addition chains. Math. Comp. 46 (1976), 603-608.
9. F. MORAIN, J. OLIVOS, Speeding up the computations on an elliptic curve using additionsubtraction chains. RAIRO Inform. Theory 24 (1990), 531-543.
10. N. J. A. SLOANE, S. PLOUFFE, The encyclopedia of integer sequences. San Diego: Academic Press, 1995. http://www.research.att.com/ njas/sequences/
11. HUGO VOLGER, Some results on addition/subtraction chains. Information Processing Letters 20 (1985), 155-160.