Assignment 4 - Due Date Nov. 17 - Grade Value 12 points
The base code can be found in the Data Conversion , RSA Code, and Factoring tabs of Encryption :
- (4 pts.) Incorport Data Conversion into RSA Code so that the RSA implementation encodes and then decodes an ASCII string like "Smith", given an e probe
The command line should look like rsa_mye <the eprobe> <the string>
- (8 pts.) Using openMP or MIP, improve the "RSA Attack" in Factoring. The goal is to use parallel processing to significantly improve
the run time of the last experiment on the page, which is now runs over 106 seconds.
Notes
- Part 2 should be run from a SLURM script.
- Chunking is a concern. Division is a cycle consuming operation. The size the divisor and dividend is an issue. Your Chunking algorithm
should consider this.
- There needs to be some inter-task/thread communication. When one finds a factor, the computation is done.
A Solution
A Non-Blocking Communications Solution