Cryptography, Cybersecurity.
gmpy2.next_prime(random.getrandbits(nprimebits)) q = gmpy2.next_prime(random.getrandbits(nprimebits)) n=p*q print(f"Number of bits in prime={nprimebits} and {primes[nprimes]}-powersmooth\n") m=product_of_primes(nprimes) res, factors = Pollardpm1(n, m, gcd_bound=1) print(f"Result: ", res) if