Talk:Montgomery curve

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

I suggest replacing the "Daniel J. Bernstein, Peter Birkner, Marc Joye, Tanja Lange and Christiane Peters (2008). Twisted Edwards Curves. Springer-Verlag Berlin Heidelberg. ISBN 978-3-540-68159-5." link by http://cr.yp.to/newelliptic/twisted-20080313.pdf to avoid the paywall. The suggested link points to Bernstein's website. — Preceding unsigned comment added by 2001:4CA0:0:F230:9CBB:29C3:9C99:DCA5 (talk) 14:28, 17 July 2012 (UTC)[reply]

Equivalence with Weierstrass curves[edit]

I feel like the mapping from Montgomery- to Weierstrass-form should be

instead of

See Okeya, K.; Kurumatani, H.; Sakurai, K. (2000). "Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications". Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems. Melbourne, Victoria, Australia: Springer Berlin Heidelberg. pp. 238–257. doi:10.1007/978-3-540-46588-1_17.

Jocodes (talk) 13:04, 9 September 2016 (UTC)[reply]

Choice of parameters for diagram[edit]

The chosen parameters for the curve in the diagram result in a curve shape over the reals that requires very close attention to see the actual shape near the origin. On an initial impression it looks as though there are lines crossing at the origin, but that's not correct.

(For independent reasons I'm skeptical how much useful intuition the shape of the curve over the reals provides, since that is not what is actually used in applications. But if we're going to show that shape, it should not be misleading or require zooming in to see what is really going on.)

For example, the curve y2 = x3 + 2.5x2 + x shows the general shape much better in my opinion.

Daira Hopwood ⚥ (talk) 13:24, 26 November 2017 (UTC)[reply]


I fully agree with that notion. In fact I completely fell for that and needed an expert that today told me that my understanding was completely wrong and that I would have had to look much closer at the image. Can somebody please replace it soon? --Florian Weber (talk) 20:00, 15 April 2019 (UTC)[reply]
I've now replaced the image with what I hope is both correct and makes it clearer that there should not be any singularities. --Florian Weber (talk) 09:58, 28 January 2020 (UTC)[reply]

Unexplained Term In Example[edit]

This might just be my unfamiliarity with the domain, but in case it's an actual error: in "Algorithm and example", is defined with a mysterious term that isn't defined anywhere else in the page that I can see:

I think that should be instead, is that right? Given the full algorithm (without the simplification) which is:

(It's also shown again as a few lines further in the example) — Preceding unsigned comment added by 2601:282:4700:C73:A049:BF47:6664:4651 (talk) 21:37, 28 April 2022 (UTC)[reply]

Incorrect sign?[edit]

In "Montgomery arithmetic" it states:

«It is possible to do some "operations" between the points of an elliptic curve: "adding" two points consists of finding a third one such that

however it's more typical to state that gives the inverse of , in other words either or . With this in mind, should the sign be flipped on R in this statement? Yielding:

«It is possible to do some "operations" between the points of an elliptic curve: "adding" two points consists of finding a third one such that — Preceding unsigned comment added by 2601:282:4700:C73:A049:BF47:6664:4651 (talk) 02:52, 29 April 2022 (UTC)[reply]