VLDB 2026 Research / reviewers in the wild / expert
Vladimir Edemskiy
dblp:02/10021
· DBLP profile ↗
13ranked-venue papers
11as first author
7since 2021 · last 2026
0000-0003-1368-3827ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 4 first-author · 2 since 2021Theory of computation · 5 · 5 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Notes about the linear complexity of quaternary cyclotomic sequences of order four
Vladimir Edemskiy, Zeyu Cao |
Inf. Process. Lett. | 1 |
| 2025 | Arithmetic Autocorrelation of Certain Binary Half-ℓ-Sequences
Lingmei Xiao, Vladimir Edemskiy |
Inscrypt (1) | 2 |
| 2023 | Symmetric 4-adic Complexity of Quaternary Sequences of Length pq with Low AutocorrelationabstractIn this paper, we consider quaternary sequences of length pq, where p and q are two different odd primes. These sequences are constructed based on Legendre symbol and have low autocorrelation and high linear complexity. We derive the symmetric 4-adic complexity of these sequences and show that it is good enough to resist the attack of the rational approximation algorithm. Vladimir Edemskiy, Sofia Koltsova |
ITW | 1 |
| 2023 | Arithmetic correlation of binary half- ℓ -sequencesabstractAbstract The arithmetic correlations of two binary half‐ ℓ ‐sequences with connection integer p r , which is an odd prime power, are investigated. Possible values (of the arithmetic correlation) are calculated. In particular, if p ≡ 1 (mod 8), the authors prove that they are zero for non‐trivial shifts, that is, the half‐ ℓ ‐sequences have ideal arithmetic correlations. If p ≡ −1 (mod 8), an upper bound, which is of order of magnitude p r −1/2 ln p , is derived by using earlier results on the imbalance of half‐ ℓ ‐sequences with connection integer p studied by Gu and Klapper and later improved by Wang and Tan. Zhixiong Chen 0002, Vladimir Edemskiy, Zhihua Niu, Yuqi Sang |
IET Inf. Secur. | 2 |
| 2022 | 4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pqabstractIn this paper, we consider two kinds of quaternary sequences, i.e., quaternary classical cyclotomic sequences with period q where q is an odd prime, and quaternary Ding-Helleseth generalized cyclotomic sequences with period pq where p is odd prime distinct from q. Then, using the generalized "Gauss periods", we derive 4-adic complexity of these sequences for any p,q and the results show that they have high symmetric 4-adic complexity. Vladimir Edemskiy, Chenhuang Wu |
ISIT | 1 |
| 2022 | The linear complexity of sequences with low autocorrelation from interleaved technique and period pqabstractIn this paper, we consider the quaternary sequences with period pq where p and q are two odd primes. These sequences are constructed by interleaving the quaternary power residue sequence of period p according to the quadratic residue with respect to q. We derive the linear complexity of these sequences over the finite field of order four and the finite ring of order four. It is shown that the considered quaternary sequences have a sufficiently large linear complexity to resist Berlekamp-Massey algorithm or Reeds and Sloane algorithm attack effectively. Vladimir Edemskiy, Sergey Garbar |
ITW | 1 |
| 2022 | Linear Complexity of Generalized Cyclotomic Sequences with Period pnqm
Vladimir Edemskiy, Chenhuang Wu |
WAIFI | 1 |
| 2020 | Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq
Vladimir Edemskiy, Chenhuang Wu |
Inscrypt | 1 |
| 2019 | Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period 2pn
Vladimir Edemskiy, Nikita Sokolovskii |
Inscrypt | 1 |
| 2019 | The linear complexity of generalized cyclotomic binary sequences of period pn
Vladimir Edemskiy, Chunlei Li 0001, Xiangyong Zeng, Tor Helleseth |
Des. Codes Cryptogr. | 1 |
| 2016 | The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
Vladimir Edemskiy, A. Palvinskiy |
Inf. Process. Lett. | 1 |
| 2013 | Autocorrelation and linear complexity of quaternary sequences of period 2p based on cyclotomic classes of order fourabstractWe examine the linear complexity and the autocorrelation of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four. Vladimir Edemskiy, Andrew Ivanov |
ISIT | 1 |
| 2011 | About computation of the linear complexity of generalized cyclotomic sequences with period pn+1
Vladimir Edemskiy |
Des. Codes Cryptogr. | 1 |