EDBT 2026 Demo / reviewers in the wild / expert
Razvan Barbulescu
dblp:93/10962
· DBLP profile ↗
7ranked-venue papers
6as first author
0since 2021 · last 2019
0000-0002-1900-6520ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 5 · 4 first-authorTheory of computation · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
5 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › integer factorization
number field sieve |
0.7 | 3 | 2016 | Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case · CRYPTO (1) 2016 Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields · EUROCRYPT (1) 2015 The Tower Number Field Sieve · ASIACRYPT (2) 2015 |
Cryptographic primitives and cryptanalysis
discrete logarithm problem |
0.4 | 2 | 2015 | Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields · EUROCRYPT (1) 2015 A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic · EUROCRYPT 2014 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.4 | 1 | 2019 | Updating Key Size Estimations for Pairings · J. Cryptol. 2019 |
Cryptographic primitives and cryptanalysis
tower number field sieve |
0.2 | 1 | 2016 | Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case · CRYPTO (1) 2016 |
Cryptographic primitives and cryptanalysis
integer factorization |
0.2 | 1 | 2015 | The Tower Number Field Sieve · ASIACRYPT (2) 2015 |
Algorithms and data structures
number-theoretic algorithms |
0.1 | 1 | 2016 | Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case · CRYPTO (1) 2016 |
Methods — techniques the papers use, named apart from their topics
medium prime case · 0.5extended tower number field sieve · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Updating Key Size Estimations for Pairings
Razvan Barbulescu, Sylvain Duquesne |
J. Cryptol. | 1 |
| 2016 | Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
Taechan Kim 0001, Razvan Barbulescu |
CRYPTO (1) | 2 |
| 2016 | A Brief History of Pairings
Razvan Barbulescu |
WAIFI | 1 |
| 2015 | The Tower Number Field Sieve
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung |
ASIACRYPT (2) | 1 |
| 2015 | Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain |
EUROCRYPT (1) | 1 |
| 2014 | A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé |
EUROCRYPT | 1 |
| 2012 | Finding Optimal Formulae for Bilinear Maps
Razvan Barbulescu, Jérémie Detrey, Nicolas Estibals, Paul Zimmermann 0001 |
WAIFI | 1 |