19 Aug
2013
19 Aug
'13
10:26 p.m.
On Mon, Aug 19, 2013 at 9:00 PM, Warren D Smith <warren.wds@gmail.com> wrote:
M is deducible if attacker has black box access to a cryptor box -- you binary search to see how large allowed to go, to deduce M.
I don't understand what you're searching for here. Because p and q are the same length, roughly sqrt(n), we know phi(M) is roughly n - 2 sqrt(n). But it's hard to tell if a given exponent is above or below that point, so I don't see how you can search. -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com