Demo Data from EDBT 2026 / reviewers in the wild / expert
Bert den Boer
dblp:91/1603
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 4 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
3 papers |
Hardware security and side channels · 58% Cryptographic primitives and cryptanalysis · 42% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels › side-channel attack › power analysis
differential power analysis |
0.0 | 1 | 2002 | A DPA Attack against the Modular Reduction within a CRT Implementation of RSA · CHES 2002 |
Hardware security and side channels
side-channel cryptanalysis |
0.0 | 1 | 2002 | A DPA Attack against the Modular Reduction within a CRT Implementation of RSA · CHES 2002 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.0 | 1 | 2002 | A DPA Attack against the Modular Reduction within a CRT Implementation of RSA · CHES 2002 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA |
0.0 | 1 | 2002 | A DPA Attack against the Modular Reduction within a CRT Implementation of RSA · CHES 2002 |
Cryptographic primitives and cryptanalysis
hash function cryptanalysis |
0.0 | 1 | 1991 | An Attack on the Last Two Rounds of MD4 · CRYPTO 1991 |
Cryptographic primitives and cryptanalysis › hash functions › dedicated hash functions
MD4 |
0.0 | 1 | 1991 | An Attack on the Last Two Rounds of MD4 · CRYPTO 1991 |
Cryptographic primitives and cryptanalysis
cryptographic assumptions |
0.0 | 1 | 1988 | Diffie-Hellman is as Strong as Discrete Log for Certain Primes · CRYPTO 1988 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions
diffie-hellman assumption |
0.0 | 1 | 1988 | Diffie-Hellman is as Strong as Discrete Log for Certain Primes · CRYPTO 1988 |
Cryptographic primitives and cryptanalysis
discrete logarithm problem |
0.0 | 1 | 1988 | Diffie-Hellman is as Strong as Discrete Log for Certain Primes · CRYPTO 1988 |
Methods — techniques the papers use, named apart from their topics
differential cryptanalysis · 0.0primality · 0.0number theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | A DPA Attack against the Modular Reduction within a CRT Implementation of RSA
Bert den Boer, Kerstin Lemke-Rust, Guntram Wicke |
CHES | 1 |
| 1993 | A Simple and Key-Economical Unconditional Authentication Scheme
Bert den Boer |
J. Comput. Secur. | 1 |
| 1991 | An Attack on the Last Two Rounds of MD4
Bert den Boer, Antoon Bosselaers |
CRYPTO | 1 |
| 1988 | Diffie-Hellman is as Strong as Discrete Log for Certain Primes
Bert den Boer |
CRYPTO | 1 |