WAIFI
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
AFRICACRYPT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...