It might be good to go into more detail about why it doesn't take n steps to calculate E given A, given that n is very large.
Instead of calculating one addition at a time, A + A + A + A + ..., the key generation will compute using repeated doubling, for example if we want to compute 130A then we can calculate it as
✅ @lanecwagner, I gave you an upvote on your post! Please give me a follow and I will give you a follow in return and possible future votes!
Thank you in advance!
A nice introduction.
It might be good to go into more detail about why it doesn't take n steps to calculate E given A, given that n is very large.
Instead of calculating one addition at a time, A + A + A + A + ..., the key generation will compute using repeated doubling, for example if we want to compute 130A then we can calculate it as
130A = 2(A+2(2(2(2(2(2A))))))
Congratulations @lanecwagner! You have completed some achievement on Steemit and have been rewarded with new badge(s) :
Click on the badge to view your Board of Honor.
If you no longer want to receive notifications, reply to this comment with the word
STOPDo not miss the last post from @steemitboard!
Participate in the SteemitBoard World Cup Contest!
Collect World Cup badges and win free SBD
Support the Gold Sponsors of the contest: @good-karma and @lukestokes