1. Efficient pairing computation on supersingular Abelian varieties
2. Paulo S. L. M.
Barreto Hae Yong Kim Ben Lynn and Michael Scott. Efficient Algorithms for Pairing-Based Cryptosystems. In Moti Yung editor Advances in Cryptology - CRYPTO
2002 22nd Annual International Cryptology Conference Santa Barbara California USA August 18--22 2002 Proceedings volume
2442
of
Lecture Notes in Computer Science pages
354
--
368
.
Springer 2002. Paulo S. L. M. Barreto Hae Yong Kim Ben Lynn and Michael Scott. Efficient Algorithms for Pairing-Based Cryptosystems. In Moti Yung editor Advances in Cryptology - CRYPTO 2002 22nd Annual International Cryptology Conference Santa Barbara California USA August 18--22 2002 Proceedings volume 2442 of Lecture Notes in Computer Science pages 354--368. Springer 2002.
3. Paulo S. L.
M.
Barreto and Michael Naehrig. Pairing-Friendly Elliptic Curves of Prime Order. In Bart Preneel and Stafford E. Tavares editors Selected Areas in Cryptography 12th International Workshop SAC
2005 Kingston ON Canada August 11--12 2005 Revised Selected Papers volume
3897
of
Lecture Notes in Computer Science pages
319
--
331
.
Springer 2005. 10.1007/11693383_22 Paulo S. L. M. Barreto and Michael Naehrig. Pairing-Friendly Elliptic Curves of Prime Order. In Bart Preneel and Stafford E. Tavares editors Selected Areas in Cryptography 12th International Workshop SAC 2005 Kingston ON Canada August 11--12 2005 Revised Selected Papers volume 3897 of Lecture Notes in Computer Science pages 319--331. Springer 2005. 10.1007/11693383_22
4. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation