Efficiently Computable Endomorphisms for Hyperelliptic Curves. - David R. Kohel; Benjamin A. Smith (ANTS, 2006)

Distortion maps for genus two curves. - Steven D. Galbraith; Jordi Pujolàs; Christophe Ritzenthaler; Benjamin A. Smith (IACR Cryptol. ePrint Arch., 2006)

Discrete Logarithms in Generalized Jacobians. - Steven D. Galbraith; Benjamin A. Smith (IACR Cryptol. ePrint Arch., 2006)

Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves. - Benjamin A. Smith (IACR Cryptol. ePrint Arch., 2007)

Distortion maps for supersingular genus two curves. - Steven D. Galbraith; Jordi Pujolàs; Christophe Ritzenthaler; Benjamin A. Smith (J. Math. Cryptol., 2009)

Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves, . - Benjamin A. Smith (J. Cryptol., 2009)

Model Free Human Pose Estimation with Application to the Classification of Abnormal Human Movement and the Detection of Hidden Loads. - Benjamin A. Smith (2010)

Counting Points on Genus 2 Curves with Real Multiplication. - Pierrick Gaudry; David R. Kohel; Benjamin A. Smith (IACR Cryptol. ePrint Arch., 2011)

Families of explicitly isogenous Jacobians of variable-separated curves. - Benjamin Smith 003 (LMS J. Comput. Math., 2011)

Faster Compact Diffie-Hellman: Endomorphisms on the x-line. - Craig Costello; Hüseyin Hisil; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2013)

Families of fast elliptic curves from Q-curves. - Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2013)

Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians. - Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2013)

Factoring Safe Semiprimes with a Single Quantum Query. - Frédéric Grosshans; Thomas Lawson; François Morain; Benjamin Smith 003 (CoRR, 2015)

Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes. - Ping Ngai Chung; Craig Costello; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2015)

$μ$Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers. - Joost Renes; Peter Schwabe; Benjamin Smith 003; Lejla Batina (CoRR, 2016)

Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers. - Ping Ngai Chung; Craig Costello; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2016)

( mu )Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers. - Joost Renes; Peter Schwabe; Benjamin Smith 003; Lejla Batina (IACR Cryptol. ePrint Arch., 2016)

The ℚ-curve Construction for Endomorphism-Accelerated Elliptic Curves. - Benjamin Smith 003 (J. Cryptol., 2016)

Computing cardinalities of -curve reductions over finite fields. - François Morain; Charlotte Scribot; Benjamin Smith 003 (LMS J. Comput. Math., 2016)

Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. - Sean Ballentine; Aurore Guillevic; Elisa Lorenzo García; Chloe Martindale; Maike Massierer; Benjamin Smith 003; Jaap Top (CoRR, 2017)

Montgomery curves and their arithmetic. - Craig Costello; Benjamin Smith 003 (CoRR, 2017)

qDSA: Small and Secure Digital Signatures with Curve-based Diffie-Hellman Key Pairs. - Joost Renes; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2017)

Pre- and Post-quantum Diffie-Hellman from Groups, Actions, and Isogenies. - Benjamin Smith 003 (WAIFI, 2018)

Towards practical key exchange from ordinary isogeny graphs. - Luca De Feo; Jean Kieffer; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2018)

Quantum Equivalence of the DLP and CDHP for Group Actions. - Steven D. Galbraith; Lorenz Panny; Benjamin Smith 003; Frederik Vercauteren (IACR Cryptol. ePrint Arch., 2018)

Montgomery curves and their arithmetic - The case of large characteristic fields. - Craig Costello; Benjamin Smith 003 (J. Cryptogr. Eng., 2018)

Distributions of Traces of Frobenius for Smooth Plane Curves Over Finite Fields. - Reynald Lercier; Christophe Ritzenthaler; Florent Rovetta; Jeroen Sijsling; Benjamin Smith 003 (Exp. Math., 2019)

Stronger and Faster Side-Channel Protections for CSIDH. - Daniel Cervantes-Vázquez; Mathilde Chenu; Jesús-Javier Chi-Domínguez; Luca De Feo; Francisco Rodríguez-Henríquez; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2019)

The supersingular isogeny problem in genus 2 and beyond. - Craig Costello; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2019)

Faster computation of isogenies of large prime degree. - Daniel J. Bernstein; Luca De Feo; Antonin Leroux; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2020)

Hash functions from superspecial genus-2 curves using Richelot isogenies. - Wouter Castryck; Thomas Decru; Benjamin Smith 003 (J. Math. Cryptol., 2020)

Extending the GLS endomorphism to speed up GHS Weil descent using Magma. - Jesús-Javier Chi-Domínguez; Francisco Rodríguez-Henríquez; Benjamin Smith 003 (Finite Fields Their Appl., 2021)

Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. - Gustavo Banegas; Thomas Debris-Alazard; Milena Nedeljkovic; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2021)

Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices. - Gustavo Banegas; Koen Zandberg; Adrian Herrmann; Emmanuel Baccelli; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2021)

Higher-degree supersingular group actions. - Mathilde Chenu; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2021)

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph. - Enric Florit; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2021)

An atlas of the Richelot isogeny graph. - Enric Florit; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2021)

CTIDH: faster constant-time CSIDH. - Gustavo Banegas; Daniel J. Bernstein; Fabio Campos; Tung Chou; Tanja Lange 001; Michael Meyer 001; Benjamin Smith 003; Jana Sotáková (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2021)

Quantum-Resistant Software Update Security on Low-Power Networked Embedded Devices. - Gustavo Banegas; Koen Zandberg; Emmanuel Baccelli; Adrian Herrmann; Benjamin Smith 003 (ACNS, 2022)

Trustless unknown-order groups. - Samuel Dobson; Steven D. Galbraith; Benjamin Smith 003 (CoRR, 2022)

Efficient supersingularity testing over 픽p and CSIDH key validation. - Gustavo Banegas; Valerie Gilchrist; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2022)

Advances in asymmetric cryptographic algorithms. - Benjamin Smith 003 (2023)

Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. - Gustavo Banegas; Valerie Gilchrist; Anaëlle Le Dévéhat; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2023)

Deterministic factoring with oracles. - François Morain; Guénaël Renault; Benjamin Smith 003 (Appl. Algebra Eng. Commun. Comput., 2023)

Failing to Hash Into Supersingular Isogeny Graphs. - Jeremy Booher; Ross Bowden; Javad Doliskani; Tako Boris Fouotsa; Steven D. Galbraith; Sabrina Kunzweiler; Simon-Philipp Merz; Christophe Petit 001; Benjamin Smith 003; Katherine E. Stange; Yan Bo Ti; Christelle Vincent; et al. (Comput. J., 2024)

Efficient (3, 3)-isogenies on fast Kummer surfaces. - Maria Corte-Real Santos; Craig Costello; Benjamin Smith 003 (CoRR, 2024)

Efficient (3,3)-isogenies on fast Kummer surfaces. - Maria Corte-Real Santos; Craig Costello; Benjamin Smith 003 (IACR Cryptol. ePrint Arch., 2024)

Simpler and Faster Pairings from the Montgomery Ladder. - Giacomo Pope; Krijn Reijnders; Damien Robert 001; Alessandro Sferlazza; Benjamin Smith 003 (IACR Commun. Cryptol., 2025)

PHOENIX: Crypto-Agile Hardware Sharing for ML-KEM and HQC. - Antonio Ras; Antoine Loiseau; Mikaël Carmona; Simon Pontié; Guénaël Renault; Benjamin Smith 003; Emanuele Valea (IACR Cryptol. ePrint Arch., 2025)