[Resource Topic] 2002/008: Efficient Algorithms for Pairing-Based Cryptosystems

Welcome to the resource topic for 2002/008

Efficient Algorithms for Pairing-Based Cryptosystems

Authors: Paulo S. L. M. Barreto, Hae Y. Kim, Ben Lynn, Michael Scott


We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger characteristics. We also propose faster algorithms for scalar multiplication in characteristic 3 and square root extraction over \GF{p^m}, the latter technique being also useful in contexts other than that of pairing-based cryptography.

ePrint: https://eprint.iacr.org/2002/008

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .