Integer Factoring Algorithm Speeds

278 Views Asked by At

Given $N=pq$, would $\frac{p-1}{2}$ steps be fast compared with extant factoring methods?

1

There are 1 best solutions below

1
On BEST ANSWER

See for example Wikipedia, where sub-exponential methods are discussed (note that this is measured in terms of the bits needed to represent $N$, not of $N$ itself).