| Disorientation faults in CSIDH. | 0 | 0.34 | 2022 |
| Concrete quantum cryptanalysis of binary elliptic curves. | 0 | 0.34 | 2021 |
| Non-randomness of S-unit lattices. | 0 | 0.34 | 2021 |
| CTIDH: faster constant-time CSIDH. | 0 | 0.34 | 2021 |
| Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions. | 0 | 0.34 | 2021 |
| Progress in Cryptology - LATINCRYPT 2017 - 5th International Conference on Cryptology and Information Security in Latin America, Havana, Cuba, September 20-22, 2017, Revised Selected Papers | 0 | 0.34 | 2019 |
| CSIDH: An Efficient Post-Quantum Commutative Group Action. | 5 | 0.43 | 2018 |
| HILA5 Pindakaas: On the CCA security of lattice-based encryption with error correction. | 2 | 0.37 | 2018 |
| Montgomery curves and the Montgomery ladder. | 0 | 0.34 | 2017 |
| Double-base scalar multiplication revisited. | 2 | 0.37 | 2017 |
| Post-quantum cryptography - dealing with the fallout of physics success. | 1 | 0.35 | 2017 |
| Sliding Right Into Disaster: Left-To-Right Sliding Windows Leak | 4 | 0.41 | 2017 |
| (In-)Secure messaging with the Silent Circle instant messaging protocol. | 0 | 0.34 | 2016 |
| NTRU Prime. | 0 | 0.34 | 2016 |
| Faster discrete logarithms on FPGAs. | 1 | 0.34 | 2016 |
| EdDSA for more curves. | 3 | 0.44 | 2015 |
| How to Manipulate Curve Standards: A White Paper for the Black Hat http: //bada55.cr.yp.to. | 2 | 0.38 | 2015 |
| Dual EC : a standardized back door | 5 | 0.41 | 2015 |
| Bad Directions In Cryptographic Hash Functions | 4 | 0.38 | 2015 |
| Twisted Hessian curves. | 0 | 0.34 | 2015 |
| Tighter, faster, simpler side-channel security evaluations beyond computing power. | 14 | 0.71 | 2015 |
| Tweetnacl: A Crypto Library In 100 Tweets | 11 | 0.58 | 2014 |
| Hyper-and-elliptic-curve cryptography. | 2 | 0.38 | 2014 |
| On the practical exploitability of dual EC in TLS implementations | 5 | 0.82 | 2014 |
| Kummer Strikes Back: New DH Speed Records. | 19 | 0.87 | 2014 |
| SPHINCS: Practical Stateless Hash-Based Signatures. | 49 | 2.04 | 2014 |
| How to manipulate curve standards: a white paper for the black hat. | 2 | 0.41 | 2014 |
| Kangaroos in Side-Channel Attacks. | 7 | 0.55 | 2014 |
| Batch NFS. | 0 | 0.34 | 2014 |
| Curve41417: Karatsuba Revisited | 4 | 0.43 | 2014 |
| Quantum Algorithms For The Subset-Sum Problem | 10 | 0.51 | 2013 |
| MinimaLT: minimal-latency networking through better security | 19 | 0.98 | 2013 |
| Elligator: elliptic-curve points indistinguishable from uniform random strings | 39 | 1.91 | 2013 |
| Pairing-Based Cryptography - Pairing 2012 - 5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers | 20 | 0.85 | 2013 |
| ECM using Edwards curves. | 4 | 0.41 | 2013 |
| Factoring RSA keys from certified smart cards: Coppersmith in the wild. | 7 | 0.50 | 2013 |
| Two grumpy giants and a baby. | 7 | 0.60 | 2012 |
| Never trust a bunny | 7 | 0.47 | 2012 |
| Usable assembly language for GPUs: a success story. | 1 | 0.37 | 2012 |
| The security impact of a new cryptographic library | 57 | 2.66 | 2012 |
| The new SHA-3 software shootout. | 2 | 0.42 | 2012 |
| Computing small discrete logarithms faster. | 9 | 0.57 | 2012 |
| Non-uniform cracks in the concrete: the power of free precomputation. | 27 | 1.18 | 2012 |
| Faster batch forgery identification. | 6 | 0.51 | 2012 |
| Ecc2k-130 On Nvidia Gpus | 6 | 0.45 | 2012 |
| Wild mceliece incognito | 3 | 0.41 | 2011 |
| Faster 2-regular information-set decoding | 6 | 0.51 | 2011 |
| Really fast syndrome-based hashing | 8 | 0.45 | 2011 |
| On the correct use of the negation map in the Pollard rho method | 21 | 0.96 | 2011 |
| High-speed high-security signatures | 94 | 3.50 | 2011 |
