RSA in Cryptography (Assignment 3 Part 1)

What does RSA stand for in cryptography?

• Rivest-Smith-Adleman

• Roberts-Shamir-Adleman

• Rivest-Shamir-Alderman

• Rivest-Shamir-Adleman

Explain the basic principle of RSA encryption.

• RSA encryption uses prime factorization to secure data through a pair of keys: a public key for encryption and a private key for decryption.

• RSA encryption is based on the use of hash functions to secure data.

• RSA encryption uses a single key for both encryption and decryption.

• RSA encryption relies on symmetric key algorithms for security.

What are the key components needed to generate RSA keys?

• Public key only

• A single random number

• Two large prime numbers, modulus, public exponent, private exponent

• One small prime number

How is the public key in RSA generated?

• The public key in RSA is generated as the pair (e, n) where n = p * q and e is a chosen exponent coprime to (p-1)(q-1).

• The public key is derived from the product of p and q without any exponent.

• The public key is generated using only the value of p.

• The public key consists of the values (d, n) where d is the private exponent.

What is the role of the private key in RSA?

• The private key is used for encrypting messages.

• The private key is used for signing messages.

• The private key in RSA is used for decrypting messages.

• The private key is used to generate public keys.

Provide an example of how to encrypt a message using RSA.

• For example, if n = 55, e = 17, and the message m = 42, then c = 42^17 mod 55 = 8.

• Using n = 77, e = 13, and m = 30, c = 30^13 mod 77 = 50.

• To encrypt, simply reverse the message and add 3 to each character.

• If n = 45, e = 5, and m = 10, then c = 10^5 mod 45 = 25.

What is the mathematical basis for RSA's security?

• The difficulty of factoring large prime numbers.

• The speed of data encryption algorithms.

• The ease of multiplying small numbers.

• The simplicity of addition and subtraction.

How does RSA ensure confidentiality of messages?

• RSA uses symmetric keys for encryption.

• RSA relies on hashing for message integrity.

• RSA encrypts messages with the sender's private key.

• RSA ensures confidentiality by encrypting messages with the recipient's public key.

What is the significance of the modulus in RSA?

• The modulus in RSA is significant as it secures the encryption and decryption processes and defines the key space.

• The modulus is used to generate random keys in RSA.

• The modulus is irrelevant to the security of RSA.

• The modulus determines the speed of encryption in RSA.

Explain the process of decrypting a message in RSA.

• The plaintext is obtained by reversing the encryption algorithm.

• Decrypting a message requires the sender's public key.

• The process of encrypting a message using the public key.

• The process of decrypting a message in RSA involves using the private key to compute the plaintext from the ciphertext.