See comment below.
Last active
June 1, 2025 09:47
-
-
Save Hermann-SW/79ebd53c248b272c96b03a690cb488b7 to your computer and use it in GitHub Desktop.
Fast discrete log() allows factoring RSA semiprimes easily
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I learned from Bill on pari-users list that GP znlog() does factor first:
https://pari.math.u-bordeaux.fr/archives/pari-users-2506/msg00001.html
This can be seen by debug=3 log:
So factoring with znlog() does not help for big RSA semiprimes.
But the method demonstrated above would allow to factor easily in case of an efficient discrete log algorithm.
141s of the 185s for znlog() are taken by factoring the 79 decimal digit semiprime: