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

Alice and Bob use DES cryptographic Algorithm to generate the following ciphertext then send it to Bob: Pt Ct Alice DES Bob Key Ct= DC 2A 5F 2A B0 9A B7 68 Known that: Key Show how Bob can figure out what is the original plaintext that was sent by Alice = 133457799BBCDFF3 Note: you need to include all the details about your answer
Using public key cryptography, X adds a digital signature s to message M, encrypts <M, s>, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations? A) Encryption: X's private key followed by Y's private key; Decryption: X's public key followed by Y's public key B) Encryption: X's private key followed by Y's public key; Decryption: X's public key followed by Y's private key C) Encryption: X's public key followed by Y's private key; Decryption: Y's public key followed by X's private key D) Encryption: X's private key followed by Y's public key; Decryption: Y's private key followed by X's public key
Computer Science Assume we use transposition cipher to encrypt the data, and the original message is stored in a 8 by 5 matrix (8 rows and 5 columns). If the ciphertext is shown below, what is the original plaintext?WMHPSCATEEEUCELELTCTIASLOTMRNCA
how to do this; Given an RSA public and private key of (note that not all of the private key is given):N = 3065977e = 425d = 713237 Decrypt the following message that has been encrypted using the public key above: 1559791
Decode the number using the given private key. Decode the number M = 15 using the private key d = 53 and n = 77. Assume you are decoding the number using the RSA cryptosystem. Note: You can use the Modular Exponentiation calculator to help with the calculation. a 63 (mod 77), decoded number = 63 b 64 (mod 77), decoded number = 64 C 65 (mod 77), decoded number = 65 d. 66 (mod 77), decoded number = 66
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 =
Suppose my public key is (n, e) = (91, 11) and I receive from you a ciphertext message 53. What is the actual message? (Note: You must use successive squaring to receive full credit. No credit will be given otherwise.)
9:05 Part 2: Encryption Details: description Objective: Develop a program that encrypts a plaintext file by XORing 128-bit blocks of the file with a key repeatedly until the entire file is encrypted. • The plaintext file will be a book from Project Gutenberg. Note: Done • The encryption method should use the XOR operation on the file, 128 bits at a time, with the key. • Each 128-bit block is XORed with the same key. • The program should work from the command line and accept three parameters: o The name of the key file Usage: o The name of the plaintext file o The desired name of the resulting ciphertext file This encryption method is not supposed to be secure. ( $ ./bad_streamcipher_enc kf pt ct
Decode the number using the given private key. Decode the number M = 15 using the private key d = 53 and n= 77. Assume you are decoding the number using the RSA cryptosystem. Note: You can use the Modular Exponentiation calculator to help with the calculation.
Question # 4: Use the multiplicative method to decrypt the following ciphertext.MADWU Key = 5You must show all the steps of your work WRITE A mathematical solution NOT A COMPUTER PROGRAM
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 =
Decrypt Encryption and decryption are mathematical inverses using the Caesar/Rail Fence Cipher Hint: This a split key - one part of the key is used for the Caesar and the other part of the key is used for the Rail Fence. The full key (Caesar and Rail Fence], in hexidecimal, is: 0x7F.