CRMay 1, 2015
Generating Primes Using Partitions
arXiv:1505.00253v13 citations
Originality Synthesis-oriented
AI Analysis
This is an incremental improvement in prime number generation, potentially useful for cryptography and number theory applications.
The paper tackles the problem of generating large prime numbers by using Goldbach partitions to produce candidate primes from a smaller prime, which are then tested with Miller-Rabin or AKS primality tests.
This paper presents a new technique of generating large prime numbers using a smaller one by employing Goldbach partitions. Experiments are presented showing how this method produces candidate prime numbers that are subsequently tested using either Miller Rabin or AKS primality tests.