EDBT 2026 Demo / reviewers in the wild / expert

Nikolay Kolomeec

dblp:67/11151 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
2since 2021 · last 2026
0000-0003-4367-3507ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
boolean functions		 1.012026
On the Maiorana-McFarland Class Extensions · IEEE Trans. Inf. Theory 2026
Cryptographic primitives and cryptanalysis › boolean functions › bent functions
maiorana-mcfarland class		 1.012026
On the Maiorana-McFarland Class Extensions · IEEE Trans. Inf. Theory 2026
Coding theory › boolean functions
bent functions		 1.012026
On the Maiorana-McFarland Class Extensions · IEEE Trans. Inf. Theory 2026

Methods — techniques the papers use, named apart from their topics

algebraic construction · 2.0
YearPublicationVenuePosition
2026 On the Maiorana-McFarland Class Extensions
Nikolay Kolomeec, Denis Bykov
 IEEE Trans. Inf. Theory1
2024 On the image of an affine subspace under the inverse function within a finite field
Nikolay Kolomeec, Denis Bykov
 Des. Codes Cryptogr.1
2017 The graph of minimal distances of bent functions and its properties
Nikolay Kolomeec
 Des. Codes Cryptogr.1
2011 Constructions of bent functions on the minimal distance from the quadratic bent function
abstract
In this paper we study how to construct new bent functions by slight modifications of the initial one. The answer to this question is directly connected to the studying of bent functions on the minimal Hamming distance from the given bent function. Here we constructively describe all bent functions on the minimal distance from the quadratic bent function and calculate their exact number. We get a lower bound for the number of bent functions on the minimal distance from a bent function of Maiorana-McFarland type. We present several facts and hypotheses on the maximal number of bent functions that can be obtained in this way.
Nikolay Kolomeec
 ISIT1