[curves] Crash Course on ECC poster
ron at flownet.com
Wed Jul 8 17:11:21 PDT 2015
Could you please elaborate on this, or point me to a reference? According to:
the Montgomery ladder “is of full generality and applies to any abelian group.”
Is it really the ladder that is more efficient for Montgomery curves, or is it just the point addition and doubling operations that are more efficient?
On Jul 8, 2015, at 4:05 PM, Michael Hamburg <mike at shiftleft.org> wrote:
> The Montgomery ladder is significantly simpler and more efficient on Montgomery curves than on short Weierstrass curves.
>> On Jul 8, 2015, at 3:38 PM, Ron Garret <ron at flownet.com> wrote:
>> “Montgomery curves are attractive because of the ladder method of scalar multiplication”
>> Is this actually true? I was under the impression that the Montgomery ladder was applicable to any kind of elliptic curve. They just both happen to have been invented by Peter Montgomery.
>> On Jul 7, 2015, at 8:12 PM, Tony Arcieri <bascule at gmail.com> wrote:
>>> I made this poster for the DEFCON Crypto and Privacy Village. It's intended for audiences of mixed ability levels:
>>> Would appreciate technical feedback on it. If you'd like to suggest copy changes, please consider design constraints (i.e. available room on the page).
>>> Tony Arcieri
>>> Curves mailing list
>>> Curves at moderncrypto.org
>> Curves mailing list
>> Curves at moderncrypto.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Curves