Razvan Barbulescu

39 papers A* 1C 2Journal 29Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Logarithmic Density of Rank \geq 1 and Rank \geq 2 Genus-2 Jacobians and Applications to Hyperelliptic Curve Cryptography.
CoRR
Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol, George C. Turcas
2026 J jnl
Logarithmic density of rank $\geq1$ and $\geq2$ genus-2 Jacobians and applications to hyperelliptic curve cryptography.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol, George C. Turcas
2025 — conf
Extending Regev's Quantum Algorithm to Elliptic Curves.
LATINCRYPT
Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol
2025 J jnl
Models of Kummer lines and Galois representations.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Damien Robert, Nicolas Sarkis
2024 J jnl
A comprehensive analysis of Regev's quantum algorithm.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol
2024 J jnl
Regev's attack on hyperelliptic cryptosystems.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Gaetan Bisson
2023 — conf
The Special Case of Cyclotomic Fields in Quantum Algorithms for Unit Groups.
AFRICACRYPT
Razvan Barbulescu, Adrien Poulalion
2023 J jnl
The special case of cyclotomic fields in quantum algorithms for unit groups.
CoRR
Razvan Barbulescu, Adrien Poulalion
2023 J jnl
The special case of cyclotomic fields in quantum algorithms for unit groups.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Adrien Poulalion
2022 J jnl
A classification of ECM-friendly families of elliptic curves using modular curves.
Math. Comput.
Razvan Barbulescu, Sudarshan Shinde
2022 J jnl
ECm And The Elliott-Halberstam Conjecture For Quadratic Fields.
CoRR
Razvan Barbulescu, Florent Jouve
2019 J jnl
A taxonomy of pairings, their security, their complexity.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Nadia El Mrabet, Loubna Ghammam
2019 J jnl
Updating Key Size Estimations for Pairings.
J. Cryptol.
Razvan Barbulescu, Sylvain Duquesne
2017 J jnl
Some mathematical remarks on the polynomial selection in NFS.
Math. Comput.
Razvan Barbulescu, Armand Lachand
2017 J jnl
Updating key size estimations for pairings.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Sylvain Duquesne
2016 C conf
A Brief History of Pairings.
WAIFI
Razvan Barbulescu
2016 — conf
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case.
CRYPTO (1)
Taechan Kim, Razvan Barbulescu
2016 J jnl
Improving NFS for the discrete logarithm problem in non-prime finite fields.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2015 J jnl
An appendix for a recent paper of Kim.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu
2015 — conf
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields.
EUROCRYPT (1)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2015 J jnl
Selecting polynomials for the Function Field Sieve.
Math. Comput.
Razvan Barbulescu
2015 — conf
The Tower Number Field Sieve.
ASIACRYPT (2)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
2015 J jnl
The Tower Number Field Sieve.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
2014 A* conf
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.
EUROCRYPT
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2014 — conf
Discrete Logarithm in GF(2809) with FFS.
Public Key Cryptography
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
2014 J jnl
Improvements to the number field sieve for non-prime finite fields.
CoRR
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2014 J jnl
Some mathematical remarks on the polynomial selection in NFS.
CoRR
Razvan Barbulescu, Armand Lachand
2014 J jnl
The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Cécile Pierrot
2014 J jnl
The multiple number field sieve for medium- and high-characteristic finite fields.
LMS J. Comput. Math.
Razvan Barbulescu, Cécile Pierrot
2013 J jnl
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
CoRR
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2013 J jnl
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2013 — —
Algorithms of discrete logarithm in finite fields. (Algorithmes de logarithmes discrets dans les corps finis).
Razvan Barbulescu
2013 J jnl
Discrete logarithm in GF(2
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
2013 J jnl
Selecting polynomials for the Function Field Sieve
CoRR
Razvan Barbulescu
2013 J jnl
Selecting polynomials for the Function Field Sieve.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu
2012 J jnl
Finding ECM-Friendly Curves through a Study of Galois Properties
CoRR
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
2012 J jnl
Finding ECM-Friendly Curves through a Study of Galois Properties.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
2012 C conf
Finding Optimal Formulae for Bilinear Maps.
WAIFI
Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann
2012 J jnl
Finding Optimal Formulae for Bilinear Maps.
IACR Cryptol. ePrint Arch.
Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann