Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms-Reference-Cited by-同舟云学术

Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms

Published: Issue: Volume: Page:243-264
ISSN:0302-9743
Container-title:Pairing-Based Cryptography – Pairing 2008
language:
Short-container-title:

Author:

Fan Xinxin,Gong Guang,Jao David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-85538-5_17.pdf

Reference39 articles.

1. Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall/CRC, Boca Raton (2006)

2. Barreto, P.L.S.M., Galbraith, S., Ó’hÉigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Design, Codes and Cryptography 42, 239–271 (2007)

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

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

5. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SIAM Journal of Computing 32(3), 586–615 (2003)

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

1. Pairings on Hyperelliptic Curves with Considering Recent Progress on the NFS Algorithms;Mathematical Modelling for Next-Generation Cryptography;2017-07-26

2. A Weil Pairing on a Family of Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2017

3. Omega Pairing on Hyperelliptic Curves;Information Security and Cryptology;2014