Question:
(a) Prove that every positive integer n can be factorized into a product of prime powers.
(b) State the Fermat-Euler theorem as needed in the RSA system.
(c) Using the Repeated Squaring Method, verify that with modulus 3127 and encipherment key 17 the number 0530 encipher to itself in the RSA system.
(d) Having received a message enciphered on the RSA system using his public key how can the owner of the decipherment key reply?
(e) Explain how RSA can be used for digital signatures.
(f) State the protocol based on quantum cryptography that can be used to exchange keys.