1. Adleman L., DeMarrais J., Huang M.D.: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Adleman L.M., Huang M.D. (eds.) ANTS I. LNCS, vol. 877, pp. 28–40. Springer, Heidelberg (1994)
2. Augot D., Morain F.: Discrete logarithm computations over finite fields using Reed-Solomon codes. arXiv:1202.4361 (2012)
3. Avanzi R., Cohen H., Doche C., Frey G., Lange T., Nguyen K., Vercauteren F.: Handbook of Elliptic and Hyperelliptic Cryptography. Chapman and Hall/CRC, Boca Raton (2006)
4. Babai L., Szemerédi E.: On the complexity of matrix group problems I. Found. Comput. Sci. (FOCS) 229–240 (1996)
5. Bailey D.V., Batina L., Bernstein D.J., Birkner P., Bos J.W., Chen H.C., Cheng C.M., van Damme G., de Meulenaer G., Perez L.J.D., Fan J., Güneysu T., Gurkaynak F., Kleinjung T., Lange T., Mentens N., Niederhagen R., Paar C., Regazzoni F., Schwabe P., Uhsadel L., Herrewege A.V., Yang B.Y.: Breaking ECC2K-130, Cryptology ePrint Archive: Report 2009/541. http://ecc-challenge.info/ (2009)