Title

Using Distributed Computing to Find Large Prime Numbers

Document Type

Project

Advisors

Dr. Robert Adams, adams@cis.gvsu.edu

Abstract

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.

This document is currently not available here.

Share

COinS