Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
From MaRDI portal
Publication:4911913
DOI10.1090/S0025-5718-2012-02606-8zbMath1312.94048OpenAlexW2080206293MaRDI QIDQ4911913
Reza Rezaeian Farashahi, Pierre-Alain Fouque, Mehdi Tibouchi, José Felipe Voloch, Igor E. Shparlinski
Publication date: 20 March 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2012-02606-8
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Exponential sums (11T23) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Unnamed Item, Identity-based undetachable digital signature for mobile agents in electronic commerce, Constructing Permutation Rational Functions from Isogenies, 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, Exponential sums over points of elliptic curves, Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers, \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves, Batching base oblivious transfers, Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm, Hashing into Hessian Curves, Improved elliptic curve hashing and point representation, Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems, Deterministic Encoding into Twisted Edwards Curves, On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2, Uniform encodings to elliptic curves and indistinguishable point representation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequences, discrepancies and applications
- Careful with Composition: Limitations of the Indifferentiability Framework
- 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 hashing into elliptic curves
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves
- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
- ID-Based Blind Signature and Ring Signature from Pairings
- Hierarchical ID-Based Cryptography
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Points on elliptic curves over finite fields
- Rational Points on Certain Hyperelliptic Curves over Finite Fields
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- Theory of Cryptography
- Public Key Cryptography – PKC 2004
