Estimating the size of the image of deterministic hash functions to elliptic curves

DOI10.1007/978-3-642-14712-8_5MaRDI QIDQ3584976zbMATH OpenOpenAlexFDO

Authors Pierre-Alain Fouque, Mehdi Tibouchi

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14712-8_5

zbMATH Keywords

function fieldshash functionsElliptic curves

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05)

Recommendations

• On hashing into elliptic curves
• Deterministic encoding and hashing to odd hyperelliptic curves
• How to Hash into Elliptic Curves
• Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
• Hashing into Hessian curves

Cited in

(10)

• Hashing to elliptic curves of \(j\)-invariant 1728
• Deterministic encoding into twisted Edwards curves
• How to Hash into Elliptic Curves
• Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
• Differential uniformity and second order derivatives for generic polynomials
• Elligator squared: uniform points on elliptic curves of prime order as uniform random strings
• Hashing into Hessian curves
• Improved elliptic curve hashing and point representation
• On indifferentiable deterministic hashing into elliptic curves
• Algebraic group model with oblivious sampling

This page was built for publication: Estimating the size of the image of deterministic hash functions to elliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584976)