| Efficient algorithms for supersingular isogeny Diffie-Hellman C Costello, P Longa, M Naehrig Advances in Cryptology–CRYPTO 2016, 572-601, 2016 | 353 | 2016 |
| Supersingular Isogeny Key Encapsulation (SIKE) -- Submission to NIST's Post-Quantum Cryptography Standardization Process R Azarderakhsh, M Campagna, C Costello, L De Feo, A Jalali, D Jao, ... https://csrc.nist.gov/CSRC/media/Projects/Post-Quantum-Cryptography …, 2017 | 322* | 2017 |
| Faster explicit formulas for computing pairings over ordinary curves D Aranha, K Karabina, P Longa, C Gebotys, J López Advances in Cryptology–EUROCRYPT 2011, 48-68, 2011 | 268 | 2011 |
| Speeding up the number theoretic transform for faster ideal lattice-based cryptography P Longa, M Naehrig Applied Cryptography and Network Security–ACNS 2016, 124-139, 2016 | 243 | 2016 |
| Efficient compression of SIDH public keys C Costello, D Jao, P Longa, M Naehrig, J Renes, D Urbanik Advances in Cryptology–EUROCRYPT 2017, 679-706, 2017 | 158 | 2017 |
| FrodoKEM -- Submission to NIST's Post-Quantum Cryptography Standardization Process E Alkim, JW Bos, L Ducas, P Longa, I Mironov, M Naehrig, V Nikolaenko, ... | 155* | 2017 |
| Fourℚ: Four-Dimensional Decompositions on a ℚ-curve over the Mersenne Prime C Costello, P Longa Advances in Cryptology–ASIACRYPT 2015, 214-235, 2015 | 145 | 2015 |
| Selecting elliptic curves for cryptography: An efficiency and security analysis JW Bos, C Costello, P Longa, M Naehrig Journal of Cryptographic Engineering, 1-28, 2015 | 138 | 2015 |
| Fast and flexible elliptic curve point arithmetic over prime fields P Longa, A Miri IEEE Transactions on Computers 57 (3), 289-302, 2008 | 114 | 2008 |
| The Lattice-Based Digital Signature Scheme qTESLA E Alkim, PSLM Barreto, N Bindel, P Longa, JE Ricardini Applied Cryptography and Network Security–ACNS 2020 12146, 441-460, 2020 | 102 | 2020 |
| Area-efficient FIR filter design on FPGAs using distributed arithmetic P Longa, A Miri IEEE International Symposium on Signal Processing and Information Technology …, 2006 | 101 | 2006 |
| Four-dimensional Gallant–Lambert–Vanstone scalar multiplication P Longa, F Sica Journal of Cryptology 27 (2), 248-283, 2014 | 96 | 2014 |
| Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves A Faz-Hernández, P Longa, AH Sánchez Topics in Cryptology–CT-RSA 2014, 1-27, 2014 | 89* | 2014 |
| Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV–GLS curves (extended version) A Faz-Hernández, P Longa, AH Sánchez Journal of Cryptographic Engineering, 1-22, 2014 | 88 | 2014 |
| New composite operations and precomputation scheme for elliptic curve cryptosystems over prime fields P Longa, A Miri Public Key Cryptography–PKC 2008, 229-247, 2008 | 86 | 2008 |
| Accelerating the scalar multiplication on elliptic curve cryptosystems over prime fields P Longa University of Ottawa, 2007 | 77 | 2007 |
| FourQ on Embedded Devices with Strong Countermeasures Against Side-Channel Attacks Z Liu, P Longa, GCCF Pereira, O Reparaz, H Seo Cryptographic Hardware and Embedded Systems–CHES 2017, 665-686, 2017 | 65* | 2017 |
| Efficient implementation of bilinear pairings on ARM processors G Grewal, R Azarderakhsh, P Longa, S Hu, D Jao Selected Areas in Cryptography–SAC 2012, 149-165, 2013 | 65 | 2013 |
| Improved Classical Cryptanalysis of SIKE in Practice C Costello, P Longa, M Naehrig, J Renes, F Virdia Public Key Cryptography–PKC 2020 12111, 505-534, 2020 | 64* | 2020 |
| The realm of the pairings DF Aranha, PSLM Barreto, P Longa, JE Ricardini Selected Areas in Cryptography–SAC 2013, 3-25, 2013 | 63 | 2013 |
Craig CostelloPrincipal Researcher, Microsoft Research, USAVerified email at microsoft.com
