Curve41417: Karatsuba revisited
From MaRDI portal
Publication:5265086
Recommendations
Cited in
(11)- Faster ECC over \(\mathbb {F}_{2^{521}-1}\) (feat. NEON)
- Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
- Fast elliptic curve cryptography in OpenSSL
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Fast algorithm of square rooting in some finite fields of odd characteristic
- Missing a trick: Karatsuba variations
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- Curve25519 for the Cortex-M4 and beyond
- Analysis on Yu et al.'s dynamic algorithm for canonic DBC
- A new algorithm for residue multiplication modulo \(2^{521}-1\)
- Efficient hardware implementations for elliptic curve cryptography over Curve448
This page was built for publication: Curve41417: Karatsuba revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265086)