Benjamin Smith

Orcid: 0000-0002-6701-1420

Affiliations:
  • École Polytechnique, Paris, France
  • INRIA, France


According to our database1, Benjamin Smith authored at least 50 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
PHOENIX: Crypto-Agile Hardware Sharing for ML-KEM and HQC.
IACR Cryptol. ePrint Arch., 2025

Simpler and Faster Pairings from the Montgomery Ladder.
IACR Commun. Cryptol., 2025

Compressed Verification for Post-quantum Signatures with Long-Term Public Keys.
Proceedings of the Cryptology and Network Security - 24th International Conference, 2025

2024
Efficient (3,3)-isogenies on fast Kummer surfaces.
IACR Cryptol. ePrint Arch., 2024

Efficient (3, 3)-isogenies on fast Kummer surfaces.
CoRR, 2024

2023
Deterministic factoring with oracles.
Appl. Algebra Eng. Commun. Comput., July, 2023

Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields.
Proceedings of the Progress in Cryptology - LATINCRYPT 2023, 2023

Advances in asymmetric cryptographic algorithms.
, 2023

2022
Failing to hash into supersingular isogeny graphs.
IACR Cryptol. ePrint Arch., 2022

Efficient supersingularity testing over 픽<sub>p</sub> and CSIDH key validation.
IACR Cryptol. ePrint Arch., 2022

Trustless unknown-order groups.
CoRR, 2022

Quantum-Resistant Software Update Security on Low-Power Networked Embedded Devices.
Proceedings of the Applied Cryptography and Network Security, 2022

2021
An atlas of the Richelot isogeny graph.
IACR Cryptol. ePrint Arch., 2021

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph.
IACR Cryptol. ePrint Arch., 2021

Higher-degree supersingular group actions.
IACR Cryptol. ePrint Arch., 2021

Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices.
IACR Cryptol. ePrint Arch., 2021

Wavelet: Code-based postquantum signatures with fast verification on microcontrollers.
IACR Cryptol. ePrint Arch., 2021

CTIDH: faster constant-time CSIDH.
IACR Cryptol. ePrint Arch., 2021

Extending the GLS endomorphism to speed up GHS Weil descent using Magma.
Finite Fields Their Appl., 2021

2020
Faster computation of isogenies of large prime degree.
IACR Cryptol. ePrint Arch., 2020

The Supersingular Isogeny Problem in Genus 2 and Beyond.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

2019
Hash functions from superspecial genus-2 curves using Richelot isogenies.
IACR Cryptol. ePrint Arch., 2019

Distributions of Traces of Frobenius for Smooth Plane Curves Over Finite Fields.
Exp. Math., 2019

Stronger and Faster Side-Channel Protections for CSIDH.
Proceedings of the Progress in Cryptology - LATINCRYPT 2019, 2019

2018
Montgomery curves and their arithmetic - The case of large characteristic fields.
J. Cryptogr. Eng., 2018

Quantum Equivalence of the DLP and CDHP for Group Actions.
IACR Cryptol. ePrint Arch., 2018

Pre- and Post-quantum Diffie-Hellman from Groups, Actions, and Isogenies.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

Towards Practical Key Exchange from Ordinary Isogeny Graphs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Montgomery curves and their arithmetic.
CoRR, 2017

Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication.
CoRR, 2017

qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Computing cardinalities of -curve reductions over finite fields.
LMS J. Comput. Math., 2016

$μ$Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers.
CoRR, 2016

Fast, Uniform Scalar Multiplication for Genus 2 Jacobians with Fast Kummers.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

\mu Kummer: Efficient Hyperelliptic Signatures and Key Exchange on Microcontrollers.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2016, 2016

2015
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes.
IACR Cryptol. ePrint Arch., 2015

Factoring Safe Semiprimes with a Single Quantum Query.
CoRR, 2015

2014
The Q-curve Construction for Endomorphism-Accelerated Elliptic Curves.
IACR Cryptol. ePrint Arch., 2014

Faster Compact Diffie-Hellman: Endomorphisms on the x-line.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians.
IACR Cryptol. ePrint Arch., 2013

Families of Fast Elliptic Curves from ℚ-curves.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2011
Families of explicitly isogenous Jacobians of variable-separated curves.
LMS J. Comput. Math., 2011

Counting Points on Genus 2 Curves with Real Multiplication.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Model Free Human Pose Estimation with Application to the Classification of Abnormal Human Movement and the Detection of Hidden Loads.
PhD thesis, 2010

2009
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves<sup>, </sup>.
J. Cryptol., 2009

Distortion maps for supersingular genus two curves.
J. Math. Cryptol., 2009

2008
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves.
Proceedings of the Advances in Cryptology, 2008

2006
Discrete Logarithms in Generalized Jacobians.
IACR Cryptol. ePrint Arch., 2006

Distortion maps for genus two curves.
IACR Cryptol. ePrint Arch., 2006

Efficiently Computable Endomorphisms for Hyperelliptic Curves.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006


  Loading...