Browsing Combinatorics and Optimization by Subject "Pairing-Based Cryptography"
Now showing items 1-2 of 2
-
The Number Field Sieve for Barreto-Naehrig Curves: Smoothness of Norms
(University of Waterloo, 2015-05-20)The security of pairing-based cryptography can be reduced to the difficulty of the discrete logarithm problem (DLP) in finite fields of medium characteristic. The number field sieve is the best known algorithm for this ... -
Optimal Pairings on BN Curves
(University of Waterloo, 2011-08-26)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 ...