2017/09/25 by Gavriel Yarmish, Yarmish, Gavriel, Joshua Yarmish +3
Computer Science · #Chaos-based Image/Signal Encryption #Computability, Logic, AI Algorithms #Cryptography and Residue Arithmetic #FOS: Mathematics #General Mathematics (math.GM)
paper · pdf · doi:10.48550/arxiv.1709.09963
openalex publication_date 2017/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we present and expand upon procedures for obtaining large d digit prime number to an arbitrary probability. We use a layered approach. The first step is to limit the pool of random number to exclude numbers that are obviously composite. We first remove any number ending in 1,3,7 or 9. We then exclude numbers whose digital root is not 3, 6, or 9. This sharply reduces the probability of the random number being composite. We then use the Prime Number Theorem to find the probability that the selected number n is prime and use primality tests to increase the probability to an arbitrarily high degree that n is prime. We apply primality tests including Euler's test based on Fermat Little theorem and the Miller-Rabin test. We computed these conditional probabilities and implemented it using the GNU GMP library.