The complete cost of cofactor h=1
From MaRDI portal
Publication:2179402
Recommendations
- Combinatorial cost: a coarse setting
- The combinatoral cost
- Coefficient multipliers from \(H(G_ 1)\) into \(H(G_ 2)\)
- Cofactor matrices
- The hive model and the factorisation of Kostka coefficients
- scientific article; zbMATH DE number 7117014
- Approximate Hagemann-Mitschke co-operations
- The cofactor system and a criterion on common factor with given arbitrary degree
- On the exact values of coefficients of coiflets
- The “Coefficients H” Technique
Cites work
- A normal form for elliptic curves
- Complete addition formulas for prime order elliptic curves
- Complete systems of two addition laws for elliptic curves
- Curve25519 for the Cortex-M4 and beyond
- Decaf: eliminating cofactors through point compression
- Elliptic Curve Cryptosystems
- Fast implementation of Curve25519 using AVX2
- Faster Addition and Doubling on Elliptic Curves
- Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
- High-speed high-security signatures
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1302784 (Why is no real title available?)
- Implementing complete formulas on Weierstrass curves in hardware
- On the correct use of the negation map in the Pollard rho method
- Public Key Cryptography - PKC 2006
- Sandy2x: new Curve25519 speed records
- Serious cryptography. A practical introduction to modern encryption. With a foreword by Matthew D. Green
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Twisted Edwards Curves
- Twisted Edwards Curves Revisited
This page was built for publication: The complete cost of cofactor \(h=1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179402)
