1. D.E. Knuth. The Art of Computer Programming – Vol. 2 – Seminumerical Algorithms, Addison-Wesley, Third ed., 1998.
2. B. Byramjee and S. Duquesne. Classification of genus 2 curves over $F_{2^n}$ and optimization of their arithmetic. Cryptology ePrint Archive: Report 2004/107.
3. I. Blake, G. Seroussi, and N.P. Smart. Elliptic Curves in Cryptography. London Mathematical Society Lecture Note Series. Cambridge University Press, 1999.
4. C. Diem and J. Scholten. Cover Attacks – A report for the AREHCC project 2003, http://www.arehcc.com
5. J. López and R. Dahab. Fast multiplication on elliptic curves over ${\mathop{\rm GF}\nolimits}(2^m)$ . In Ç. K. Koç and C. Paar, editors, Cryptographic Hardware and Embedded Systems –- CHES, vol. 1717 of LNCS, pp. 316–327. Springer-Verlag, 1999.