Demo Data from EDBT 2026 / reviewers in the wild / expert
Takahiro Sakata
dblp:11/1924
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › stream cipher
k-error linear complexity |
0.0 | 1 | 2000 | A relationship between linear complexity and kapa-error linear complexity · IEEE Trans. Inf. Theory 2000 |
Cryptographic primitives and cryptanalysis
stream cipher |
0.0 | 1 | 2000 | A relationship between linear complexity and kapa-error linear complexity · IEEE Trans. Inf. Theory 2000 |
Methods — techniques the papers use, named apart from their topics
sequence analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | A relationship between linear complexity and kapa-error linear complexityabstractLinear complexity is an important cryptographic criterion of stream ciphers. The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This article shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity. Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto |
IEEE Trans. Inf. Theory | 3 |