Estimating the size of the image of deterministic hash functions to elliptic curves
From MaRDI portal
Publication:3584976
DOI10.1007/978-3-642-14712-8_5zbMATH Open1285.94060OpenAlexW1584499213MaRDI QIDQ3584976FDOQ3584976
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
Recommendations
Cryptography (94A60) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05)
Cited In (10)
- Elligator squared: uniform points on elliptic curves of prime order as uniform random strings
- Hashing to elliptic curves of \(j\)-invariant 1728
- Algebraic group model with oblivious sampling
- Deterministic encoding into twisted Edwards curves
- How to Hash into Elliptic Curves
- Differential uniformity and second order derivatives for generic polynomials
- Hashing into Hessian curves
- Improved elliptic curve hashing and point representation
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- On indifferentiable deterministic hashing into elliptic curves
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)