On String Replacement Exponentiation

Designs, Codes, and Cryptography

Volumn 23, Issue 2, 2001, Pages 173-184

  O'Connor, L J ^a,b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b Unisys   (Switzerland)

Author keywords

Exponentiation; Generating functions; Regular languages

Indexed keywords

EID: 0035400541     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011212615791     Document Type: Article

References (20)

1. J. Bos and M. Coster, Addition chain heuristics. Advances in Cryptology, CRYPTO 89 (G. Brassard, ed.), volume 218, Lecture Notes in Computer Science, Springer-Verlag (1990) pp. 400-407.
2. N. Chomsky and P. Schutzenberger, The algebraic theory of context-free languages, Computer Programming and Formal Languages (P. Braffort and North Holland Hirchberg, D., eds.) (1963) pp. 118-161.
3. W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, Vol. 22, No. 6 (1976) pp. 472-492.
4. T. ElGamal, A public key cryptosystem and signature system based on discrete logarithms, IEEE Transactions on Information Theory, Vol. 31, No. 4 (1985) pp. 473-481.
5. D. Gollman, Y. Han and C. Mitchell, Redundant integer representations and fast exponentiation, Designs, Codes and Cryptography, Vol. 7 (1996) pp. 135-151.
6. Y Han, D. Gollman and C. Mitchell, Minimal weight k-SR representations, Cryptography and Coding (C. Boyd, ed.), volume 1025, Lecture Notes in Computer Science, Springer-Verlag (1995) pp. 34-35.
7. J. Hopcroft and J. Ullman, An Introduction to Automata, Languages and Computation, Reading, MA, Addison-Wesley (1979).
8. L. Hui and K.-Y. Lam, Fast square-and-multiply exponentiation for RSA, Electronics Letters, Vol. 30, No. 17 (1994) pp. 1396-1397.
9. C. K. Ķoç, Higher-radix and bit recoding techniques for modular exponentiation, International Journal of Comouter Mathematics, Vol. 40 (1991) pp. 139-156.
10. D. E. Knuth, The Art of Computer Programming: Vol. 2, Seminumerical Algorithms, Addison-Wesley (1981).
11. N. Koblitz, CM curves with good cryptographic properties. Advances in Cryptology, CRYPTO 91 (J. Feigenbaum, ed.), volume 576, Lecture Notes in Computer Science, Springer-Verlag (1992) pp. 279-287.
12. K. Koyama and T. Tsuruoka, Speeding up elliptic curve cryptosystems using a signed binary window method. Advances in Cryptology, CRYPTO 92 (E. F. Brickell, ed.), volume 740, Lecture Notes in Computer Science, Springer-Verlag (1992) pp. 345-357.
13. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC press (1996).
14. F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications, Vol. 24, No. 6 (1990) pp. 531-544.
15. L. J. O'Connor, An analysis of exponentiation based on formal languages. Advances in Cryptology, EUROCRYPT 99 (J. Stern ed.), volume 1592, Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 375-388.
16. G. Reitwiesener, Binary arithmetic, Advances in Computers (F. L. Alt, ed.) (1960) pp. 232-308.
17. R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM, Vol. 21, No. 2 (1978) pp. 120-126.
18. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley Publishing Company (1996).
19. J. A. Solinas, An improved algorithm for arithmetic on a family of elliptic curves. Advances in Cryptology, CRYPTO 97 (B. S. Kaliski, ed.), volume 1294, Lecture Notes in Computer Science, Springer-Verlag (1997) pp. 357-371.
20. Y. Yacobi, Exponentiating faster with addition chains. Advances in Cryptology, EUROCRYPT 90 (I. B. Damgård, ed.), volume 473, Lecture Notes in Computer Science, Springer-Verlag (1991) pp. 222-229.