Damien Robert

Orcid: 0000-0003-4378-4274

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


According to our database1, Damien Robert authored at least 20 papers between 2009 and 2024.

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

2024
Computing 2-isogenies between Kummer lines.
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

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

SQISignHD: New Dimensions in Cryptography.
IACR Cryptol. ePrint Arch., 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

Breaking SIDH in polynomial 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...