Elliptic Curve Cryptography for the masses: Simple and fast finite field arithmetic

ePrint Report: Elliptic Curve Cryptography for the masses: Simple and fast finite field arithmetic

Michael Scott

Shaped prime moduli are often considered for use in elliptic curve and isogeny-based cryptography to allow for faster modular reduction. Here we focus on the most common choices for shaped primes that have been suggested, that is pseudo-Mersenne, generalized Mersenne and Montgomery-friendly primes. We consider how best to to exploit these shapes for maximum efficiency, and provide an open source tool to automatically generate, …

cryptography curve elliptic elliptic curve cryptography eprint report fast focus michael modular prime report simple