Efficient Algorithms for (2008)
Pairing-based Cryptosystems, Hae Y. Kim, Ben Lynn, Michael Scott, Escola Politécnica
Abstract. 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...
Efficient Algorithms for (2008)
Pairing-based Cryptosystems, Hae Y. Kim, Ben Lynn, Michael Scott, Escola Politécnica
Abstract. 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...
Efficient Algorithms for Pairing-Based Cryptosystems (2004)
Pairing-based Cryptosystems, Marcus Stogbauer
Contents 1 Mathematical Background 7 1.1 Finite Fields . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.1.1 Groups, Rings and Fields . . . . . . . . . . . . . . . . 7 1.1.2 Polynomial Rings...
Efficient Algorithms for Pairing-Based Cryptosystems (2002)
P. Barreto, H. Kim, B. Lynn, M. Scott., Pairing-based Cryptosystems
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...