Reference no: EM133955689
Assignment:
A symmetric key cipher has a single key and the dc. How many keys are used in a public-key cipher?
A symmetric key cipher has a single key and the decrypting function is the inverse of the encrypting function. Contrast the public-key encryption and decryption functions.
What key is used to encrypt for the confidentiality use case?
What key is used to encrypt in the authentication use case?
Why can't I encrypt or decrypt something with your private key?
What does the confidentiality use case protect?
What does the authentication use case verify?
Who sends the ciphertext in the confidentiality use case?
Who sends the ciphertext in the authentication use case?
Why is getting your public key still a problem (hard)?
What is the "e" exponent?
What is the "d" exponent?
What is the modulus?
What hard mathematical problem makes RSA public-key cryptography safe and secure?
What is the minimum modulus (key) size that one should currently use?
Why must the modulus n be included with any RSA public or private key?
DO ON PAPER (show work): What is the Totient of 9, e.g. phi(9)?
DO ON PAPER:
- the public exponent e is 17
- the private exponent d is 173
- the modulus n is 77
- the original plaintext was encrypted with the public key and the produced ciphertext was 1
- what is the plaintext?
DO USING the Linux command dc AND SHOW/CAPTURE THE COMMANDS YOU USE AND THE OUTPUTS:
- the public exponent e is 65537
- the private exponent d is 159088207719681
- the modulus n is 247893796661869
- the original plaintext was encrypted with the private key and the produced ciphertext was 190786795874702
- what is the plaintext?
When was the RSA algorithm actually invented?