Talk:Elliptic curve arithmetic: Difference between revisions
Content added Content deleted
m (changed section name.) |
(added a new talk section.) |
||
| Line 5: | Line 5: | ||
-- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:18, 4 April 2016 (UTC) |
-- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:18, 4 April 2016 (UTC) |
||
== multiple additions vs. multiplication == |
|||
(Regarding the ''extra credit'' part of the task.) |
|||
Has anybody done more research on performing '''N''' additions versus multiplication (as the '''EchoLisp''' example has done? |
|||
There certainly seems to be a difference on how the ''multiplication'' is implemented. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 22:25, 4 April 2016 (UTC) |
|||
Revision as of 22:25, 4 April 2016
what is secp256k1 ?
What is secp256k1 (as mentioned in the Rosetta Codes task's preamble:
- You will use the a and b parameters of secp256k1, ... .
-- Gerard Schildberger (talk) 22:18, 4 April 2016 (UTC)
multiple additions vs. multiplication
(Regarding the extra credit part of the task.)
Has anybody done more research on performing N additions versus multiplication (as the EchoLisp example has done?
There certainly seems to be a difference on how the multiplication is implemented. -- Gerard Schildberger (talk) 22:25, 4 April 2016 (UTC)