Question #21000

You are to implement a code cracking system. The system will deploy four processes (p1,p2,p3 & p4) to try to guess the password of an encrypted code.

For encryption, we consider that the formula is: C = P XOR K, where

• C = encrypted code

• P = plain text

• K = key

For decryption the formula is: P = C XOR K. So, your program will try to find K using this formula. The XOR operator is ^.

Given an encrypted code C and plain code P your program should deploy three processes to try and find the key used to encrypt the plain code. These three processes will be under the control of process P1.

All processes will send their results to process P1 and process P1 will terminate the three processes and display the encryption key and decrypted text once any of the three processes finds the key.

So we have P and C your program should find the key K. Consider that K is a positive number between 0 and 1000000. please can u solve in a fast time

For encryption, we consider that the formula is: C = P XOR K, where

• C = encrypted code

• P = plain text

• K = key

For decryption the formula is: P = C XOR K. So, your program will try to find K using this formula. The XOR operator is ^.

Given an encrypted code C and plain code P your program should deploy three processes to try and find the key used to encrypt the plain code. These three processes will be under the control of process P1.

All processes will send their results to process P1 and process P1 will terminate the three processes and display the encryption key and decrypted text once any of the three processes finds the key.

So we have P and C your program should find the key K. Consider that K is a positive number between 0 and 1000000. please can u solve in a fast time

Expert's answer

Unfortunately, your question requires a lot of work and cannot be done for free.

Submit it with all requirements as an assignment to our control panel and we'll assist you.

Submit it with all requirements as an assignment to our control panel and we'll assist you.

## Comments

## Leave a comment