What is maximum $p\in(0,\frac12)$ such that if we know $2p\in(0,1)$ fraction of bits of $PQ$ with $P,Q$ primes it is possible to identify $p$ fraction of bits in each of $P,Q$ with certainty in polynomial time?
Uncertainty in semiprime factors
Turbo
- 13.9k
- 1
- 27
- 76