Razvan Barbulescu

According to our database, Razvan Barbulescu authored at least 23 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A comprehensive analysis of Regev's quantum algorithm.

Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol

IACR Cryptol. ePrint Arch., 2024

Regev's attack on hyperelliptic cryptosystems.

Razvan Barbulescu, Gaetan Bisson

IACR Cryptol. ePrint Arch., 2024

2023

The special case of cyclotomic fields in quantum algorithms for unit groups.

Razvan Barbulescu, Adrien Poulalion

IACR Cryptol. ePrint Arch., 2023

2022

A classification of ECM-friendly families of elliptic curves using modular curves.

Razvan Barbulescu, Sudarshan Shinde

Math. Comput., 2022

ECm And The Elliott-Halberstam Conjecture For Quadratic Fields.

Razvan Barbulescu, Florent Jouve

CoRR, 2022

2019

Updating Key Size Estimations for Pairings.

Razvan Barbulescu, Sylvain Duquesne

J. Cryptol., 2019

A taxonomy of pairings, their security, their complexity.

Razvan Barbulescu, Nadia El Mrabet, Loubna Ghammam

IACR Cryptol. ePrint Arch., 2019

2017

Some mathematical remarks on the polynomial selection in NFS.

Razvan Barbulescu, Armand Lachand

Math. Comput., 2017

2016

Improving NFS for the discrete logarithm problem in non-prime finite fields.

Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain

IACR Cryptol. ePrint Arch., 2016

A Brief History of Pairings.

Razvan Barbulescu

Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case.

Taechan Kim, Razvan Barbulescu

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Selecting polynomials for the Function Field Sieve.

Razvan Barbulescu

Math. Comput., 2015

The Tower Number Field Sieve.

Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung

IACR Cryptol. ePrint Arch., 2015

An appendix for a recent paper of Kim.

Razvan Barbulescu

IACR Cryptol. ePrint Arch., 2015

2014

The multiple number field sieve for medium- and high-characteristic finite fields.

Razvan Barbulescu, Cécile Pierrot

LMS J. Comput. Math., 2014

Improvements to the number field sieve for non-prime finite fields.

Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain

CoRR, 2014

Discrete Logarithm in GF(2809) with FFS.

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013

Algorithms of discrete logarithm in finite fields. (Algorithmes de logarithmes discrets dans les corps finis).

Razvan Barbulescu

PhD thesis, 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2013

Discrete logarithm in GF(2⁸⁰⁹) with FFS.

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2013

2012

Finding Optimal Formulae for Bilinear Maps.

Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2012

Finding ECM-Friendly Curves through a Study of Galois Properties.

Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery

IACR Cryptol. ePrint Arch., 2012