values we use in GMP-ECM and the computed probabilities match those observed in experiments very well. This however means that the so computed values for the expected number of curves for given B1,B2 ...

Traditional public-key algorithms (RSA, ECC, Diffie-Hellman) rely on the hardness of the Discrete Logarithm Problem or Prime Integer Factorization. Peter Shor's algorithm completely breaks these ...