Аннотация:Shanks’s baby-step-giant-step algorithm to count the order of the group of points of an elliptic curve over a finite prime field is described. The algorithm’s improvements are also discussed. The first one is based on Mestre’s theorem. The second improvement is based on the Sutherland’s probabilistic result allowing to calculate the exponent of an arbitrary finite abelian group.