1. A subexponential algorithm for discrete logarithms over all finite fields;Adleman;Math. Comput.,1993
2. T. Akishita, T. Takagi, On the optimal parameter choice for elliptic curve cryptosystems using isogeny, Public Key Cryptography—PKC 2004, Lecture Notes in Computer Science, vol. 2947, 2004, pp. 346–359.
3. ANSI X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), American National Standards Institute, 1999.
4. ANSI X9.63, Public Key Cryptography for the Financial Services Industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography, American National Standards Institute, 2001.
5. S. Arita, Construction of secure Cab curves using modular curves, Algorithmic Number Theory: Fourth International Symposium, Lecture Notes in Computer Science, vol. 1838, 2000, pp. 113–126.