1 / 7

CMPT-585 Project Presentation Ayesha Mohiuddin Ramazan Burus

CMPT-585 Project Presentation Ayesha Mohiuddin Ramazan Burus. Generating Prime Numbers using Grid Computing. Prime Numbers. Used in cryptographic algorithms: e.g. RSA algorithm, PKE, PKI, Diffie-Helman key exchange

william-doyle
Download Presentation

CMPT-585 Project Presentation Ayesha Mohiuddin Ramazan Burus

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CMPT-585 Project PresentationAyesha Mohiuddin Ramazan Burus Generating Prime Numbers using Grid Computing

  2. Prime Numbers • Used in cryptographic algorithms: e.g. RSA algorithm, PKE, PKI, Diffie-Helman key exchange • GIMPS; Great Internet Mersenne Prime Search:A Mersenne prime is a prime of the form 2P-1. • On May 15, 2004, Josh Findley discovered the 41st known Mersenne Prime, 224,036,583-1. The number is nearly 7 million digits large. Josh's calculation took just over two weeks on his 2.4 GHz Pentium 4 computer.

  3. Project Details: • Programming language used: JAVA • Database: ORACLE • Object: Having a grid of multiple clients calculate prime numbers between unique ranges of numbers, to obtain a large list of prime numbers.

  4. Client 1 Master Client 2 Client 3 Oracle Database Grid Architecture Grid Structure

  5. 3 Components: • Client • Allotted a unique Id and time limit • Gets the range of numbers to calculate • Master • Keeps monitoring the activity • Re-assigns range to another client if original client does not complete within its allotted time(1 day: for our experiment) • Database • Stores the client information and the resulted Prime numbers sent by the clients

  6. 0 227 Number Ranges As Numbers keep increasing; Prime numbers keep decreasing.

  7. Conclusion • Executable: 1.29 MB • Memory usage: 10 MB • CPU usage: 7 to 10 • Total primes generated by now : 376074 • Largest Prime found by now: 6583813 • Useful Links: http://www.mersenne.org http://www.eskimo.com/~weidai/algorithms.html http://livinginternet.com/i/is_crypt_pkc_work.htm

More Related