Some remarks on how to hash faster onto elliptic curves
D Koshelev - Journal of Computer Virology and Hacking Techniques, 2024 - Springer
This article proposes four optimizations of indifferentiable hashing onto (prime-order
subgroups of) ordinary elliptic curves over finite fields F q. One of them is dedicated to elliptic …
subgroups of) ordinary elliptic curves over finite fields F q. One of them is dedicated to elliptic …
Point (de)compression for elliptic curves over highly -adic finite fields
D Koshelev - Cryptology ePrint Archive, 2024 - eprint.iacr.org
This article addresses the issue of efficient and safe (de) compression of $\mathbb {F} _ {\! q}
$-points on an elliptic curve $ E $ over a highly $2 $-adic finite field $\mathbb {F} _ {\! q} $ of …
$-points on an elliptic curve $ E $ over a highly $2 $-adic finite field $\mathbb {F} _ {\! q} $ of …