查看文章

Most cryptographic treatments of pairings assume bilinearity together with other properties. In this thesis we will present the underlying mathematics of the Weil and Tate pairings over finite fields, and then prove these basic properties. Moreover, we will investigate the advantages and limitations of different pairing friendly elliptic curves. This thesis assumes a basic understanding of abstract algebra and elliptic curves.