We stand with Ukraine  

Dmitrii I. Koshelev

Orcid: 0000-0002-4796-8989

According to our database1, Dmitrii I. Koshelev authored at least 30 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Batch point compression in the context of advanced pairing-based protocols.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
Appl. Algebra Eng. Commun. Comput., July, 2025

Application of Mordell-Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
J. Math. Cryptol., February, 2025

2024
Some remarks on how to hash faster onto elliptic curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
J. Comput. Virol. Hacking Tech., November, 2024

Hashing to Elliptic Curves Through Cipolla-Lehmer-Müller's Square Root Algorithm.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
J. Cryptol., June, 2024

Correction to: Subgroup membership testing on elliptic curves via the Tate pairing.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
J. Cryptogr. Eng., April, 2024

Point (de)compression for elliptic curves over highly 2-adic finite fields.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2024

Simultaneously simple universal and indifferentiable hashing to elliptic curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2024

Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing.
[BibTeX]
[DOI]
Yu Dai
,
Debiao He
,
Dmitrii I. Koshelev
,
Cong Peng
,
Zhijian Yang
IACR Cryptol. ePrint Arch., 2024

2023
Subgroup membership testing on elliptic curves via the Tate pairing.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
J. Cryptogr. Eng., April, 2023

Application of Mordell-Weil lattices with large kissing numbers to acceleration of multi-scalar multiplication on elliptic curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2023

Generation of two "independent" points on an elliptic curve of j-invariant ≠q 0, 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2023

Batching Cipolla-Lehmer-Müller's square root algorithm with hashing to elliptic curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2023

Hashing to elliptic curves over highly 2-adic fields $\mathbb{F}_{\!q}$ with O(log(q)) operations in $\mathbb{F}_{\!q}$.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2023

2022
Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
SIAM J. Appl. Algebra Geom., March, 2022

The most efficient indifferentiable hashing to elliptic curves of<i>j</i>-invariant 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
J. Math. Cryptol., 2022

Generation of "independent" points on elliptic curves by means of Mordell-Weil lattices.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2022

Indifferentiable hashing to ordinary elliptic ${\mathbb {F}}_{\!q}$-curves of j=0 with the cost of one exponentiation in ${\mathbb {F}}_{\!q}$.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
Des. Codes Cryptogr., 2022

2021
The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2021

How to hash onto 픾<sub>2</sub> and not to hash onto 픾<sub>1</sub> for pairing-friendly curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2021

Optimal encodings to elliptic curves of j-invariants 0, 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2021

Faster indifferentiable hashing to elliptic $\mathbb{F}_{\!q^2}$-curves.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2021

New point compression method for elliptic Fq2-curves of <i>j</i>-invariant 0.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
Finite Fields Their Appl., 2021

Hashing to elliptic curves of j-invariant 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
Cryptogr. Commun., 2021

2020
Non-Split Toric BCH Codes on Singular del Pezzo Surfaces.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IEEE Trans. Inf. Theory, 2020

Hashing to elliptic curves y<sup>2</sup> = x<sup>3</sup> + b provided that b is a quadratic residue.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2020

Efficient constant-time hashing to some elliptic curves of j-invariant 0.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2020

Double point compression for elliptic curves of j-invariant 0.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2020

2019
Non-split Toric Codes.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
Probl. Inf. Transm., 2019

Finite field mapping to elliptic curves of j-invariant 1728.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2019

A new elliptic curve point compression method based on $\mathbb{F}_{\!p}$-rationality of some generalized Kummer surfaces.
[BibTeX]
[DOI]
Dmitrii I. Koshelev
IACR Cryptol. ePrint Arch., 2019


  Loading...