Hey, 4chan. I'm really bad at coding. Does anyone want to help me code and test this polynomial time integer factorization (well semiprimes) and discrete logarithms algorithm? It's based on Shor's algorithm and it's just slow enough that it won't be able to break today's RSA keys etc. without a lot of resources.

Pseudocode is here http://mathb.in/45046

Software for counting the integer points of convex polytopes is here.
https://www.math.ucdavis.edu/~latte/software.php
http://barvinok.gforge.inria.fr/