4 ms·
https://gist.github.com/jaekwon/6201493 https://gist.github.com/jaekwon/6201493 edit: it doesn't work. :P It worked when e or d was set to 1. oops. you might
by jaekwon 13y ago
https://gist.github.com/jaekwon/6201493 https://gist.github.com/jaekwon/6201493
edit: it doesn't work. :P It worked when e or d was set to 1. oops.
you might want to see if there's a bug in the main function.
- ColinWright 13y agoIndeed, but these are really small numbers. RSA only works with really BIG numbers, which is one reason people are starting to insist that PKC should use ECC.
- jaekwon 13y agoupdated 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.