Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Fast Pairing Computation"”.

  1. Efficient Pairings on Various Platforms

    Pairings have found a range of applications in many areas of cryptography. As such, to utilize the enormous potential of pairing-based protocols one needs to efficiently compute pairings across various computing platforms. In this thesis, we give an introduction to pairing-based cryptography and …

    waterloo Repository record for Efficient Pairings on Various Platforms (opens in a new tab)

  2. Optimal Pairings on BN Curves

    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 …

    waterloo Repository record for Optimal Pairings on BN Curves (opens in a new tab)