Over the last 20 years, efficient algorithms have been developed to count the number of points of a given elliptic curve over a finite field. We discuss the inverse problem of constructing elliptic curves with a given number of points over a finite field. The difficulty of the problem depends on its exact wording. We present a solution to the problem that easily handles curves of the size occurring in cryptographic practice, and explain why it should be expected to do so.