69 research outputs found
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 less than ,
the basic idea is to fix a constant , pick a
uniformly random coprime to , and choose of the form ,
where only 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
Interval oscillation criteria for second-order nonlinear forced differential equations involving variable exponent
Three solutions for a class of quasilinear elliptic systems involving the p(x)-Laplace operator
The quest for canine leishmaniasis in Romania: the presence of an autochthonous focus with subclinical infections in an area where disease occurred
Săpăturile de informare de la Gostinu şi Ghizdaru (r. Giurgiu, reg. Bucureşti) / Les fouilles d’information de Gostinu et Ghizdaru
Berciu Dumitru, Rădulescu Gheorghe, Mihăilescu Gabriel, Ionescu M. Săpăturile de informare de la Gostinu şi Ghizdaru (r. Giurgiu, reg. Bucureşti) / Les fouilles d’information de Gostinu et Ghizdaru. In: Materiale şi cercetări arheologice, N°7 1961. pp. 291-296
- …