Noah Lebowitz-Lockard

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We introduce an algorithm to generate a random Gaussian integer with the uniform distribution among those with norm at most N , along with its prime factorization. Then, we show that the algorithm runs in polynomial time. The hard part of this algorithm is determining a norm at random with a specific distribution. After that, finding the actual Gaussian(More)
  • 1