Comment on Primer on elliptic curve cryptographyparentComments−ColinWright12yThere is a fast exponentiation that is effectively Russian Peasant Multiplication, and it works in time proportional to number of bits in the exponent. Look up "fast exponentiation" or similar.−weavie12yGot it. This has been very enlightening. Thanks.
Comments
There is a fast exponentiation that is effectively Russian Peasant Multiplication, and it works in time proportional to number of bits in the exponent. Look up "fast exponentiation" or similar.
Got it. This has been very enlightening. Thanks.