How to Hash into Elliptic Curves
From MaRDI portal
Publication:3183571
DOI10.1007/978-3-642-03356-8_18zbMath1252.94075OpenAlexW2131559681MaRDI QIDQ3183571
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_18
Related Items (31)
Hashing to elliptic curves of \(j\)-invariant 1728 ⋮ Unnamed Item ⋮ Trapdoor DDH groups from pairings and isogenies ⋮ Identity-based undetachable digital signature for mobile agents in electronic commerce ⋮ Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728 ⋮ Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings ⋮ A short non-delegatable strong designated verifier signature ⋮ \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Unnamed Item ⋮ Injective encodings to binary ordinary elliptic curves ⋮ Blind Transfer of Personal Data Achieving Privacy ⋮ Hashing into Hessian Curves ⋮ Improved elliptic curve hashing and point representation ⋮ Indifferentiable deterministic hashing to elliptic and hyperelliptic curves ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ On a new formal proof model for RFID location privacy ⋮ The geometry of some parameterizations and encodings ⋮ On subversion-resistant SNARKs ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ EMBEDDING FINITE FIELDS INTO ELLIPTIC CURVES ⋮ On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2 ⋮ Security Analysis of the PACE Key-Agreement Protocol ⋮ The geometry of flex tangents to a cubic curve and its parameterizations ⋮ Uniform encodings to elliptic curves and indistinguishable point representation ⋮ Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications ⋮ A Generalised Successive Resultants Algorithm ⋮ Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
This page was built for publication: How to Hash into Elliptic Curves
