4 Task Four. Implementing Ring Signature of 2 users (2 marks) In this task, you are to implement a ring signature for 2 users, as described in the lecture notes. The input files are the following: publickey.txt message.txt The file publickey.txt has four lines, which indicates: 41, N1, C2, N2 from RSA algorithm. The mes- sage.txt contains a string of characters, which needs to be signed. You need to implement two programs: sign and verify. The sign program will sign the message (from message.txt) and read the public keys from publickey.txt. It will ask for one input, which is user 1 or user 2, who is the signer, and the program will ask for that user's private key. Then, the sign program will output signature.txt. The verify program will take an input of publickey.txt, message.txt and signature.txt and it will output True or False to show the verification of the ring signature. The symmetric encryption should use the AES algorithm. You can import the AES algorithm from the existing library or use any implementation of AES algorithm (with 10 rounds) to do this. 4 Task Four. Implementing Ring Signature of 2 users (2 marks) In this task, you are to implement a ring signature for 2 users, as described in the lecture notes. The input files are the following: publickey.txt message.txt The file publickey.txt has four lines, which indicates: 41, N1, C2, N2 from RSA algorithm. The mes- sage.txt contains a string of characters, which needs to be signed. You need to implement two programs: sign and verify. The sign program will sign the message (from message.txt) and read the public keys from publickey.txt. It will ask for one input, which is user 1 or user 2, who is the signer, and the program will ask for that user's private key. Then, the sign program will output signature.txt. The verify program will take an input of publickey.txt, message.txt and signature.txt and it will output True or False to show the verification of the ring signature. The symmetric encryption should use the AES algorithm. You can import the AES algorithm from the existing library or use any implementation of AES algorithm (with 10 rounds) to do this