Faster ECC over F₂^521-1 (feat. NEON)

DOI10.1007/978-3-319-30840-1_11MaRDI QIDQ2806769zbMATH OpenOpenAlexFDO

Authors Hwajeong Seo, Zhe Liu, Yasuyuki Nogami, Taehwan Park, Jongseok Choi, Lu Zhou, Howon Kim

Publication date 19 May 2016

Published in Information Security and Cryptology - ICISC 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30840-1_11

zbMATH Keywords

elliptic curve cryptographySIMDNEON1-level Karatsuba methodP-521

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Mathematical problems of computer architecture (68M07)

Recommendations

• Faster ECC over \(\mathbb {F}_{2^{521}-1}\)
• Curve41417: Karatsuba revisited
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• A new algorithm for residue multiplication modulo \(2^{521}-1\)
• Public Key Cryptography - PKC 2006

Cited in

(6)

• Faster ECC over \(\mathbb {F}_{2^{521}-1}\)
• Curve41417: Karatsuba revisited
• Fast NEON-based multiplication for lattice-based NIST post-quantum cryptography finalists
• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• A new algorithm for residue multiplication modulo \(2^{521}-1\)
• Secure GCM implementation on AVR

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

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