default search action
Razvan Barbulescu
Person information
- affiliation: University of Lorraine, Nancy, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i20]Razvan Barbulescu, Mugurel Barcau, Vicentiu Pasol:
A comprehensive analysis of Regev's quantum algorithm. IACR Cryptol. ePrint Arch. 2024: 1758 (2024) - 2023
- [c8]Razvan Barbulescu, Adrien Poulalion:
The Special Case of Cyclotomic Fields in Quantum Algorithms for Unit Groups. AFRICACRYPT 2023: 229-251 - [i19]Razvan Barbulescu, Adrien Poulalion:
The special case of cyclotomic fields in quantum algorithms for unit groups. CoRR abs/2303.03978 (2023) - [i18]Razvan Barbulescu, Adrien Poulalion:
The special case of cyclotomic fields in quantum algorithms for unit groups. IACR Cryptol. ePrint Arch. 2023: 317 (2023) - 2022
- [j5]Razvan Barbulescu, Sudarshan Shinde:
A classification of ECM-friendly families of elliptic curves using modular curves. Math. Comput. 91(335): 1405-1436 (2022) - [i17]Razvan Barbulescu, Florent Jouve
:
ECm And The Elliott-Halberstam Conjecture For Quadratic Fields. CoRR abs/2212.11724 (2022)
2010 – 2019
- 2019
- [j4]Razvan Barbulescu, Sylvain Duquesne:
Updating Key Size Estimations for Pairings. J. Cryptol. 32(4): 1298-1336 (2019) - [i16]Razvan Barbulescu, Nadia El Mrabet, Loubna Ghammam:
A taxonomy of pairings, their security, their complexity. IACR Cryptol. ePrint Arch. 2019: 485 (2019) - 2017
- [j3]Razvan Barbulescu, Armand Lachand:
Some mathematical remarks on the polynomial selection in NFS. Math. Comput. 86(303): 397-418 (2017) - [i15]Razvan Barbulescu, Sylvain Duquesne:
Updating key size estimations for pairings. IACR Cryptol. ePrint Arch. 2017: 334 (2017) - 2016
- [c7]Taechan Kim
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case. CRYPTO (1) 2016: 543-571 - [c6]Razvan Barbulescu:
A Brief History of Pairings. WAIFI 2016: 3-17 - [i14]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: 605 (2016) - 2015
- [j2]Razvan Barbulescu:
Selecting polynomials for the Function Field Sieve. Math. Comput. 84(296): 2987-3012 (2015) - [c5]Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung:
The Tower Number Field Sieve. ASIACRYPT (2) 2015: 31-55 - [c4]Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) 2015: 129-155 - [i13]Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung:
The Tower Number Field Sieve. IACR Cryptol. ePrint Arch. 2015: 505 (2015) - [i12]Razvan Barbulescu:
An appendix for a recent paper of Kim. IACR Cryptol. ePrint Arch. 2015: 1076 (2015) - 2014
- [j1]Razvan Barbulescu, Cécile Pierrot:
The multiple number field sieve for medium- and high-characteristic finite fields. LMS J. Comput. Math. 17(Theory): 230-246 (2014) - [c3]Razvan Barbulescu, Pierrick Gaudry, Antoine Joux
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. EUROCRYPT 2014: 1-16 - [c2]Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé
Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography 2014: 221-238 - [i11]Razvan Barbulescu, Armand Lachand:
Some mathematical remarks on the polynomial selection in NFS. CoRR abs/1403.0184 (2014) - [i10]Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain:
Improvements to the number field sieve for non-prime finite fields. CoRR abs/1408.0718 (2014) - [i9]Razvan Barbulescu, Cécile Pierrot:
The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields. IACR Cryptol. ePrint Arch. 2014: 147 (2014) - 2013
- [b1]Razvan Barbulescu:
Algorithms of discrete logarithm in finite fields. (Algorithmes de logarithmes discrets dans les corps finis). University of Lorraine, Nancy, France, 2013 - [i8]Razvan Barbulescu:
Selecting polynomials for the Function Field Sieve. CoRR abs/1303.1998 (2013) - [i7]Razvan Barbulescu, Pierrick Gaudry, Antoine Joux
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. CoRR abs/1306.4244 (2013) - [i6]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. IACR Cryptol. ePrint Arch. 2013: 197 (2013) - [i5]Razvan Barbulescu:
Selecting polynomials for the Function Field Sieve. IACR Cryptol. ePrint Arch. 2013: 200 (2013) - [i4]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: 400 (2013) - 2012
- [c1]Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann
Finding Optimal Formulae for Bilinear Maps. WAIFI 2012: 168-186 - [i3]Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, Peter L. Montgomery:
Finding ECM-Friendly Curves through a Study of Galois Properties. CoRR abs/1202.4285 (2012) - [i2]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: 70 (2012) - [i1]Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann:
Finding Optimal Formulae for Bilinear Maps. IACR Cryptol. ePrint Arch. 2012: 110 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: