Cryptographic schemes using elliptic curves over finite fields require
the computation of the cardinality of the curves. Dramatic
progress have been achieved recently in that field by various authors.
The aim of this article is to highlight part of these improvements and
to describe an efficient implementation of them in the particular case
of the fields <I>GF(2^n)</I>, for <I>n <= 600</I>.