Curve41417: Karatsuba revisited
From MaRDI portal
Publication:5265086
DOI10.1007/978-3-662-44709-3_18zbMATH Open1375.94102OpenAlexW1870556762MaRDI QIDQ5265086FDOQ5265086
Authors: Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange
Publication date: 21 July 2015
Published in: Advanced Information Systems Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44709-3_18
Recommendations
performancevectorizationEdwards curvesKaratsubaCurve41417radix choicesreduced refined Karatsubarefined Karatsuba
Cited In (11)
- Fast algorithm of square rooting in some finite fields of odd characteristic
- Faster ECC over \(\mathbb {F}_{2^{521}-1}\) (feat. NEON)
- Curve25519 for the Cortex-M4 and beyond
- A new algorithm for residue multiplication modulo \(2^{521}-1\)
- Efficient hardware implementations for elliptic curve cryptography over Curve448
- Fast elliptic curve cryptography in OpenSSL
- Analysis on Yu et al.'s dynamic algorithm for canonic DBC
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Missing a trick: Karatsuba variations
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)