On Efficient Pairings on Elliptic Curves over Extension Fields-Reference-Cited by-同舟云学术

On Efficient Pairings on Elliptic Curves over Extension Fields

Published:2013 Issue: Volume: Page:1-18
ISSN:0302-9743
Container-title:Pairing-Based Cryptography – Pairing 2012
language:
Short-container-title:

Author:

Zhang Xusheng,Wang Kunpeng,Lin Dongdai

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-36334-4_1

Reference34 articles.

1. Lecture Notes in Computer Science;D.V. Bailey,1998

2. Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology 14(3), 153–176 (2001)

3. Bajard, J.C., Imbert, L., Negre, C., Plantard, T.: Efficient multiplication in GF(pk) for elliptic curve cryptography. In: Proceedings of the 16th IEEE Symposium on Computer Arithmetic 2003, pp. 181–187. IEEE (2003)

4. Lecture Notes in Computer Science;P.S.L.M. Barreto,2002

5. Barreto, P.S.L.M., Galbraith, S.D., hÉigeartaigh, C.Ó., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42(3), 239–271 (2007)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerating Beta Weil Pairing with Precomputation and Multi-pairing Techniques;Advances in Information and Computer Security;2020

2. Beta Weil pairing revisited;Afrika Matematika;2019-01-16

3. FPGA Implementation of Various Elliptic Curve Pairings over Odd Characteristic Field with Non Supersingular Curves;IEICE Transactions on Information and Systems;2016

4. Fast Symmetric Pairing Revisited;Pairing-Based Cryptography – Pairing 2013;2014