- - Implement the RSA algorithm (C/C++, Java, Python). The requirements are as follows: - Implement each component as a
Posted: Sun May 15, 2022 8:24 am
====RSA=====%%%
\example{\Example \textbf{Question1}} \begin{text}
\example Implement both encryption and decryption of RSA.
Encryption takes a txt file as input and output another txt file
containing ciphertext (use hexadecimal for easy readability).
\end{question}
- - Implement the RSA algorithm (C/C++, Java, Python). The requirements are as follows: - Implement each component as a separate function, such as key schedule, prime test, the extended Euclidean algorithm, binary modular exponentiation, and so on. - Implement both encryption and decryption of RSA. Encryption takes a txt file as input and output another txt file containing ciphertext (use hexadecimal for easy readability). Decryption should recover the plaintext. Your code should encrypt and decrypt standard keyboard characters, including letters, numbers, and symbols. The prime numbers p and q should be larger than 264. (you are allowed to use libraries to handle p large numbers, such as Biglnteger in Java) The strategy of source coding (converting characters to integers in RSA) is up to you. You can encrypt one or more characters at a time, but make sure the constraint m<n is satisfied. - Use the RSA.txt to test your code. -
\example{\Example \textbf{Question1}} \begin{text}
\example Implement both encryption and decryption of RSA.
Encryption takes a txt file as input and output another txt file
containing ciphertext (use hexadecimal for easy readability).
\end{question}
- - Implement the RSA algorithm (C/C++, Java, Python). The requirements are as follows: - Implement each component as a separate function, such as key schedule, prime test, the extended Euclidean algorithm, binary modular exponentiation, and so on. - Implement both encryption and decryption of RSA. Encryption takes a txt file as input and output another txt file containing ciphertext (use hexadecimal for easy readability). Decryption should recover the plaintext. Your code should encrypt and decrypt standard keyboard characters, including letters, numbers, and symbols. The prime numbers p and q should be larger than 264. (you are allowed to use libraries to handle p large numbers, such as Biglnteger in Java) The strategy of source coding (converting characters to integers in RSA) is up to you. You can encrypt one or more characters at a time, but make sure the constraint m<n is satisfied. - Use the RSA.txt to test your code. -