Information Technology Reference
In-Depth Information
References
1. Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation, 48 (1987) 203-209
2. Husemöller, D.: Elliptic curves. Graduate Texts in Mathematics, Vol. 111. Springer-Verlag,
Berlin Heidelberg New York (1987)
3. ANSI X9.62-1998, Public key cryptography for the financial industry: the elliptic curve
digital signature algorithm (ECDSA)
4. Pollard, J.M.: Monte Carlo methods for index computation (mod p). Mathematics of Com-
putation, 32 (1978) 918-924
5. Dursma, I., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with
automorphisms. LIX Research Report LIX/RR/99/03
6. Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in
finite fields. IEEE Transactions on Information Theory, 39 (1993) 1639-1636
7. Semaev, I.: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic
curve in characteristic p. Mathematics of Computation, 67 (1998) 353-356
8. Rostovtsev, A., Kuzmich, V., Belenko, V.: Process and method for fast scalar multiplication
of elliptic curve point. Claim for US patent 09/350,158. July 9, 1999
9. Atkin, A.O., Morain, F.: Elliptic curves and primality proving. Mathematics of Computa-
tion, 61 (1993) 29-68
Search WWH ::




Custom Search