Login / Signup
Indifferentiable hashing to ordinary elliptic ${\mathbb {F}}_{\!q}$-curves of j=0 with the cost of one exponentiation in ${\mathbb {F}}_{\!q}$.
Dmitrii Koshelev
Published in:
Des. Codes Cryptogr. (2022)
Keyphrases
</>
special case
vertex set
similarity search
total cost
cost reduction
fourier descriptors
planar curves
high cost
file organization
order preserving
hilbert space
digital curves
data sets
minimum cost
nearest neighbor
high dimensional
data structure