UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Optimal Pairings on BN Curves

Thumbnail Image

Files

Yu_Kewei.pdf (610.98 KB)

Date

2011-08-26T13:29:44Z

Authors

Yu, Kewei

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Bilinear pairings are being used in ingenious ways to solve various protocol problems. Much research has been done on improving the efficiency of pairing computations. This thesis gives an introduction to the Tate pairing and some variants including the ate pairing, Vercauteren's pairing, and the R-ate pairing. We describe the Barreto-Naehrig (BN) family of pairing-friendly curves, and analyze three different coordinates systems (affine, projective, and jacobian) for implementing the R-ate pairing. Finally, we examine some recent work for speeding the pairing computation and provide improved estimates of the pairing costs on a particular BN curve.

Description

Keywords

Pairing-Based Cryptography, BN Curves, Optimal Pairings, Fast Pairing Computation

LC Keywords

Citation

URI

http://hdl.handle.net/10012/6131

Collections

Theses
Combinatorics and Optimization