Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael Willett
dblp:16/948
· DBLP profile ↗
10ranked-venue papers
7as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 7 · 4 first-authorTheory of computation · 3 · 3 first-authorDatabases, 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
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.0 | 1 | 1980 | Deliberate noise in a modern cryptographic system (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA cryptosystem |
0.0 | 1 | 1980 | Deliberate noise in a modern cryptographic system (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory › error-correcting codes
cyclic codes |
0.0 | 1 | 1975 | Cycle representatives for minimal cyclic codes (Corresp.) · IEEE Trans. Inf. Theory 1975 |
Coding theory › finite fields
irreducible polynomials |
0.0 | 1 | 1975 | Cycle representatives for minimal cyclic codes (Corresp.) · IEEE Trans. Inf. Theory 1975 |
Coding theory › error-correcting codes › block codes › linear code › polynomial codes
parity-check polynomial |
0.0 | 1 | 1975 | Cycle representatives for minimal cyclic codes (Corresp.) · IEEE Trans. Inf. Theory 1975 |
Methods — techniques the papers use, named apart from their topics
cycle set algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Cryptographic Information Recovery Using Key Recover
Michael Smith 0022, Paul C. van Oorschot, Michael Willett |
Comput. Secur. | 3 |
| 2000 | Features, Attributes, Characteristics, and Traits (FACTs) of Key Recovery Schemes/Products
Michael Willett |
Comput. Secur. | 1 |
| 2000 | Key Recovery Alliance (KRA) Technology Papers, Special Issue Introduction
Chuck Williams, Nevenko Zunic, Stephen M. Matyas, Sarbari Gupta, Michael Willett |
Comput. Secur. | 5 |
| 1997 | Two-phase cryptographic key recovery system
Rosario Gennaro, Paul A. Karger, Stephen M. Matyas, Mohammad Peyravian, Allen Roginsky, David Safford, Michael Willett, Nevenko Zunic |
Comput. Secur. | 7 |
| 1983 | Trapdoor Knapsacks Without Superincreasing Structure
Michael Willett |
Inf. Process. Lett. | 1 |
| 1982 | A tutorial on public key cryptography
Michael Willett |
Comput. Secur. | 1 |
| 1982 | Cryptography old and new
Michael Willett |
Comput. Secur. | 1 |
| 1982 | Guest editorial
Michael Willett |
Comput. Secur. | 1 |
| 1980 | Deliberate noise in a modern cryptographic system (Corresp.)abstractMethods for incorporating deliberate noise into classical or public key cryptosystems are discussed. Michael Willett |
IEEE Trans. Inf. Theory | 1 |
| 1975 | Cycle representatives for minimal cyclic codes (Corresp.)abstractAn algorithm is presented for the calculation of a cycle set for any cyclic code which has an irreducible parity-check polynomial. Michael Willett |
IEEE Trans. Inf. Theory | 1 |