| # | Title | Citations |
| 1. | Deterministic usage of the digital signature algorithm (DSA) and elliptic curve digital signature algorithm (ECDSA) Pornin, Thomas. 2013 | 115 |
| 2. | Decaf: Eliminating cofactors through point compression Hamburg, Mike. 2015 | 30 |
| 3. | Constructive and computational aspects of cryptographic pairings Naehrig, Michael. 2009 | 24 |
| 4. | LadderLeak: Breaking ECDSA With Less Than One Bit Of Nonce Leakage Diego F. Aranha and Felipe Rodrigues Novaes and Akira Takahashi and Mehdi Tibouchi and Yuval Yarom. 2020  | 9 |
| 5. | Thresholdizing HashEdDSA: MPC to the rescue Bonte, Charlotte and Smart, Nigel P and Tanguy, Titouan. 2021 | 5 |
| 6. | The Provable Security of Ed25519: Theory and Practice Brendel, Jacqueline and Cremers, Cas and Jackson, Dennis and Zhao, Mang. 2020 | 3 |
| 7. | Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020  | 2 |
| 8. | MuSig2: Simple Two-Round Schnorr Multi-Signatures Jonas Nick and Tim Ruffing and Yannick Seurin. 2020 | 2 |
| 9. | Taming the many EdDSAs Konstantinos Chalkias and François Garillot and Valeria Nikolaenko. 2020 | 2 |
| 10. | UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts Canetti, Ran and Gennaro, Rosario and Goldfeder, Steven and Makriyannis, Nikolaos and Peled, Udi. 2020 | 1 |
| 11. | Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019 | 0 |
| 12. | Impossibility on the Schnorr Signature from the One-more DL Assumption in the Non-programmable Random Oracle Model Masayuki Fukumitsu and Shingo Hasegawa. 2020 | 0 |
| 13. | A Survey of ECDSA Threshold Signing Jean-Philippe Aumasson and Adrian Hamelink and Omer Shlomovits. 2020 | 0 |
| 14. | Efficient Verification of Optimized Code: Correct High-speed Curve25519 Schoolderman, Marc and Moerman, Jonathan and Smetsers, Sjaak and van Eekelen, Marko. 2020 | 0 |