Is there a polynomial-time algorithm to find a prime larger than $n$?

Is there a polynomial-time algorithm to find a prime larger than $n$?

If Cramér’s conjecture is true, we can use AKS to test $n+1$, $n+2$, etc. until the next prime is found, and this method will find a prime in polynomial time (in $\log n$) because AKS runs in polynomial time and Cramér’s conjecture guarantees $O((\log{n})^2)$ primes to test.

Without assuming Cramér’s conjecture, and without requiring that the prime to be found is the next prime following $n$, only that it is larger than $n$, can such a prime be found in time $O((\log{n})^k)$ for some $k$?

This question is motivated by some thoughts I wrote about in the comments on this answer by Gerry Myerson.

Solutions Collecting From Web of "Is there a polynomial-time algorithm to find a prime larger than $n$?"