Over the past few years pairings have evolved from a method to attack elliptic curves with low embedding degree to an extremely versatile primitive for building protocols. This created a need for better, faster, more secure pairings and computational number theory is providing instantiations with the required properties.

In this talk we give an overview on what has been achieved for pairings on supersingular and ordinary elliptic and hyperelliptic curves and state open problems