Task 1: Explain how prime numbers are important by evaluating an example based on the RSA algorithm. A) Generate a public/private key pair: Assuming the two primes chosen to generate the keys as the following p=13 q=the nearest prime number to your last two digits of your university ID You should choose a value e > 5. Encrypt a message M=12 then decrypt the ciphertext to retrieve the original message. B) Repeat your work in A and B without using prime numbers to generate the keys and compare your results. You should show all your calculations and assumptions.

Task 1: Explain how prime numbers are important by evaluating an example based on the RSA algorithm. A) Generate a public/private key pair: Assuming the two primes chosen to generate the keys as the following p=13 q=the nearest prime number to your last two digits of your university ID You should choose a value e > 5. Encrypt a message M=12 then decrypt the ciphertext to retrieve the original message. B) Repeat your work in A and B without using prime numbers to generate the keys and compare your results. You should show all your calculations and assumptions.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Given the plaintext “I LOVE CRYPTO”, what is the ciphertext given that: Row Transposition Cipher algorithm with the key is 3214.
Find the ciphertext using DES if the shared key is "SECURITY" and the output of round 15 is "IT? 7b/".
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 =
Dexter wants to set up his own public keys. He chooses p = 23 and q = 37 with e = 7. Answer the following using RSA cryptographic method: a) Encrypt the message ‘100’ and find the CIPHER number (C) to be sent. [5] C = Me mod pq b) Find the decryption key ‘d’. c) Now decrypt the message ‘10’ (this is the CIPHER message received). M = Cd mod pq.
Suppose you intercepted the following encrypted message: 20 5 21 3 49 4 49 3 4 15 You also know the encryption key is d=7 and it was determined using n=55. Decrypt this message. Assume that letters 'A' through 'Z' were initially coded using 1 through 26 and a blank was initially coded using 27. no hand wriiten
1. Asymmetric Encryption and Message Authentication: a) The primitive root of a prime number is the basic principle of Diffie-Hellman. i) Is 3 the primitive root of 11? Show the proof with your calculation. ii) What are the important criteria for selecting a prime number in cryptography? Is 11 a good choice for such a purpose? b) Find the parameters stated using the Diffie-Hellman methods, given the user A and B shared a prime number and its primitive root of 23 and 5, respectively. i) If user A public key value is 8, find the A’s private key. ii) If user B public key value is 19, what is the common secret key? c) In the following scenario, we will compare the security services that are given by digital signatures (DS) and message authentication codes (MAC). We assume that James can read all messages send from Chan to Badrul and the other way around, too. James has no knowledge of any keys but the public one in the case of DS. State whether and…
Assume Alice and Bob both have public and private keys in a public key setting. If Alice wants to send Bob a signed message, Alice first hashes her message and the hash using _'s key. decrypts/ Alice/ private encrypts/Alice/private decrypts/ Bob/ private encrypts/ Bob/public
Assume the cryptanalist has two pairs (x, y1) and (, y2) such that yl = DES(K, x) and y2 = DES(K,¤). Build a exhaustive key search which requires only 255 encryption to find out K. (This would be a slight improvement over the total number of 256 keys).
[Estimate time to solve this question is 5 minutes] Вов ALICE Yes Message (m) Hash Function MD Alice public-key Alice private-key Hash Same? Function MD Public-key Decryption Public-key Encryption MD E( Private-Keyalice MD) + message It is very handy and practical to use the digital signature scheme that is shown in the scenario above as part of the network security protocol suits. But it has two very specific weaknesses that can be solved using the MAC scheme. Explain these 2 weaknesses that can be solved using the MAC scheme.
"The RSA Algorithm" as a model, apply the RSA algorithm using the following values: p = 3, q= 11, e = 7, and m = 5. Select an appropriate value for d and determine the corresponding ciphertext value c. Decrypt the ciphertext message to verify that the value for c is correct. Show your work. Edit View Insert Format Tools Table 12pt v Paragraph BIU A 1 pts هم 27 27
Q) Encrypt the message " MEET ME IN NET LAB " using Ceaser Cipher method and Key = 7. Verify the Encrypted Message after Decryption using the same key.
I need help with the following problems in cryptography. A. Encrypt the message “Freedom” using the Playfair matrix M F H I K U N O P Q Z V W X Y E L A R G D S T B C T B. Construct the Playfair matrix with the keyword “LARGEST” and encrypt the message “Freedom” again. C. Compare the results obtained in A and B. How do you account for these results?