VLDB 2026 Research / reviewers in the wild / expert
Dmitrii I. Koshelev
dblp:251/1442
· DBLP profile ↗
3ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0002-4796-8989ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 first-author · 2 since 2021Theory of computation · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Hashing to Elliptic Curves Through Cipolla-Lehmer-Müller's Square Root Algorithm
Dmitrii I. Koshelev |
J. Cryptol. | 1 |
| 2022 | Indifferentiable hashing to ordinary elliptic ${\mathbb {F}}_{\!q}$-curves of j=0 with the cost of one exponentiation in ${\mathbb {F}}_{\!q}$
Dmitrii I. Koshelev |
Des. Codes Cryptogr. | 1 |
| 2020 | Non-Split Toric BCH Codes on Singular del Pezzo SurfacesabstractIn the article we construct low-rate non-split toric q-ary codes on some singular surfaces. More precisely, we consider non-split toric cubic and quartic del Pezzo surfaces, whose singular points are Fq-conjugate. Our codes turn out to be BCH ones with sufficiently large minimum distance d. Indeed, we prove that d-d* ≥ q-[2.√q] j-1, where d* is the designed minimum distance. In other words, we significantly improve upon BCH bound. On the other hand, the defect of the Griesmer bound for the new codes is ≤ [2.√q] j - 1, which also seems to be quite good. It is worth noting that to better estimate d we actively use the theory of elliptic curves over finite fields. Dmitrii I. Koshelev |
IEEE Trans. Inf. Theory | 1 |