Curve41417: Karatsuba revisited

DOI10.1007/978-3-662-44709-3_18zbMATH Open1375.94102OpenAlexW1870556762MaRDI QIDQ5265086FDOQ5265086

Tanja Lange, Chitchanok Chuengsatiansup, Daniel J. Bernstein

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

• Faster ECC over \(\mathbb {F}_{2^{521}-1}\) (feat. NEON)
• High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
• Kummer strikes back: new DH speed records
• Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
• Fast elliptic curve cryptography in OpenSSL

zbMATH Keywords

performancevectorizationEdwards curvesKaratsubaCurve41417radix choicesreduced refined Karatsubarefined Karatsuba

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cited In (8)

• Fast algorithm of square rooting in some finite fields of odd characteristic
• Efficient hardware implementations for elliptic curve cryptography over Curve448
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC
• A New Algorithm for Residue Multiplication Modulo $$2^{521}-1$$
• 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)