show that the encryption procedure C=P^e(mod n) and decryption procedure P=C^d(mod n) in RSA cryptosystem are identical when encryption is done using modular eponentiation with modulus n=35 and enciphering key e=5
show that the encryption procedure C=P^e(mod n) and decryption procedure P=C^d(mod n) in RSA cryptosystem are identical when encryption is done using modular eponentiation with modulus n=35 and enciphering key e=5
They will be identical as your encryption and decryption key are identical for the following reasons;
If e=5 and mod m= 35, then in order to get your decryption key you need to find
Since this key will be the same as the encryption key, encrypting and decrypting will use the same exponent, not very secure.