Parallel Hill Cipher Decryption with MPI in C++

This C++ program demonstrates parallel decryption of a Hill cipher, a polygraphic substitution cipher based on linear algebra, using the Message Passing Interface (MPI) for distributed computing. The code is designed to run concurrently on multiple processes, with each process handling a portion of the ciphertext. It utilizes a user-defined 2x2 matrix and a modular inverse function for decryption. The program showcases how to effectively distribute the decryption workload among different MPI processes, each decrypting its segment of the text. Finally, it collects and displays the decrypted result. This implementation serves as an example of distributed cryptography and showcases the capabilities of MPI in parallel computing for cryptographic applications.

Overview of Parallel Hill Cipher Decryption with MPI in C++

This C++ program exemplifies parallel decryption of a Hill cipher using the Message Passing Interface (MPI) to distribute the workload across multiple processes. If you're seeking help with your C++ assignment or are interested in cryptographic parallel computing, this code is a valuable resource. It employs a 2x2 matrix and a modular inverse function to decrypt a ciphertext. By leveraging MPI, each process handles its ciphertext portion, showcasing efficient parallel decryption. This implementation is a prime example of distributed cryptography, highlighting the potential of MPI for cryptographic applications and offering assistance for your C++ assignment in parallel computing and cryptography.

Block 1. Header Includes:

#include < iostream > #include < fstream > #include < cstdlib > #include < cmath > #include < mpi.h > #include

• Discussion: Importing necessary C++ libraries, including MPI for parallel computing and string for handling string data types.

Block 2. Modular Inverse Function:

int mod_inverse(int a, int m) { a = a % m; for (int x = 1; x < m; x++) { if ((a * x) % m == 1) { return x; } } return -1; }

• Discussion: Defines a function to calculate the modular inverse of a number a modulo m. This function is crucial for the decryption process as it involves finding the modular inverse of the determinant of the encryption matrix.

Block 3. Decryption Function:

void decrypt_hill_cipher(string& ciphertext, int* matrix, int n, int rank, int size) { // Decrypts a Hill Cipher in parallel using MPI // ... }

• Discussion: The main decryption function. It calculates the determinant of the encryption matrix, finds its modular inverse, and then calculates the adjugate matrix. The decryption is then performed on blocks of the ciphertext in parallel, with each MPI process handling a portion of the data.

Main Function

int main(int argc, char *argv[]) { // MPI initialization and setup // Setting up the encryption matrix and ciphertext // Calling the decryption function // ... }

• Discussion: The main function initializes MPI, retrieves the process rank and size, sets up the encryption matrix and ciphertext, calls the decryption function in parallel, and prints the decrypted result from the process with rank 0.

MPI Initialization and Finalization:

MPI_Init(&argc, &argv); MPI_Comm_rank(MPI_COMM_WORLD, &rank); MPI_Comm_size(MPI_COMM_WORLD, &size);

• Discussion: These lines initialize and finalize the MPI environment, retrieving the process rank and size. This is necessary for MPI parallelization.

Matrix and Ciphertext Setup

int matrix[4] = {3, 6, 4, 5}; int n = 2; string ciphertext = "Dfanoryhmduy";

• Discussion: Initializes the 2x2 encryption matrix and the ciphertext that needs to be decrypted.

Decryption Function Invocation

decrypt_hill_cipher(ciphertext, matrix, n, rank, size);

• Discussion: Calls the decryption function, distributing the decryption workload among MPI processes.

Result Printing:

if (rank == 0) { cout << ciphertext << endl; }

• Discussion: Prints the decrypted ciphertext only from the process with rank 0, avoiding duplicated output in MPI parallel execution.

Conclusion

In conclusion, the parallel Hill cipher decryption program using MPI in C++ serves as a powerful illustration of distributed cryptographic computing. It not only demonstrates the practicality of breaking down complex cryptographic tasks into parallelized subproblems but also showcases the remarkable capabilities of MPI in achieving this efficiently. Whether you're a student seeking assistance with your C++ assignment, a developer exploring parallel computing, or a cryptography enthusiast, this code offers valuable insights. Its clear structure, use of modular arithmetic, and distributed approach make it an educational resource. The implementation underlines the significance of cryptography and parallel computing in real-world applications, making it a compelling example in the realm of computer science and security.