Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ColinWright
on Oct 25, 2013
|
parent
|
context
|
favorite
| on:
Primer on elliptic curve cryptography
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.
weavie
on Oct 25, 2013
[–]
Got it. This has been very enlightening. Thanks.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
