Sylvain Duquesne

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

EDBT 2026 Demo / reviewers in the wild / expert

dblp:55/6353 · DBLP profile ↗

← Back

8ranked-venue papers

4as first author

1since 2021 · last 2022

0000-0002-3854-8253ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 1 first-authorTheory of computation · 4 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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 2 papers		Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems 1 paper		Reconfigurable computing and FPGAs · 50% Integrated circuit design · 50%

Topics — the 3 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis pairing-based cryptography	0.5	2	2019	Updating Key Size Estimations for Pairings · J. Cryptol. 2019 FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction · CHES 2011
Reconfigurable computing and FPGAs FPGA implementation	0.0	1	2011	FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction · CHES 2011
Integrated circuit design residue number system arithmetic	0.0	1	2011	FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction · CHES 2011

Year	Publication	Venue	Position
2022	Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography Sylvain Duquesne	WAIFI	1
2020	Curves with Fast Computations in the First Pairing Group Remi Clarisse, Sylvain Duquesne, Olivier Sanders	CANS	2
2019	Updating Key Size Estimations for Pairings Razvan Barbulescu, Sylvain Duquesne	J. Cryptol.	2
2018	Side-Channel Attack using Order 4 Element against Curve25519 on ATmega328P abstract With the matter of secure communication between devices, and especially for IoT devices, more and more applications need trustful protocols to communicate using public key cryptography. Elliptic curve cryptography is nowadays a very secure and efficient public key cryptography method. One of the most recent and secure curve is Curve25519 and one of its failure is attack on low-order elements during a Diffie-Hellman key exchange. This document demonstrates that an attack using an order 4 point is possible on an embedded system with a simple power analysis, pointing out every IoT using Curve255119 as a cryptographic method, a potential target to side-channel attacks. Yoshinori Uetake, Akihiro Sanada, Takuya Kusaka, Yasuyuki Nogami, Leo Weissbart, Sylvain Duquesne	ISITA	6
2012	Tate Pairing Computation on Jacobi's Elliptic Curves Sylvain Duquesne, Emmanuel Fouotsa	Pairing	1
2011	FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction Ray C. C. Cheung, Sylvain Duquesne, Junfeng Fan, Nicolas Guillermin, Ingrid Verbauwhede, Gavin Xiaoxu Yao	CHES	2
2008	Montgomery Ladder for All Genus 2 Curves in Characteristic 2 Sylvain Duquesne	WAIFI	1
2007	Improving the arithmetic of elliptic curves in the Jacobi model Sylvain Duquesne	Inf. Process. Lett.	1