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.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Florent Chabaud

dblp:42/5034 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

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

Security and privacy · 2 · 2 first-authorTheory of computation · 1

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
3 papers
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key cryptanalysis
code-based cryptanalysis		 0.011998
A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511 · IEEE Trans. Inf. Theory 1998
Cryptographic primitives and cryptanalysis
hash function cryptanalysis		 0.011998
Differential Collisions in SHA-0 · CRYPTO 1998
Cryptographic primitives and cryptanalysis › post-quantum cryptography › code-based cryptography
mceliece cryptosystem		 0.011998
A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511 · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › block codes
linear code		 0.011998
A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511 · IEEE Trans. Inf. Theory 1998
Cryptographic primitives and cryptanalysis › post-quantum cryptography
code-based cryptography		 0.011996
The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes · ASIACRYPT 1996
Cryptographic primitives and cryptanalysis
hash functions		 0.011998
Differential Collisions in SHA-0 · CRYPTO 1998
Coding theory › error-correcting codes › cyclic codes
BCH codes		 0.011998
A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511 · IEEE Trans. Inf. Theory 1998

Methods — techniques the papers use, named apart from their topics

minimum-weight word search · 0.0differential cryptanalysis · 0.0
YearPublicationVenuePosition
1998 Differential Collisions in SHA-0
Florent Chabaud, Antoine Joux
 CRYPTO1
1998 A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece's Cryptosystem and to Narrow-Sense BCH Codes of Length 511
abstract
An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some weaknesses in McEliece's (1978) cipher. We also determine with it the minimum distance of some BCH codes of length 511.
Anne Canteaut, Florent Chabaud
 IEEE Trans. Inf. Theory2
1996 The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes
Florent Chabaud, Jacques Stern
 ASIACRYPT1