Pierrick Dartois

dblp:310/7251 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
6since 2021 · last 2026
0009-0008-2808-9867ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 4 first-author · 6 since 2021
YearPublicationVenuePosition
2026 sfqt-sfPegasis: Simpler and Faster Effective Class Group Actions
Pierrick Dartois, Jonathan Komada Eriksen, Riccardo Invernizzi, Frederik Vercauteren
EUROCRYPT (4)1
2025 PEGASIS: Practical Effective Class Group Action using 4-Dimensional Isogenies
Pierrick Dartois, Jonathan Komada Eriksen, Tako Boris Fouotsa, Arthur Herlédan Le Merdy, Riccardo Invernizzi, Damien Robert 0001, Ryan Rueger, Frederik Vercauteren, Benjamin Wesolowski
CRYPTO (1)1
2024 SQIsign2D-West - The Fast, the Small, and the Safer
Andrea Basso 0002, Pierrick Dartois, Luca De Feo, Antonin Leroux, Luciano Maino, Giacomo Pope, Damien Robert 0001, Benjamin Wesolowski
ASIACRYPT (3)2
2024 An Algorithmic Approach to (2, 2)-Isogenies in the Theta Model and Applications to Isogeny-Based Cryptography
Pierrick Dartois, Luciano Maino, Giacomo Pope, Damien Robert 0001
ASIACRYPT (3)1
2024 SQIsignHD: New Dimensions in Cryptography
Pierrick Dartois, Antonin Leroux, Damien Robert 0001, Benjamin Wesolowski
EUROCRYPT (1)1
2024 Finding orientations of supersingular elliptic curves and quaternion orders
abstract
Abstract An oriented supersingular elliptic curve is a curve which is enhanced with the information of an endomorphism. Computing the full endomorphism ring of a supersingular elliptic curve is a known hard problem, so one might consider how hard it is to find one such orientation. We prove that access to an oracle which tells if an elliptic curve is $$\mathfrak {O}$$ O -orientable for a fixed imaginary quadratic order $$\mathfrak {O}$$ O provides non-trivial information towards computing an endomorphism corresponding to the $$\mathfrak {O}$$ O -orientation. We provide explicit algorithms and in-depth complexity analysis. We also consider the question in terms of quaternion algebras. We provide algorithms which compute an embedding of a fixed imaginary quadratic order into a maximal order of the quaternion algebra ramified at p and $$\infty $$ ∞ . We provide code implementations in Sagemath (in Stein et al. Sage Mathematics Software (Version 10.0), The Sage Development Team, http://www.sagemath.org , 2023) which is efficient for finding embeddings of imaginary quadratic orders of discriminants up to O(p), even for cryptographically sized p.
Sarah Arpin, James Clements, Pierrick Dartois, Jonathan Komada Eriksen, Péter Kutas, Benjamin Wesolowski
Des. Codes Cryptogr.3