It is often useful in cryptography to be able to generate an elliptic curve over a finite field with a given number of points. This talk will explain the complex multiplication (CM) method for constructing suitable elliptic curves and explain a variant which is joint work with A. Agashe and R. Venkatesan. I will also explain the CM method for generating genus 2 curves and some interesting problems which arise.