In the RSA public-key encryption scheme, each user has a public key, e, and a private key, d. Suppose Bob leaks his private key. Rather than generating a new modulus, he decides to generate a new public and a new private key. Is this safe?

RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. Generate Public and private keys for the below given prime numbers: p = 13339 q = 13499 p = 98981, q = 98993 All the steps in generating the keys need to be shown clearly.

Suppose your RSA public key is PK: {n, e} = {13861, 37}. Your friend sends you a ciphertext C = 9908. But unfortunately you have forgotten your private key, now you have to crack it yourself.a) Write down a possible condition of factors p and q.p= q=b) What is your private key SK: {d}?d=c) What is the plaintext of your friend’s message?The plaintext M =d) Suppose the plaintext M is a 12-digit number consisting of a prefix “19” and 1234567890. What is the corresponding ciphertext? Since M is greater than n, you only need to encrypt four digits at a time. Ignore redundant zeros. e.g., 0001 = 1. The result should contain three integers.The ciphertext C0 =

Consider the following encryption scheme for a block cipher (using the notationfrequently used in class).y1 = ek(x1), y2 = ek(x1 ⊕ x2), y3 = ek(x1 ⊕ x2 ⊕ x3), etc.a. Describe the corresponding decryption scheme.b. Can encryption and/or decryption be run in parallel for this scheme?c. Taking into account that the operation of XOR is cheap, determinewhether or not this scheme improves on ECB mode or not

Solving this problem in the Java language

The Reflection algorithm can be used to encrypt a C-string (character array terminated with the null character) before it is transmitted over the Internet. The Reflection algorithm works as follows:  Each letter in the message is converted to the letter in that is 13 positions to the right of that letter in the English alphabet. If the end of the alphabet is reached, counting continues from the first letter in the alphabet. The case of the letters must be maintained. For example,'M' →'Z', 'x' → 'k', 'A' → 'N'The numeric characters ('0' to '9') are shifted 5 positions to the right of that number in the character set '0' to '9'. If ‘9’ is reached, counting continues from ‘0’. For example,'0' → '5', '2' →'7', '8' → '3' All other characters are left as they are. a) What would the following string be encrypted to by the Reflection algorithm?“Call me at 662-2002 Ext 85393”  b) Write a function, getPosition, which finds the position of a letter in the alphabet regardless of the case of the…

Now assume that the user used only 34 characters from the keyboard. What is the key length in bits in this case? Provide the correct answer for the fourth question. This is not a graded assignment.

Suppose the public parameters for an instance of the RSA cryptosystem are N = 6767 and e = 7. Encrypt the messagez = 6105. Encrypt the message z = 5329.

kindly do it ASAP Write a code to implement the combination of RSA and AES algorithms. In your implementation, first the RSA will be used to encrypt the secret key for sending from Alice to Bob. On the other hand, the AES will be used for encryption and decryption of long messages between the Alice and Bob. Remember in such type of combination, first the Bob will generate its public and private keys and share its public key with the Alice. The Alice encrypt the short message (secret key for communicating the long messages) using RSA and send it to the Bob. Then Bob decrypts the short message (secret key for communicating the long messages) using its private key and found the short message (secret key for communicating long messages). After that both Alice and Bob use this same secret key for the encryption and decryption of long messages.

Consider an RSA key set for Alice with p = 23, q = 17, n = 391 and e = 15.a)  Her public key is (e, n) = (15, 391). Is her private key (d, n) = (47, 391)? JusVfy your answer. b)  Suppose Bob wants to encrypt a message 90 for Alice using RSA keys for confidenVality. Whatis the corresponding cipher text?Justify your answer.