Faster Pairing Computations on Curves with High-Degree Twists

Explore faster pairing computations on curves with high-degree twists in this 26-minute talk from PKC 2010. Delve into the work of Craig Costello, Tanja Lange, and Michael Naehrig as they present their findings on improving efficiency in cryptographic pairings. Learn about the motivation behind this research, understand the concepts of G1 and G2 groups, and discover the role of twisted curves in pairing-based cryptography. Follow the explanation of the Tate Pairing and Miller's Algorithm, and grasp why certain curves are preferred. Examine the problem at hand and the process of finding faster formulas, with a focus on sexy twists and cubic twists. Gain insights into cutting-edge techniques that enhance the performance of pairing computations, essential for various cryptographic protocols and applications.

Introduction
Motivation
G1 and G2
Twisted Curves
Tape Pairing
Millers Algorithm
Why Use Curves
The Problem
Finding Faster Formulas
Sexy twists
Cubic twists
Summary