Citation: | WANG Bei, OUYANG Yi, HU Honggang, “Efficient Pairing Computation on Twisted Weierstrass Curves,” Chinese Journal of Electronics, vol. 27, no. 4, pp. 739-745, 2018, doi: 10.1049/cje.2018.05.004 |
Joux Antoine, "A one round protocol for tripartite DiffieHellman", International Algorithmic Number Theory Symposium, Springer, Berlin, Heidelberg, Vol.17, No.4, pp.385-393, 2000.
|
Boneh Dan and Matt Franklin, "Identity-based encryption from the Weil pairing", Advances in Cryptology-CRYPTO 2001, Springer, Berlin, Heidelberg, pp.213-229, 2001.
|
Koblitz Neal and Alfred Menezes, "Pairing-based cryptography at high security levels", Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, Vol.3796, pp.13-36, 2005.
|
Boneh Dan, Ben Lynn and Hovav Shacham, "Short signatures from the Weil pairing", Advances in Cryptology ASIACRYPT, pp.514-532, 2001.
|
Hess Florian, "Pairing lattices", Pairing-Based CryptographyPairing 2008, Springer, Berlin, Heidelberg, pp.18-38, 2008.
|
Vercauteren Frederik, "Optimal pairings", IEEE Transactions on Information Theory, Vol.56, No.1, pp.455-461, 2010.
|
Boxall John, El Mrabet Nadia, Laguillaumie Fabien, et al., "A variant of millers formula and algorithm", International Conference on Pairing-Based Cryptography, Springer, Berlin, Heidelberg, pp.417-434, 2010.
|
Yasuyuki Nogami, Masataka Akane, Yumi Sakemi, et al., "Efficient pairings on twisted Elliptic curve", Third International Conference on Convergence and Hybrid Information Technology (ICCIT'08), Vol.2, pp.430-439, 2008.
|
Costello Craig, Lange Tanja and Naehrig Michael, "Faster pairing computations on curves with high-degree twists", International Workshop on Public Key Cryptography, Springer, Berlin, Heidelberg, pp.224-242, 2010.
|
Edwards Harold, "A normal form for elliptic curves", Bulletin of the American Mathematical Society, Vol.44, No.3, pp.393-422, 2007.
|
Bernstein Daniel J, Birkner Peter, Joye Marc, et al., "Twisted Edwards curves", International Conference on Cryptology in Africa, Springer, Berlin, Heidelberg, pp.389-405, 2008.
|
Arene Christophe, Lange Tanja, Naehrig, et al., "Faster computation of the Tate pairing", Journal of Number Theory, Vol.131, No.5, pp.842-857, 2011.
|
Le Duc-Phong and Tan Chik How, "Improved Millers algorithm for computing pairings on Edwards curves", IEEE Transactions on Computers, Vol.63, No.10, pp.2626-2632, 2014.
|
Miller Victor S, "The Weil pairing, and its efficient calculation", Journal of Cryptology, Vol.17, No.4, pp.235-261, 2004.
|
Silverman Joseph H and Artin M, Arithmetic Geometry, Springer, 1986.
|
Morain François, "Edwards curves and CM curves", arXiv preprint arXiv:09042243, 2009.
|
Hess Florian, Smart Nigel P and Vercauteren Frederik, "The eta pairing revisited", IEEE Transactions on Information Theory, Vol.52, No.10, pp.4595-4602, 2006.
|
Barreto Paulo SLM, Galbraith Steven D, ÓhÉigeartaigh Colm, et al, "Efficient pairing computation on supersingular abelian varieties", Designs, Codes and Cryptography, Vol.42, No.3, pp.239-271, 2007.
|
Lee Eunjeong, Lee Hyang-Sook and Park Cheol-Min, "Efficient and generalized pairing computation on abelian varieties", IEEE Transactions on Information Theory, Vol.55, No.4, pp.1793-1803, 2009.
|