Close to Uniform Prime Number Generation With Fewer Random Bits

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$, where only $t$ is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.L. Montgomery, made precise by Friedlander and Granville; then the Extended Riemann Hypothesis; and finally fully unconditionally using the Barban-Davenport-Halberstam theorem. We argue that this approach has a number of desirable properties compared to previous algorithms.Comment: Full version of ICALP 2014 paper. Alternate version of IACR ePrint Report 2011/48

Sharpenings of Li's criterion for the Riemann Hypothesis

Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. For $n \to \infty$ we obtain that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ (with $A>0$ and $B$ explicitly given, also for the case of more general zeta or $L$-functions); whereas in the opposite case, $\lambda_n$ has a non-tempered oscillatory form.Comment: 10 pages, Math. Phys. Anal. Geom (2006, at press). V2: minor text corrections and updated reference

Quantum mechanical potentials related to the prime numbers and Riemann zeros

Prime numbers are the building blocks of our arithmetic, however, their distribution still poses fundamental questions. Bernhard Riemann showed that the distribution of primes could be given explicitly if one knew the distribution of the non-trivial zeros of the Riemann $\zeta(s)$ function. According to the Hilbert-P{\'o}lya conjecture there exists a Hermitean operator of which the eigenvalues coincide with the real part of the non-trivial zeros of $\zeta(s)$. This idea encourages physicists to examine the properties of such possible operators, and they have found interesting connections between the distribution of zeros and the distribution of energy eigenvalues of quantum systems. We apply the Mar{\v{c}}henko approach to construct potentials with energy eigenvalues equal to the prime numbers and to the zeros of the $\zeta(s)$ function. We demonstrate the multifractal nature of these potentials by measuring the R{\'e}nyi dimension of their graphs. Our results offer hope for further analytical progress.Comment: 7 pages, 5 figures, 2 table