Fermat's Little Theorem offers an elegant probabilistic shortcut for detecting prime numbers, but a strange class of ...

Abstract: 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 ∝ ...