Razvan Barbulescu

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 17

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

Math. Comput.

Public Key Cryptography

University of Lorraine, Nancy, France (PHD)

Education History

University of Lorraine, Nancy, France

PHD

Publications

Razvan Barbulescu, Adrien Poulalion
The Special Case of Cyclotomic Fields in Quantum Algorithms for Unit Groups. AFRICACRYPT (2023)
Razvan Barbulescu, Adrien Poulalion
The special case of cyclotomic fields in quantum algorithms for unit groups. CoRR (2023)
Razvan Barbulescu, Adrien Poulalion
The special case of cyclotomic fields in quantum algorithms for unit groups. IACR Cryptol. ePrint Arch. 2023 (2023)
Razvan Barbulescu, Sudarshan Shinde
A classification of ECM-friendly families of elliptic curves using modular curves. Math. Comput. 91 (335) (2022)
Razvan Barbulescu, Florent Jouve
ECm And The Elliott-Halberstam Conjecture For Quadratic Fields. CoRR (2022)
Razvan Barbulescu, Sylvain Duquesne
Updating Key Size Estimations for Pairings. J. Cryptol. 32 (4) (2019)
Razvan Barbulescu, Nadia El Mrabet, Loubna Ghammam
A taxonomy of pairings, their security, their complexity. IACR Cryptol. ePrint Arch. 2019 (2019)
Razvan Barbulescu, Sylvain Duquesne
Updating key size estimations for pairings. IACR Cryptol. ePrint Arch. 2017 (2017)
Razvan Barbulescu, Armand Lachand
Some mathematical remarks on the polynomial selection in NFS. Math. Comput. 86 (303) (2017)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. 2016 (2016)
Taechan Kim, Razvan Barbulescu
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case. CRYPTO (1) (2016)
Razvan Barbulescu
A Brief History of Pairings. WAIFI (2016)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
The Tower Number Field Sieve. IACR Cryptol. ePrint Arch. 2015 (2015)
Razvan Barbulescu
Selecting polynomials for the Function Field Sieve. Math. Comput. 84 (296) (2015)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) (2015)
Razvan Barbulescu
An appendix for a recent paper of Kim. IACR Cryptol. ePrint Arch. 2015 (2015)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
The Tower Number Field Sieve. ASIACRYPT (2) (2015)
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography (2014)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improvements to the number field sieve for non-prime finite fields. CoRR (2014)
Razvan Barbulescu, Cécile Pierrot
The multiple number field sieve for medium- and high-characteristic finite fields. LMS J. Comput. Math. 17 (Theory) (2014)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. EUROCRYPT (2014)
Razvan Barbulescu, Armand Lachand
Some mathematical remarks on the polynomial selection in NFS. CoRR (2014)
Razvan Barbulescu, Cécile Pierrot
The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields. IACR Cryptol. ePrint Arch. 2014 (2014)
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
) with FFS. IACR Cryptol. ePrint Arch. 2013 (2013)
Razvan Barbulescu
Selecting polynomials for the Function Field Sieve. IACR Cryptol. ePrint Arch. 2013 (2013)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR Cryptol. ePrint Arch. 2013 (2013)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. CoRR (2013)
Razvan Barbulescu
Selecting polynomials for the Function Field Sieve CoRR (2013)
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
Finding ECM-Friendly Curves through a Study of Galois Properties CoRR (2012)
Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann
Finding Optimal Formulae for Bilinear Maps. IACR Cryptol. ePrint Arch. 2012 (2012)
Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann
Finding Optimal Formulae for Bilinear Maps. WAIFI (2012)
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery
Finding ECM-Friendly Curves through a Study of Galois Properties. IACR Cryptol. ePrint Arch. 2012 (2012)

Razvan Barbulescu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Razvan Barbulescu