Could you please elaborate on this, or point me to a reference? According to:
https://choucroutage.com/Papers/SideChannelAttacks/ches-2002-joye.pdf 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? rg On Jul 8, 2015, at 4:05 PM, Michael Hamburg <[email protected]> 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 <[email protected]> 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. >> >> rg >> >> On Jul 7, 2015, at 8:12 PM, Tony Arcieri <[email protected]> wrote: >> >>> I made this poster for the DEFCON Crypto and Privacy Village. It's intended >>> for audiences of mixed ability levels: >>> >>> https://i.imgur.com/hwbSRHh.png >>> >>> 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). >>> >>> Thanks! >>> >>> -- >>> Tony Arcieri >>> _______________________________________________ >>> Curves mailing list >>> [email protected] >>> https://moderncrypto.org/mailman/listinfo/curves >> >> _______________________________________________ >> Curves mailing list >> [email protected] >> https://moderncrypto.org/mailman/listinfo/curves >
_______________________________________________ Curves mailing list [email protected] https://moderncrypto.org/mailman/listinfo/curves
