Demo Data from EDBT 2026 / reviewers in the wild / expert
Othmar Staffelbach
dblp:65/3218
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 1 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
4 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
stream cipher |
0.0 | 2 | 1992 | Correlation Properties of Combiners with Memory in Stream Ciphers · J. Cryptol. 1992 Fast Correlation Attacks on Certain Stream Ciphers · J. Cryptol. 1989 |
Cryptographic primitives and cryptanalysis › stream cipher
combiners with memory |
0.0 | 1 | 1992 | Correlation Properties of Combiners with Memory in Stream Ciphers · J. Cryptol. 1992 |
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography |
0.0 | 1 | 1992 | Efficient Multiplication on Certain Nonsupersingular Elliptic Curves · CRYPTO 1992 |
Cryptographic primitives and cryptanalysis
symmetric cryptography |
0.0 | 1 | 1990 | Cryptographic Significance of the Carry for Ciphers Based on Integer Addition · CRYPTO 1990 |
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
correlation attack |
0.0 | 1 | 1989 | Fast Correlation Attacks on Certain Stream Ciphers · J. Cryptol. 1989 |
Coding theory › sequences
linear complexity |
0.0 | 1 | 1987 | Products of linear recurring sequences with maximum complexity · IEEE Trans. Inf. Theory 1987 |
Coding theory › sequences
linear recurrence sequences |
0.0 | 1 | 1987 | Products of linear recurring sequences with maximum complexity · IEEE Trans. Inf. Theory 1987 |
Coding theory
finite fields |
0.0 | 1 | 1987 | Products of linear recurring sequences with maximum complexity · IEEE Trans. Inf. Theory 1987 |
Coding theory › sequences › linear complexity
minimal polynomials |
0.0 | 1 | 1987 | Products of linear recurring sequences with maximum complexity · IEEE Trans. Inf. Theory 1987 |
Methods — techniques the papers use, named apart from their topics
finite field arithmetic · 0.0differential cryptanalysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
Willi Meier, Othmar Staffelbach |
CRYPTO | 2 |
| 1992 | Correlation Properties of Combiners with Memory in Stream Ciphers
Willi Meier, Othmar Staffelbach |
J. Cryptol. | 2 |
| 1990 | Cryptographic Significance of the Carry for Ciphers Based on Integer Addition
Othmar Staffelbach, Willi Meier |
CRYPTO | 1 |
| 1989 | Fast Correlation Attacks on Certain Stream Ciphers
Willi Meier, Othmar Staffelbach |
J. Cryptol. | 2 |
| 1987 | Products of linear recurring sequences with maximum complexityabstractConditions are derived which guarantee that products of linear recurring sequences attain maximum linear complexity. It is shown that the product of any number of maximum-length GF(q)sequences has maximum linear complexity, provided only the degrees of the corresponding minimal polynomials are distinct and greater than two. It is also shown that if the roots of any number of (not necessarily irreducible) minimal polynomials are simple and lie in extension fields of pairwise relatively prime degrees, then the product of the corresponding GF(q)sequences attains maximum linear complexity, provided only that no two roots of any minimal polynomial are linearly dependent over the groundfield GF(q)(which is automatically satisfied whenq = 2). The results obtained for products are extended to arbitrary linear combinations of product sequences. Rainer A. Rueppel, Othmar Staffelbach |
IEEE Trans. Inf. Theory | 2 |