A chosen message attack on Demytko's elliptic curve cryptosystem

Journal of Cryptology

Volumn 10, Issue 1, 1997, Pages 71-72

  Kaliski Jr , Burton S ^a  

^a RSA Laboratories   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345184444     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900020     Document Type: Article

References (8)

1. D. Bleichenbacher, W. Bosma, and A. K. Lenstra, Some remarks on Lucas-based cryptosystems, in D. Coppersmith, tailor. Advances in Cryptology-Crypto '95, Springer-Verlag, New York, 1995, pp. 386-396.
2. N. Demytko, A new elliptic curve based analogue of RSA, in T. Helleseth, editor. Advances in Cryptology-Eurocrypt '93, Springer-Verlag, New York, 1994, pp. 40-49
3. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol. 48 (1987), pp. 203-209.
4. K. Koyama, U. M. Maurer, T. Okamoto, and S. A. Vanstone, New public-key schemes based on elliptic curves over the ring Z, in J. Feigenbaum, editor. Advances in Cryptology-Crypto '91, Springer-Verlag, New York, 1994, pp. 252-266.
5. K. Kurosawa, K. Okada, and S. Tsujii, Low exponent attack against elliptic curve RSA, in J. Pieprzyk and R. Safavi-Naini, editors, Advances in Cryptology-Asiacrypt '94, Springer-Verlag, New York, 1995, pp. 376-383.
6. V. S. Miller, Use of elliptic curves in cryptography, in H. C. Williams, editor, Advances in CryptologyCrypto '85, Springer-Verlag, New York, 1986, pp. 417-426.
7. P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, mathematics of Computation, vol. 48, no. 177 (1987), pp. 243-264.
8. 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.