Proving uniform output of CSPRNG
If the primes $p$ and $q$ are:


appropriately chosen (see abstract of original paper here) and
large enough (use NFS factoring complexity to determine how large they should be) 


then to distinguish non uniformity one basically has to factor $N=pq.$ However, as stated by @Maeher in the comments this holds only asymptotically.