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.