I have read several articles on the temporal attack against Montgomery multiplication to speedup RSA computations. However, I do not quite get the principle.
I understood that there is a additional reduction when performing Montgomery multiplication when the multiplication is greater than the modulus.
What I don't understand is how to choose the message sets. Or how to go from one key bit to another. And how many messages should be taken for each bit.
Edit : i'm still wondering on how we get the two sets of messages. The first set should not include a reduction in contrary to the second set. How can we know if there is a reduction or not ?