Four Q: four-dimensional decompositions on a Q-curve over the Mersenne prime
From MaRDI portal
Publication:2811132
Recommendations
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Faster ECC over \(\mathbb {F}_{2^{521}-1}\)
- Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
Cited in
(17)- Kummer for genus one over prime-order fields
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Koblitz curves over quadratic fields
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- Faster ECC over \(\mathbb {F}_{2^{521}-1}\)
- High-performance implementation of elliptic curve cryptography using vector instructions
- Fast endomorphisms in integer sub-decomposition method on Secp192k1
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
- Fast public-key silent OT and more from constrained Naor-Reingold
- Efficient and Provable White-Box Primitives
- The complete cost of cofactor \(h=1\)
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Binary Kummer line
- Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
- Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields
- Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
This page was built for publication: Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811132)
