Generating Primes Using Partitions

2015/05/01 by Ganesh Reddy Pittu, Pittu, Ganesh Reddy
Mathematics · #Analytic Number Theory Research #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #History and Theory of Mathematics #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.1505.00253

openalex publication_date 2015/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Citations

• New directions in cryptography
• A Survey of P2P Network Security

Related

• Dealing with prime numbers I.: On the Goldbach conjecture
• On Partitions of Goldbach's Conjecture
• Finding Large Primes
• Predicting the size ranking of minimal primes in the generalised Goldbach partitions
• Sifting Function Partition for the Goldbach Problem