Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this community
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.
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.
