Using Distributed Computing to Find Large Prime Numbers
Dr. Robert Adams, firstname.lastname@example.org
Large prime numbers, useful in number theory and encryption, require large amounts of computational time to find. This project aims to break up the task of finding them by using distributed computing as well as optimized algorithms. This presentation will cover the techniques used, issues involved including security, verification and performance.
Alec, Alec Dhuse, "Using Distributed Computing to Find Large Prime Numbers" (2008). Technical Library. Paper 29.
This document is currently not available here.