RSA with sequential and using MPI

This main goal for this project is to test the time complexity to encrypt and decrypt text file (UTF-16) using RSA algorithm sequentially and using multiprocessing with MPI. The project with be divide into two parts: 1. The sequential implementation • Input: i. The text file path ii. The key length in number of bits. iii. The output file path (optional) • Processing: i. Encrypt the text file and then decrypt it and save both plaintext and ciphertext to the output file or create new text file if no file path was provided. ii. Measure the time taken for both encryption and decryption. iii. Each method core method should have a time measure. • Output: i. Time complexity report. ii. Plaintext and ciphertext 2. The parallel Implementation • Input: i. The text file path ii. The key length in number of bits. iii. Number of processors N. iv. The output file path (optional) • Processing: i. Split the text file to N blocks; where N is the number of processors. ii. Sent each block to separated processor iii. Each processor will encrypt the block and sent it back. iv. The main processor gets all ciphertexts from all worker processors and put them in one text file and store it in the output file. v. The main processor will send the ciphertext block to another or the same process that encrypt it to be decrypted and sent it back again. vi. The main processor gets all decrypted blocks from all worker processors and put them in one text file and store it in the output file. vii. Measure the time taken for both encryption and decryption. viii. Each method core method should have a time measure. • Output: i. Time complexity report. ii. Plaintext and ciphertext Notes: • Plaintext could have any character. • Due date must be before 14th of October 2017. • The project cost is low, so it is not expected to build it from scratch. • The code quality is not important, it is fair to be readable with some comments only. • The code will be tested in UNIX environment. • Programming language must be C. • MPI tutorials here [login to view URL] • If you think that the cost is very low, just offer your best offer.