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

Finite field mapping to elliptic curves of j-invariant 1728. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2019)

Non-split Toric Codes. - Dmitrii I. Koshelev (Probl. Inf. Transm., 2019)

Double point compression for elliptic curves of j-invariant 0. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2020)

Efficient constant-time hashing to some elliptic curves of j-invariant 0. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2020)

Hashing to elliptic curves y2 = x3 + b provided that b is a quadratic residue. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2020)

Non-Split Toric BCH Codes on Singular del Pezzo Surfaces. - Dmitrii I. Koshelev (IEEE Trans. Inf. Theory, 2020)

Hashing to elliptic curves of j-invariant 1728. - Dmitrii I. Koshelev (Cryptogr. Commun., 2021)

New point compression method for elliptic Fq2-curves of j-invariant 0. - Dmitrii I. Koshelev (Finite Fields Their Appl., 2021)

Faster indifferentiable hashing to elliptic $ mathbb{F}_{ !q^2}$-curves. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2021)

Optimal encodings to elliptic curves of j-invariants 0, 1728. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2021)

How to hash onto 픾2 and not to hash onto 픾1 for pairing-friendly curves. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2021)

The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2021)

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., 2022)

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

The most efficient indifferentiable hashing to elliptic curves ofj-invariant 1728. - Dmitrii I. Koshelev (J. Math. Cryptol., 2022)

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

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

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

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

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

Subgroup membership testing on elliptic curves via the Tate pairing. - Dmitrii I. Koshelev (J. Cryptogr. Eng., 2023)

Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing. - Yu Dai; Debiao He; Dmitrii I. Koshelev; Cong Peng 005; Zhijian Yang (IACR Cryptol. ePrint Arch., 2024)

Simultaneously simple universal and indifferentiable hashing to elliptic curves. - Dmitrii I. Koshelev (IACR Cryptol. ePrint Arch., 2024)

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

Correction to: Subgroup membership testing on elliptic curves via the Tate pairing. - Dmitrii I. Koshelev (J. Cryptogr. Eng., 2024)

Hashing to Elliptic Curves Through Cipolla-Lehmer-Müller's Square Root Algorithm. - Dmitrii I. Koshelev (J. Cryptol., 2024)

Some remarks on how to hash faster onto elliptic curves. - Dmitrii I. Koshelev (J. Comput. Virol. Hacking Tech., 2024)

Application of Mordell-Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves. - Dmitrii I. Koshelev (J. Math. Cryptol., 2025)

Batch point compression in the context of advanced pairing-based protocols. - Dmitrii I. Koshelev (Appl. Algebra Eng. Commun. Comput., 2025)