4 ms·

I don't think that's correct. Coppersmith's attack requires at least 2 messages. You're talking about the paper "Low-Exponent RSA with Related Messages (1996)"

• sid0 17y ago
  No... what I'm referring to is given in http://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf http://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf -- basically using LLL to bring the numbers down to below the RSA modulo. (I know it works, because I wrote Mathematica code to implement it. :) )