Deterministic Encoding into Twisted Edwards Curves
From MaRDI portal
Publication:2817819
DOI10.1007/978-3-319-40367-0_18zbMath1346.94138OpenAlexW2499458149MaRDI QIDQ2817819
Bao Li, Xiaoyang He, Wei Yu, Song Tian, Kun-Peng Wang
Publication date: 2 September 2016
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40367-0_18
Cites Work
- Unnamed Item
- Unnamed Item
- Hashing into Jacobi quartic curves
- A new polynomial factorization algorithm and its implementation
- Faster computation of the Tate pairing
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Hashing into Hessian Curves
- Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
- How to Hash into Elliptic Curves
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Twisted Edwards Curves
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves
- Twisted Edwards Curves Revisited
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Points on elliptic curves over finite fields
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
- Rational Points on Certain Hyperelliptic Curves over Finite Fields
- Inverted Edwards Coordinates
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Advances in Cryptology - CRYPTO 2003
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Another Approach to Pairing Computation in Edwards Coordinates
- Algorithmic Number Theory
This page was built for publication: Deterministic Encoding into Twisted Edwards Curves
