The complete cost of cofactor \(h=1\)
From MaRDI portal
Publication:2179402
DOI10.1007/978-3-030-35423-7_19zbMath1456.94111OpenAlexW2982690422MaRDI QIDQ2179402
Publication date: 12 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-35423-7_19
elliptic curve cryptographyscalar multiplicationSIMDCurve25519cofactor securityprime-field arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- Complete systems of two addition laws for elliptic curves
- Implementing complete formulas on Weierstrass curves in hardware
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Curve25519 for the Cortex-M4 and beyond
- Sandy2x: New Curve25519 Speed Records
- Four $$\mathbb {Q}$$ : Four-Dimensional Decompositions on a $$\mathbb {Q}$$ -curve over the Mersenne Prime
- Complete Addition Formulas for Prime Order Elliptic Curves
- Fast Implementation of Curve25519 Using AVX2
- On the Correct Use of the Negation Map in the Pollard rho Method
- High-Speed High-Security Signatures
- Decaf: Eliminating Cofactors Through Point Compression
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Elliptic Curve Cryptosystems
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Public Key Cryptography - PKC 2006
This page was built for publication: The complete cost of cofactor \(h=1\)
