Faster ECC over F₂^521-1

DOI10.1007/978-3-662-46447-2_24MaRDI QIDQ2941209zbMATH OpenOpenAlexFDO

Authors

Publication date 27 August 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46447-2_24

zbMATH Keywords

performanceEdwards curveselliptic curve cryptographyKaratsubaP-521Crandall numbersE-521generalised repunit primes

Mathematics Subject Classification ID

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

Recommendations

• Faster ECC over \(\mathbb {F}_{2^{521}-1}\) (feat. NEON)
• A new algorithm for residue multiplication modulo \(2^{521}-1\)
• Faster Addition and Doubling on Elliptic Curves
• Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
• Efficient arithmetic in (pseudo-)Mersenne prime order fields

Cited in

(8)

• Faster ECC over \(\mathbb {F}_{2^{521}-1}\) (feat. NEON)
• Fast implementation of Curve25519 using AVX2
• A new algorithm for residue multiplication modulo \(2^{521}-1\)
• Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
• Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• scientific article; zbMATH DE number 7013323 (Why is no real title available?)
• Missing a trick: Karatsuba variations

This page was built for publication: Faster ECC over \(\mathbb {F}_{2^{521}-1}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941209)