Improved elliptic curve hashing and point representation
DOI10.1007/S10623-016-0288-2zbMATH Open1402.94071OpenAlexW2532723874MaRDI QIDQ510463FDOQ510463
Authors: Mehdi Tibouchi, Taechan Kim 
Publication date: 10 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01275711/file/wcc15-mo2-2.pdf
Recommendations
- On hashing into elliptic curves
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- How to Hash into Elliptic Curves
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other character sums and Gauss sums (11T24) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of Cryptography
- On a trigonometric inequality of Vinogradov
- Mixed exponential sums over finite fields
- Rational Points on Certain Hyperelliptic Curves over Finite Fields
- Title not available (Why is that?)
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Title not available (Why is that?)
- Injective encodings to elliptic curves
- An asymptotic formula for a trigonometric sum of Vinogradov
- The geometry of some parameterizations and encodings
- Estimation of a sum along an algebraic curve
- Binary elligator squared
- Indifferentiable hashing to Barreto-Naehrig curves
- Impossibility of surjective Icart-like encodings
- Elligator squared: uniform points on elliptic curves of prime order as uniform random strings
- Hashing into Hessian curves
- Deterministic encoding and hashing to odd hyperelliptic curves
- Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
- How to Hash into Elliptic Curves
- On a sum of Vinogradov
- On hashing into elliptic curves
- Efficient indifferentiable hashing into ordinary elliptic curves
- Estimating the size of the image of deterministic hash functions to elliptic curves
- Points on elliptic curves over finite fields
- An efficient method of generating rational points on elliptic curves
- Algorithmic Number Theory
- The geometry of flex tangents to a cubic curve and its parameterizations
Cited In (11)
- New schemes for sharing points on an elliptic curve
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- Batching base oblivious transfers
- Equidistribution among cosets of elliptic curve points in intervals
- Hashing with Elliptic Curve L-Functions
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves
- Uniform encodings to elliptic curves and indistinguishable point representation
- The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function
Uses Software
This page was built for publication: Improved elliptic curve hashing and point representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510463)
