Talk:Montgomery reduction

Draft

This is my first wiki entry Please send criticisms and suggestion for this code to me --User:Mahaju december 19 Thank you

Hi. Good start for a first task, I'll make some observations. Please take them as constructive.

please sign your talk pages. (checked - --Mahaju 01:40, 21 December 2011 (UTC))
perhaps a reference to wp:Montgomery_reduction would help. You might even want to borrow and cite some text. (checked - --Mahaju 01:40, 21 December 2011 (UTC))
Good ref to numerical recipes. (still trying to find some - --Mahaju 01:40, 21 December 2011 (UTC))

Oops, mental shot circuit - I meant Handbook of Applied Crypto (HAC) - sorry. --Dgamey 03:04, 21 December 2011 (UTC)

not sure if there are any copyright issues, say with the pseudo-code (how do I find out about such things? - --Mahaju 01:40, 21 December 2011 (UTC))

Well if it came from HAC it's likely got a copyright of some kind. --Dgamey 03:04, 21 December 2011 (UTC)

Task descriptions should be as non-language specific as possible. Once there are a bunch of examples the C++ reference in the description won't make sense. (will try to edit this in future - --Mahaju 01:40, 21 December 2011 (UTC))
On a quick read over I didn't get any sense of what this was and what is was useful for. Always a motivating factor. (I cannot do a detailed tutorial at the moment so have referenced the book - --Mahaju 01:40, 21 December 2011 (UTC))

That was why I suggested possibly borrowing and citing from WP. --Dgamey 03:04, 21 December 2011 (UTC)

Is this a duplicate/strong overlap of Modular_exponentiation. There should probably be cross-links at least. (No, but is somewhat related - --Mahaju 01:40, 21 December 2011 (UTC))

That's all. Good luck. --Dgamey 13:18, 20 December 2011 (UTC)

Made some minor changes to talk page and wiki page --Mahaju 01:40, 21 December 2011 (UTC)

I suggest that users not interleave comments. In the above text, I cannot know whether each word is by Dgamey, or by Mahaju. When replying to a comment, please write the reply below the comment, not in the middle of the comment. --Kernigh 00:40, 22 December 2011 (UTC)

I've adjusted the page text so that the task is more clearly separated from the implementation of it; the key point is that we want the text to still work when there are many implementations in different languages. (For example, it's obvious that a particular language's implementation is in its own named section so you don't write that in the header material.) I've also made more use of <math> tags; the basic operations are mathematical after all. But don't worry that these changes were made; it takes practice to write perfect pages, and that you get by working at it and being helped by those who go before you. –Donal Fellows 18:09, 22 December 2011 (UTC)

No overlap with modular exponentiation

In the previous section, someone wrote that this task might overlap with modular exponentiation. There is no overlap. Montgomery reduction involves a^-1, the modular multiplicative inverse of a. Modular exponentiation, as we have it, can only do a^b when b ≥ 0. --Kernigh 00:40, 22 December 2011 (UTC)

Example numbers?

I would like to see some numerical examples. --Rdm 15:04, 23 December 2011 (UTC)