default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Smith 0003
Benjamin A. Smith
Person information
- affiliation: École Polytechnique, Paris, France
- affiliation: INRIA, France
Other persons with the same name
- Benjamin Smith — disambiguation page
- Benjamin Smith 0001 — Columbia University, Department of Computer Science, New York, NY, USA
- Benjamin Smith 0002 — Simon Fraser University, Medical Image Analysis Lab, Canada
- Benjamin Smith 0004 (aka: Benjamin Joseph Smith) — Vancouver Island University, Nanaimo, Canada,
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j12]Jeremy Booher
, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to Hash Into Supersingular Isogeny Graphs. Comput. J. 67(8): 2702-2719 (2024)- [e1]Benjamin Smith, Huapeng Wu:
Selected Areas in Cryptography - 29th International Conference, SAC 2022, Windsor, ON, Canada, August 24-26, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13742, Springer 2024, ISBN 978-3-031-58410-7 [contents] - [i56]Maria Corte-Real Santos, Craig Costello, Benjamin Smith:
Efficient (3, 3)-isogenies on fast Kummer surfaces. CoRR abs/2402.01223 (2024) - [i55]Maria Corte-Real Santos, Craig Costello, Benjamin Smith:
Efficient (3,3)-isogenies on fast Kummer surfaces. IACR Cryptol. ePrint Arch. 2024: 144 (2024) - 2023
- [b2]Benjamin Smith:
Advances in asymmetric cryptographic algorithms. Polytechnic Institute of Paris, Palaiseau, France, 2023 - [j11]François Morain, Guénaël Renault, Benjamin Smith:
Deterministic factoring with oracles. Appl. Algebra Eng. Commun. Comput. 34(4): 663-690 (2023) - [c14]Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith:
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. LATINCRYPT 2023: 129-148 - [i54]Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith:
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. CoRR abs/2306.16072 (2023) - [i53]Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith:
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. IACR Cryptol. ePrint Arch. 2023: 995 (2023) - 2022
- [c13]Gustavo Banegas, Koen Zandberg, Emmanuel Baccelli, Adrian Herrmann, Benjamin Smith:
Quantum-Resistant Software Update Security on Low-Power Networked Embedded Devices. ACNS 2022: 872-891 - [i52]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. CoRR abs/2205.00135 (2022) - [i51]Samuel Dobson, Steven D. Galbraith, Benjamin Smith:
Trustless unknown-order groups. CoRR abs/2211.16128 (2022) - [i50]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. IACR Cryptol. ePrint Arch. 2022: 518 (2022) - [i49]Gustavo Banegas, Valerie Gilchrist, Benjamin Smith:
Efficient supersingularity testing over 픽p and CSIDH key validation. IACR Cryptol. ePrint Arch. 2022: 880 (2022) - 2021
- [j10]Jesús-Javier Chi-Domínguez, Francisco Rodríguez-Henríquez, Benjamin Smith:
Extending the GLS endomorphism to speed up GHS Weil descent using Magma. Finite Fields Their Appl. 75: 101891 (2021) - [j9]Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, Michael Meyer, Benjamin Smith, Jana Sotáková:
CTIDH: faster constant-time CSIDH. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4): 351-387 (2021) - [i48]Enric Florit, Benjamin Smith:
Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph. CoRR abs/2101.00919 (2021) - [i47]Gustavo Banegas, Koen Zandberg, Adrian Herrmann, Emmanuel Baccelli, Benjamin Smith:
Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices. CoRR abs/2106.05577 (2021) - [i46]Jesús-Javier Chi-Domínguez, Francisco Rodríguez-Henríquez, Benjamin Smith:
Extending the GLS endomorphism to speed up GHS Weil descent using Magma. CoRR abs/2106.09967 (2021) - [i45]Mathilde Chenu, Benjamin Smith:
Higher-degree supersingular group actions. CoRR abs/2107.08832 (2021) - [i44]Gustavo Banegas, Thomas Debris-Alazard, Milena Nedeljkovic, Benjamin Smith:
Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. CoRR abs/2110.13488 (2021) - [i43]Enric Florit, Benjamin Smith:
Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph. IACR Cryptol. ePrint Arch. 2021: 12 (2021) - [i42]Enric Florit, Benjamin Smith:
An atlas of the Richelot isogeny graph. IACR Cryptol. ePrint Arch. 2021: 13 (2021) - [i41]Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, Michael Meyer, Benjamin Smith, Jana Sotáková:
CTIDH: faster constant-time CSIDH. IACR Cryptol. ePrint Arch. 2021: 633 (2021) - [i40]Jesús-Javier Chi-Domínguez, Francisco Rodríguez-Henríquez, Benjamin Smith:
Extending the GLS endomorphism to speed up GHS Weil descent using Magma. IACR Cryptol. ePrint Arch. 2021: 676 (2021) - [i39]Gustavo Banegas, Koen Zandberg, Adrian Herrmann, Emmanuel Baccelli, Benjamin Smith:
Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices. IACR Cryptol. ePrint Arch. 2021: 781 (2021) - [i38]Mathilde Chenu, Benjamin Smith:
Higher-degree supersingular group actions. IACR Cryptol. ePrint Arch. 2021: 955 (2021) - [i37]Gustavo Banegas, Thomas Debris-Alazard, Milena NedeljkoviÄ, Benjamin Smith:
Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. IACR Cryptol. ePrint Arch. 2021: 1432 (2021) - 2020
- [j8]Wouter Castryck, Thomas Decru, Benjamin Smith:
Hash functions from superspecial genus-2 curves using Richelot isogenies. J. Math. Cryptol. 14(1): 268-292 (2020) - [c12]Craig Costello, Benjamin Smith:
The Supersingular Isogeny Problem in Genus 2 and Beyond. PQCrypto 2020: 151-168 - [i36]Daniel J. Bernstein, Luca De Feo, Antonin Leroux, Benjamin Smith:
Faster computation of isogenies of large prime degree. CoRR abs/2003.10118 (2020) - [i35]Daniel J. Bernstein, Luca De Feo, Antonin Leroux, Benjamin Smith:
Faster computation of isogenies of large prime degree. IACR Cryptol. ePrint Arch. 2020: 341 (2020)
2010 – 2019
- 2019
- [j7]Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling, Benjamin Smith:
Distributions of Traces of Frobenius for Smooth Plane Curves Over Finite Fields. Exp. Math. 28(1): 39-48 (2019) - [c11]Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca De Feo, Francisco Rodríguez-Henríquez, Benjamin Smith:
Stronger and Faster Side-Channel Protections for CSIDH. LATINCRYPT 2019: 173-193 - [i34]Wouter Castryck, Thomas Decru, Benjamin Smith:
Hash functions from superspecial genus-2 curves using Richelot isogenies. CoRR abs/1903.06451 (2019) - [i33]Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca De Feo, Francisco Rodríguez-Henríquez, Benjamin Smith:
Stronger and Faster Side-Channel Protections for CSIDH. CoRR abs/1907.08704 (2019) - [i32]Craig Costello, Benjamin Smith:
The supersingular isogeny problem in genus 2 and beyond. CoRR abs/1912.00701 (2019) - [i31]Wouter Castryck, Thomas Decru, Benjamin Smith:
Hash functions from superspecial genus-2 curves using Richelot isogenies. IACR Cryptol. ePrint Arch. 2019: 296 (2019) - [i30]Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca De Feo, Francisco Rodríguez-Henríquez, Benjamin Smith:
Stronger and Faster Side-Channel Protections for CSIDH. IACR Cryptol. ePrint Arch. 2019: 837 (2019) - [i29]Craig Costello, Benjamin Smith:
The supersingular isogeny problem in genus 2 and beyond. IACR Cryptol. ePrint Arch. 2019: 1387 (2019) - 2018
- [j6]Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic - The case of large characteristic fields. J. Cryptogr. Eng. 8(3): 227-240 (2018) - [c10]Luca De Feo, Jean Kieffer, Benjamin Smith:
Towards Practical Key Exchange from Ordinary Isogeny Graphs. ASIACRYPT (3) 2018: 365-394 - [c9]Benjamin Smith:
Pre- and Post-quantum Diffie-Hellman from Groups, Actions, and Isogenies. WAIFI 2018: 3-40 - [i28]François Morain, Guénaël Renault, Benjamin Smith:
Deterministic factoring with oracles. CoRR abs/1802.08444 (2018) - [i27]Benjamin Smith:
Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies. CoRR abs/1809.04803 (2018) - [i26]Luca De Feo, Jean Kieffer, Benjamin Smith:
Towards practical key exchange from ordinary isogeny graphs. CoRR abs/1809.07543 (2018) - [i25]Steven D. Galbraith, Lorenz Panny, Benjamin Smith, Frederik Vercauteren:
Quantum Equivalence of the DLP and CDHP for Group Actions. CoRR abs/1812.09116 (2018) - [i24]Luca De Feo, Jean Kieffer, Benjamin Smith:
Towards practical key exchange from ordinary isogeny graphs. IACR Cryptol. ePrint Arch. 2018: 485 (2018) - [i23]Steven D. Galbraith, Lorenz Panny, Benjamin Smith, Frederik Vercauteren:
Quantum Equivalence of the DLP and CDHP for Group Actions. IACR Cryptol. ePrint Arch. 2018: 1199 (2018) - 2017
- [c8]Joost Renes, Benjamin Smith:
qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs. ASIACRYPT (2) 2017: 273-302 - [i22]Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García, Chloe Martindale, Maike Massierer, Benjamin Smith, Jaap Top:
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. CoRR abs/1701.01927 (2017) - [i21]Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic. CoRR abs/1703.01863 (2017) - [i20]Joost Renes, Benjamin Smith:
qDSA: Small and Secure Digital Signatures with Curve-based Diffie-Hellman Key Pairs. CoRR abs/1709.03358 (2017) - [i19]Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic: The case of large characteristic fields. IACR Cryptol. ePrint Arch. 2017: 212 (2017) - [i18]Joost Renes, Benjamin Smith:
qDSA: Small and Secure Digital Signatures with Curve-based Diffie-Hellman Key Pairs. IACR Cryptol. ePrint Arch. 2017: 518 (2017) - 2016
- [j5]Benjamin Smith:
The ℚ-curve Construction for Endomorphism-Accelerated Elliptic Curves. J. Cryptol. 29(4): 806-832 (2016) - [j4]François Morain, Charlotte Scribot, Benjamin Smith:
Computing cardinalities of -curve reductions over finite fields. LMS J. Comput. Math. 19(A): 115-129 (2016) - [c7]Joost Renes, Peter Schwabe, Benjamin Smith, Lejla Batina:
\mu Kummer: Efficient Hyperelliptic Signatures and Key Exchange on Microcontrollers. CHES 2016: 301-320 - [c6]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, Uniform Scalar Multiplication for Genus 2 Jacobians with Fast Kummers. SAC 2016: 465-481 - [i17]Joost Renes, Peter Schwabe, Benjamin Smith, Lejla Batina:
$μ$Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers. CoRR abs/1604.06059 (2016) - [i16]Joost Renes, Peter Schwabe, Benjamin Smith, Lejla Batina:
\(\mu\)Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers. IACR Cryptol. ePrint Arch. 2016: 366 (2016) - [i15]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers. IACR Cryptol. ePrint Arch. 2016: 777 (2016) - 2015
- [i14]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes. CoRR abs/1510.03174 (2015) - [i13]Frédéric Grosshans, Thomas Lawson, François Morain, Benjamin Smith:
Factoring Safe Semiprimes with a Single Quantum Query. CoRR abs/1511.04385 (2015) - [i12]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes. IACR Cryptol. ePrint Arch. 2015: 983 (2015) - 2014
- [c5]Craig Costello, Hüseyin Hisil, Benjamin Smith:
Faster Compact Diffie-Hellman: Endomorphisms on the x-line. EUROCRYPT 2014: 183-200 - [i11]Benjamin Smith:
The Q-curve construction for endomorphism-accelerated elliptic curves. CoRR abs/1409.4526 (2014) - [i10]Benjamin Smith:
The Q-curve Construction for Endomorphism-Accelerated Elliptic Curves. IACR Cryptol. ePrint Arch. 2014: 727 (2014) - 2013
- [c4]Benjamin Smith:
Families of Fast Elliptic Curves from ℚ-curves. ASIACRYPT (1) 2013: 61-78 - [i9]Benjamin Smith:
Families of fast elliptic curves from Q-curves. CoRR abs/1305.5400 (2013) - [i8]Benjamin Smith:
Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians. CoRR abs/1310.5250 (2013) - [i7]Benjamin Smith:
Families of fast elliptic curves from Q-curves. IACR Cryptol. ePrint Arch. 2013: 312 (2013) - [i6]Benjamin Smith:
Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians. IACR Cryptol. ePrint Arch. 2013: 672 (2013) - [i5]Craig Costello, Hüseyin Hisil, Benjamin Smith:
Faster Compact Diffie-Hellman: Endomorphisms on the x-line. IACR Cryptol. ePrint Arch. 2013: 692 (2013) - 2011
- [j3]Benjamin Smith:
Families of explicitly isogenous Jacobians of variable-separated curves. LMS J. Comput. Math. 14: 179-199 (2011) - [c3]Pierrick Gaudry, David R. Kohel, Benjamin A. Smith:
Counting Points on Genus 2 Curves with Real Multiplication. ASIACRYPT 2011: 504-519 - [i4]Pierrick Gaudry, David R. Kohel, Benjamin A. Smith:
Counting Points on Genus 2 Curves with Real Multiplication. IACR Cryptol. ePrint Arch. 2011: 295 (2011) - 2010
- [b1]Benjamin A. Smith:
Model Free Human Pose Estimation with Application to the Classification of Abnormal Human Movement and the Detection of Hidden Loads. Virginia Tech, Blacksburg, VA, USA, 2010
2000 – 2009
- 2009
- [j2]Steven D. Galbraith, Jordi Pujolàs, Christophe Ritzenthaler, Benjamin A. Smith:
Distortion maps for supersingular genus two curves. J. Math. Cryptol. 3(1): 1-18 (2009) - [j1]Benjamin A. Smith:
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves, . J. Cryptol. 22(4): 505-529 (2009) - 2008
- [c2]Benjamin A. Smith:
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. EUROCRYPT 2008: 163-180 - 2007
- [i3]Benjamin A. Smith:
Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2007: 428 (2007) - 2006
- [c1]David R. Kohel, Benjamin A. Smith:
Efficiently Computable Endomorphisms for Hyperelliptic Curves. ANTS 2006: 495-509 - [i2]Steven D. Galbraith, Benjamin A. Smith:
Discrete Logarithms in Generalized Jacobians. IACR Cryptol. ePrint Arch. 2006: 333 (2006) - [i1]Steven D. Galbraith, Jordi Pujolàs, Christophe Ritzenthaler, Benjamin A. Smith:
Distortion maps for genus two curves. IACR Cryptol. ePrint Arch. 2006: 375 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 20:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
