Quote from: bitspill on January 31, 2015, 02:22:23 PM

Quote from: ndnhc on January 31, 2015, 02:17:51 PM

No, I am substituting the equation back into itself. Please check if I was wrong.

Are you using standard division where the / is or are you using "multiplication by the modular inverse"
http://cs.brown.edu/courses/cs007/modmult/node2.html

Should we be knowing what 'p' is or is this another arbitrary number like 'a'?

Quote from: Evil-Knievel on January 28, 2015, 07:00:23 PM

(basically all operations modulo some sumber p)

lol, sorry, I did a mistake. I simply substituted the equation back in after each process. I skipped adding it.

understood the question better now. But still have things unclear.

Quote

You can start multiple such chains beginning at x=9, and add the resulting x values
using the addition algorithm from http://en.wikipedia.org/wiki/Montgomery_curve (Montgomery arithmetic section).
Note, that the x value, is the value you get at the end of such calculation-chain, and the z value is always 1.

what is meant by multiple chains? aand where is this 'z'?

and is this the reqd formula?