Doubling the bit length makes the problem much much harder than just twice as ha...

		ufo on June 30, 2019 \| parent \| context \| favorite \| on: Factoring may be easier than we think (2016) Doubling the bit length makes the problem much much harder than just twice as hard. The n in the sqrt(n) you mentioned is the number being factored, which grows exponentially with bit length.