Razvan Barbulescu

Dr. Razvan Barbulescu

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 November 2021 in Mathematics of Computation
Verified
Journal Article
Closed access
PDF file
RBRazvan Barbulescu
Razvan Barbulescu
SSSudarshan Shinde
Sudarshan Shinde
In this work, we establish a link between the classification of ECM-friendly elliptic curves and Mazur’s program B, which consists in parameterizing all the families of elliptic curves with exceptional Galois image. Motivated by Barbulescu et al. [ANTS X–proceedings of the tenth algorithmic number theory symposium, Berkeley, CA, 2013], we say an elliptic curve is ECM-friendly if it does not have complex multiplication and if its Galois image is exceptional for some level. Building upon two recent works which treated the case of congruence subgroups of prime-power level which occur for infinitely many j j -invariants, we prove that there are exactly 1525 families of rational elliptic curves with distinct Galois images which are cartesian products of subgroups of prime-power level. This makes a complete list of rational families of ECM-friendly elliptic curves with cartesian Galois images, out of which less than 23 were known in the literature. We furthermore refine a heuristic of Montgomery to compare these families and conclude that the best 4 families which can be put in a = − 1 a=-1 twisted Edwards’ form are new.


2 October 2025
Verified
Book Chapter
Closed access
PDF file
RBRazvan Barbulescu
Razvan Barbulescu
MBMugurel Barcau
Mugurel Barcau
VPVicenţiu Paşol
Vicenţiu Paşol

19 December 2019 in arXiv
Verified
Preprint
Open access
PDF file
RBRazvan Barbulescu
Razvan Barbulescu
JRJishnu Ray
Jishnu Ray
In this paper we make a series of numerical experiments to support Greenberg's $p$-rationality conjecture, we present a family of $p$-rational biquadratic fields and we find new examples of $p$-rational multiquadratic fields. In the case of multiquadratic and multicubic fields we show that the conjecture is a consequence of the Cohen-Lenstra-Martinet heuristic and of the conjecture of Hofmann and Zhang on the $p$-adic regulator, and we bring new numerical data to support the extensions of these conjectures. We compare the known algorithmic tools and propose some improvements.

28 August 2026 in Cryptography
Verified
Journal Article
Open access
PDF file
RBRazvan Barbulescu
Razvan Barbulescu
GBGaetan Bisson
Gaetan Bisson
An algorithm of Ekerå and Gärtner, inspired by Regev’s factoring algorithm, computes discrete logarithms in multiplicative groups of prime fields. Asymptotically, it has the same qubit and gate complexity as Shor’s algorithm but splits the computation into d independent, parallel runs. The optimal value of this parameter is d∼n where n is the bit size of the cryptographic group. We propose an extension of this algorithm to hyperelliptic curves. For curves of genus g∼n, which are not used in cryptography, we prove unconditionally that the optimal number of parallel runs d∼n can still be achieved. For genus-two curves, we propose a heuristic algorithm. While its runtime speedup is difficult to quantify in general, we show that it can be expected to use up to d=8 parallel runs for specific curves relevant to cryptography, including GLV-friendly and pairing-friendly curves.

31 August 2020
Verified
Preprint
Open access
PDF file
RBRazvan Barbulescu
Razvan Barbulescu
NMNadia Mrabet
Nadia Mrabet
LGLoubna Ghammam
Loubna Ghammam
NMNadia El Mrabet
Nadia El Mrabet
L'article a été soumis à "Journal of Mathematical Cryptology" https://journals.flvc.org/mathcryptology/ en aoũt 2019. Nous n'avons pas reçu de réponse car les éditeurs ont démissionné. En mai 2020 Guillevic a publié une attacque qui nous a obligé de refaire tous les calculs. En septembre 2020 nous avons soumis la nouvelle version sur Eprint et à "Journal of Cryptology" pour lequel le processus d'évaluation est en cours.