Bilinear pairings, such as the Weil and Tate pairings, have revolutionized
public-key cryptography since they burst onto the scene at the turn of the
century. In the decade that has followed, methods to compute
cryptographically secure pairings have received a great deal of attention
from mathematicians and cryptographers alike, in an effort to accelerate
their speed so that the many new and exciting protocols that pairings
facilitate can be realized in industry. In this talk we give an overview
of the progress in pairing computation, paying particular attention to the
very latest results in the area.