News for hackers. Stuff that matters.
Re:Math Advances Suggest RSA Encryption Could Fall Within 5 ... by jaekwon on Saturday August 10, 2013 @02:29PM (#6192106)
updated my comment.

The only thing I can think of is that discrete logs don't work that way.

while E^(e.log_E(M)) == E mod n, e.log_E(M) doesn't equal 1. And I'm not sure what /e means in the realm of exponents, besides *d, and I don't know how to find d without knowing M.

There are no comments on this comment yet.