Computer Packages - Elliptic Curves: Number Theory and Cryptography - page 496

References
[1] MFIPS 186-2. Digital signature standard . Federal Information Pro-
cessing Standards Publication 186. U. S. Dept. of Commerce/National
Institute of Standards and Technology, 2000.
[2] M. Abdalla, M. Bellare, and P. Rogaway. The Oracle Di e-Hellman
assumption and an analysis of DHIES. Topics in cryptology - CT RSA
01. volume 2020 of Lecture Notes in Computer Science , Springer, Berlin,
2001, pages 143-158.
[3] L. Adleman, J. DeMarrais, and M.-D. Huang. A subexponential algo-
rithm for discrete logarithms over hyperelliptic curves of large genus
over GF( q ). Theoret. Comput. Sci. , 226(1-2): 7-18, 1999.
[4] L.V.Ahlfors. Complex analysis . McGraw-Hill Book Co., New York,
third edition, 1978. An introduction to the theory of analytic func-
tions of one complex variable, International Series in Pure and Applied
Mathematics.
[5] W. S. Anglin. The square pyramid puzzle. Amer. Math. Monthly , 97(2):
120-124, 1990.
[6] M. F. Atiyah and C. T. C. Wall. Cohomology of groups. In Algebraic
number theory (Proc. Instructional Conf., Brighton, 1965) , pages 94-
115. Thompson, Washington, D.C., 1967.
[7] A. O. L. Atkin and F. Morain. Elliptic curves and primality proving.
Math. Comp. , 61(203):29-68, 1993.
[8] A. O. L. Atkin and F. Morain. Finding suitable curves for the elliptic
curve method of factorization. Math. Comp. , 60(201):399-405, 1993.
[9] R. Balasubramanian and N. Koblitz. The improbability that an ellip-
tic curve has subexponential discrete log problem under the Menezes-
Okamoto-Vanstone algorithm. J. Cryptology , 11(2):141-145, 1998.
[10] J. Belding A Weil pairing on the p -torsion of ordinary elliptic curves
over K [ ]. J. Number Theory (to appear).
[11] D. Bernstein and T. Lange. Faster addition and doubling on elliptic
curves. Asiacrypt 2007 (to appear).
[12] I. F. Blake, G. Seroussi, and N. P. Smart. Elliptic curves in cryptogra-
phy , volume 265 of London Mathematical Society Lecture Note Series .