Speeding up elliptic cryptosystems by using a signed binary window method

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

Volumn 740 LNCS, Issue , 1993, Pages 345-357

  Koyama, Kenji ^a   Tsuruoka, Yukio ^a  

^a NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; MULTIPLYING CIRCUITS;

AVERAGE LENGTH; BASIC OPERATION; HOMOGENEOUS COORDINATES; PARALLEL PROCESSING; PRE-COMPUTATION; SIGNED BINARIES; SYSTEMATIC METHOD; TIME COMPLEXITY;

CRYPTOGRAPHY;

EID: 84957354181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48071-4_25     Document Type: Conference Paper

References (16)

1. Bos, J. and Coster, M: Addition chain heuristics” Proc. of CRYPTO'89 (1989).
2. Brickell, E.F.:“A fast modular multiplication algorithm with application to two key cryptography" Proc. of CRYPTO’82 (1982).
3. Brickell, E.F., Gordon, D.M., McCurley, K.S., and Wilson, D.: “Fast exponentia­tion with precomputation" Proc. of EUROCRYPT'92 (1992).
4. Diffie, W. and Heilman, M.E.: “New directions in cryptography”, IEEE Transac­tions on Information Theory, Vol. 22, No. 6, (1976), pp. 644-654.
5. Downey, P., Leonv, B. and Sethi, R.:“Computing sequences with addition chains”, Siam J. Comput. -3(1981) pp. 638-696.
6. ElGamal, T.:“A public key cryptosystem and a signature scheme based on the discrete logarithm”, IEEE Transactions on Information Theory, Vol. 31, No. 4, (1985), pp. 469-472.
7. Goldwasser, S. and Killian, J.:"Almost all primes can be quickly certified”, Proc. 18th STOC. Berkeley, (1986), pp. 316-329.
8. Jedwab, J. and Mitchell, C. J.:"Minimum weight modified signed-digit represen­tations and fast exponentiation", Electronics Letters Vol. 25, No. 17, (1989), pp. 1171-1172.
9. Koyama, K., Maurer, U., Okamota, T and Vanstone, S. A: “New public-key schemes based on elliptic curves over the ring Zn”, Proc. of CRYPTO’91 (1991).
10. Knuth, D.E.: “Seminumerical algorithm (arithmetic)” The Art of Computer Pro­gramming Vol.2, Addison Wesley, (1969).
11. Koblita, N.: A course in number theory and cryptography, Berlin: Springer-Verlag, (1987).
12. Lenstra, H. W. Jr.; “Factoring integers with elliptic curves”, Ann. of Moth. 126 (1987), pp. 649-673.
13. Montgomery, P.L :Speeding the Pollard and elliptic curve methods of factoriza­tion”, Math. Comp. 48. (1987). pp. 243-264.
14. Moraiu, F. and Olivos, J,: "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. Rivest, R.L., Shamir, A. and Adleman, L.:"A method for obtaining digital signa­tures and public-key cryptosystems”, Communications of the ACM, Vol. 21, No.2, (1978), pp. 120-126.
16. Yacobi, Y.: “Exponentiating faster with addition chains” Proc. of EURO- CRYPTVO (1990).