共 50 条
- [31] Generating Pairing-Friendly Curves with the CM Equation of Degree 1 PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009, 2009, 5671 : 66 - 77
- [32] Fast Hashing to G2 on Pairing-Friendly Curves PAIRING-BASED CRYPTOGRAPHY - PAIRING 2009, 2009, 5671 : 102 - 113
- [34] Constructing pairing-friendly genus 2 curves with ordinary jacobians Pairing-Based Cryptography - Pairing 2007, 2007, 4575 : 152 - 176
- [36] An Algorithm to Generate Special Type of Pairing-Friendly Elliptic Curves 2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 123 - 126
- [37] On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant PROGRESS IN CRYPTOLOGY - INDOCRYPT 2011, 2011, 7107 : 310 - 319
- [38] Constructing pairing-friendly elliptic curves with embedding degree 10 ALGORITHMIC NUMBER THEORY, PROCEEDINGS, 2006, 4076 : 452 - 465
- [39] Constructing pairing-friendly genus 2 curves with split Jacobian Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7668 LNCS : 431 - 453
- [40] Revisiting Pairing-Friendly Curves with Embedding Degrees 10 and 14 ADVANCES IN CRYPTOLOGY - ASIACRYPT 2024, PT II, 2025, 15485 : 454 - 485