Damien Robert

Orcid: 0000-0003-4378-4274

Affiliations:
  • INRIA Bordeaux-Sud-Ouest, Talence, France


According to our database1, Damien Robert authored at least 36 papers between 2009 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Hensel-lifting black-box algorithms and fast trace computation for elliptic-curve endomorphisms.
IACR Cryptol. ePrint Arch., 2026

On the conversion of module representations for higher dimensional supersingular isogenies.
IACR Cryptol. ePrint Arch., 2026

2025
Towards computing canonical lifts of ordinary elliptic curves in medium characteristic.
Des. Codes Cryptogr., December, 2025

Biextensions in pairing-based cryptography.
IACR Cryptol. ePrint Arch., 2025

Improving special cases of the computational isogeny problem.
IACR Cryptol. ePrint Arch., 2025

Models of Kummer lines and Galois representations.
IACR Cryptol. ePrint Arch., 2025

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

Radical 2-Isogenies and Cryptographic Hash Functions in Dimensions 1, 2 and 3.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

Improved Algorithms for Ascending Isogeny Volcanoes, and Applications.
Proceedings of the Progress in Cryptology - LATINCRYPT 2025, 2025

Halving Differential Additions on Kummer Lines.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

PEGASIS: Practical Effective Class Group Action using 4-Dimensional Isogenies.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
The module action for isogeny based cryptography.
IACR Cryptol. ePrint Arch., 2024

On the efficient representation of isogenies (a survey).
IACR Cryptol. ePrint Arch., 2024

Fast pairings via biextensions and cubical arithmetic.
IACR Cryptol. ePrint Arch., 2024

Some notes on algorithms for abelian varieties.
IACR Cryptol. ePrint Arch., 2024

Computing 2-isogenies between Kummer lines.
IACR Commun. Cryptol., 2024

On the Efficient Representation of Isogenies - A Survey for NuTMiC 2024.
Proceedings of the Number-Theoretic Methods in Cryptology - 4th International Conference, 2024

SQIsignHD: New Dimensions in Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

An Algorithmic Approach to (2, 2)-Isogenies in the Theta Model and Applications to Isogeny-Based Cryptography.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

SQIsign2D-West - The Fast, the Small, and the Safer.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
The geometric interpretation of the Tate pairing and its applications.
IACR Cryptol. ePrint Arch., 2023

Introducing Clapoti(s): Evaluating the isogeny class group action in polynomial time.
IACR Cryptol. ePrint Arch., 2023

An Algorithmic Approach to (2,2)-isogenies in the Theta Model and Applications to Isogeny-based Cryptography.
IACR Cryptol. ePrint Arch., 2023

Breaking SIDH in Polynomial Time.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Spanning the isogeny class of a power of an elliptic curve.
Math. Comput., 2022

Some applications of higher dimensional isogenies to elliptic curves (preliminary version).
IACR Cryptol. ePrint Arch., 2022

Evaluating isogenies in polylogarithmic time.
IACR Cryptol. ePrint Arch., 2022

2021
Computing the 2-Adic Canonical Lift of Genus 2 Curves.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

2016
Arithmetic on abelian and Kummer varieties.
Finite Fields Their Appl., 2016

2015
Computing (ℓ, ℓ)-isogenies in polynomial time on Jacobians of genus 2 curves.
Math. Comput., 2015

Computing separable isogenies in quasi-optimal time.
LMS J. Comput. Math., 2015

2013
A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties.
IACR Cryptol. ePrint Arch., 2013

2012
Improved CRT Algorithm for Class Polynomials in Genus 2.
IACR Cryptol. ePrint Arch., 2012

2010
Fonctions thêta et applications à la cryptographie. (Theta functions and cryptographic applications).
PhD thesis, 2010

Efficient Pairing Computation with Theta Functions.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009
Computing modular correspondences for abelian varieties
CoRR, 2009


  Loading...