Razvan Barbulescu

MaRDI QIDQ2010588zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Extending Regev's quantum algorithm to elliptic curves	2026-02-19	Paper
ECM and the Elliott-Halberstam conjecture for quadratic fields Acta Arithmetica	2024-07-30	Paper
The special case of cyclotomic fields in quantum algorithms for unit groups Progress in Cryptology - AFRICACRYPT 2023	2024-02-02	Paper
ECM And The Elliott-Halberstam Conjecture For Quadratic Fields	2022-12-22	Paper
A classification of ECM-friendly families of elliptic curves using modular curves Mathematics of Computation	2022-04-13	Paper
Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's \(p\)-rationality conjecture Journal de Théorie des Nombres de Bordeaux	2020-09-14	Paper
Updating key size estimations for pairings Journal of Cryptology	2019-11-27	Paper
A brief history of pairings Arithmetic of Finite Fields	2017-06-13	Paper
Extended tower number field sieve: a new complexity for the medium prime case Advances in Cryptology – CRYPTO 2016	2016-11-30	Paper
Some mathematical remarks on the polynomial selection in NFS Mathematics of Computation	2016-10-18	Paper
The tower number field sieve Advances in Cryptology – ASIACRYPT 2015	2016-03-23	Paper
Finding ECM-friendly curves through a study of Galois properties (available as arXiv preprint)	2015-10-01	Paper
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields Advances in Cryptology -- EUROCRYPT 2015	2015-09-30	Paper
Selecting polynomials for the function field sieve Mathematics of Computation	2015-08-13	Paper
The multiple number field sieve for medium- and high-characteristic finite fields LMS Journal of Computation and Mathematics	2014-09-05	Paper
Improvements to the number field sieve for non-prime finite fields	2014-08-04	Paper
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Advances in Cryptology – EUROCRYPT 2014	2014-05-27	Paper
Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS Public-Key Cryptography – PKC 2014	2014-03-25	Paper
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic	2013-06-18	Paper
Finding optimal formulae for bilinear maps Arithmetic of Finite Fields	2012-11-01	Paper

Research outcomes over time

This page was built for person: Razvan Barbulescu