CM-constructions in low genus

Complex multiplication (CM) provides constructions for
objects over finite fileds using complex analytic methods.
We focus on applications to curves and their Jacobians in 
genus 1 and 2, and discuss the (im)possibilities of using exponential
time algorithms in obtaining efficient constructions.