1. Flexible Hardware Processor for Elliptic Curve Cryptography Over NIST Prime Fields
2. Harald Baier . 2001 . Elliptic Curves of Prime Order Over Optimal Extension Fields for Use in Cryptography. In INDOCRYPT 2001 - Second International Conference on Cryptology in India ( Chennai, India) (LNCS, 2247). Springer, 99--107. http://tubiblio.ulb.tu-darmstadt.de/100904/ Harald Baier. 2001. Elliptic Curves of Prime Order Over Optimal Extension Fields for Use in Cryptography. In INDOCRYPT 2001 - Second International Conference on Cryptology in India (Chennai, India) (LNCS, 2247). Springer, 99--107. http://tubiblio.ulb.tu-darmstadt.de/100904/
3. Optimal extension fields for fast arithmetic in public-key algorithms
4. Digital Signature Standard (DSS)
5. Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem