Faster ECC over $$\mathbb {F}_{2^{521}-1}$$

DOI10.1007/978-3-662-46447-2_24zbMath1345.94066OpenAlexW2274706355MaRDI QIDQ2941209

No author found.

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

performanceelliptic curve cryptographyEdwards curvesKaratsubaP-521Crandall numbersE-521generalised repunit primes

Mathematics Subject Classification ID

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

Related Items (4)

Fast Implementation of Curve25519 Using AVX2 ⋮ A New Algorithm for Residue Multiplication Modulo $$2^{521}-1$$ ⋮ Missing a trick: Karatsuba variations ⋮ Efficient arithmetic in (pseudo-)Mersenne prime order fields

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