I'm more of a programmer than a Mathematician so please bear with me if my question is too trivial.
I am looking up RSA specifically the key generation bit. Using Trial division, I know that it would take roughly
(2*(n^0.5))/ln n divisions to find the factors of n.
However I'd like to represent this in a generalized manner i.e. how many divisions would it take to factorize the product of two k-digit primes ?
Any help would be much appreciated