Generating Primes Using Partitions
Cryptography and Security
2015-05-04 v1
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.
Cite
@article{arxiv.1505.00253,
title = {Generating Primes Using Partitions},
author = {Ganesh Reddy Pittu},
journal= {arXiv preprint arXiv:1505.00253},
year = {2015}
}
Comments
9 pages, 7 figures