Demo Data from EDBT 2026 / reviewers in the wild / expert
Sankhadip Roy
dblp:118/8448
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0001-5887-9941ORCID · reported
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.
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
boolean functions |
0.2 | 1 | 2014 | Enumeration of Quadratic Functions With Prescribed Walsh Spectrum · IEEE Trans. Inf. Theory 2014 |
Coding theory › boolean functions
walsh spectrum |
0.2 | 1 | 2014 | Enumeration of Quadratic Functions With Prescribed Walsh Spectrum · IEEE Trans. Inf. Theory 2014 |
Cryptographic primitives and cryptanalysis › boolean functions
bent functions |
0.1 | 1 | 2014 | Enumeration of Quadratic Functions With Prescribed Walsh Spectrum · IEEE Trans. Inf. Theory 2014 |
Cryptographic primitives and cryptanalysis
boolean functions |
0.1 | 1 | 2014 | Enumeration of Quadratic Functions With Prescribed Walsh Spectrum · IEEE Trans. Inf. Theory 2014 |
Methods — techniques the papers use, named apart from their topics
generating functions · 0.4enumeration · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Enumeration of Quadratic Functions With Prescribed Walsh SpectrumabstractThe Walsh transform f̂ of a quadratic function f: F(pn) → Fpsatisfies |f̂| ∈ {0,pn+s/2} for an integer 0 ≤ s ≤ n-1, depending on f. In this paper, quadratic functions of the form Fp,n(x) = Trn(Σi=0kaixpi+1) are studied, with the restriction that ai∈ Fp, 0 ≤ i ≤ k. Three methods for enumeration of such functions are presented when the value for s is prescribed. This paper extends earlier enumeration results significantly, for instance, the generating function for the counting function is obtained, when n is odd and relatively prime to p, or when n = 2 m, for odd m and p = 2. The number of bent and semibent functions for various classes of n is also obtained. Wilfried Meidl, Sankhadip Roy, Alev Topuzoglu |
IEEE Trans. Inf. Theory | 2 |