What is the default algorithm used by the MIRACL-Library [1] for elliptic curve cryptography systems to perform scalar-point multiplication with curves of Weierstrass form satisfying the equation : $y^2 \equiv x^3 + a\cdot x + b \pmod p$ defined over a prime Field $\mathbb{F}_p$ ?

I can't find any satisfying information about the used method, the point representation and the costs for the formulars.

[1] https://github.com/CertiVox/MIRACL


1 Answer 1


It depends your compilation options but the function ecurve_mult in MIRACL/source/mrcurve.c seems to use the w-ary non-adjacent form (wNAF) method.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.