Deterministic encoding into twisted Edwards curves
From MaRDI portal
Recommendations
Cites work
- A new polynomial factorization algorithm and its implementation
- A normal form for elliptic curves
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- Another Approach to Pairing Computation in Edwards Coordinates
- Deterministic encoding and hashing to odd hyperelliptic curves
- Efficient indifferentiable hashing into ordinary elliptic curves
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Estimating the size of the image of deterministic hash functions to elliptic curves
- Faster Addition and Doubling on Elliptic Curves
- Faster computation of the Tate pairing
- Hashing into Hessian curves
- Hashing into Jacobi quartic curves
- Highly-efficient universally-composable commitments based on the DDH assumption
- How to Hash into Elliptic Curves
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Improved Miller’s Algorithm for Computing Pairings on Edwards Curves
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
- Inverted Edwards Coordinates
- Points on elliptic curves over finite fields
- Rational Points on Certain Hyperelliptic Curves over Finite Fields
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
This page was built for publication: Deterministic encoding into twisted Edwards curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817819)