Use the two prime numbers p = 5 and q =13 in the first step to give ONE integrated example to show how the five steps in the basic process of RSA Cryptography works. Based on your example, demonstrate how the number 60 as an original message is encrypted into ciphertext and decrypted back correctly to the original message. If you need to choose a number in any step, you must choose it from the set {x e R: 8 < x < 12}. You must show all detailed steps involved.

Use the two prime numbers p = 5 and q =13 in the first step to give ONE integrated example to show how the five steps in the basic process of RSA Cryptography works. Based on your example, demonstrate how the number 60 as an original message is encrypted into ciphertext and decrypted back correctly to the original message. If you need to choose a number in any step, you must choose it from the set {x e R: 8 < x < 12}. You must show all detailed steps involved.

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

In a special case of a permutation cipher, we take a message, M, and write its letters in an s× t table, in a row-major fashion, and then let the ciphertext be a column-major listing of the entries in the table. For example, to encrypt the message ATTACKATDAWN, using a 3 × 4 table, we would write the message as ATTA CKAT DAWN and then write down the ciphertext as ACDTKATAWATN. The secret key in this cryptosystem is the pair (s, t). How is decryption done in this cryptosystem? Also, how hard would it be to attack this cryptosystem using a ciphertext-only attack?
The problem at the center of RSA is finding the e’th root of the ciphertext c modulo N where N = pq is a product of (distinct) primes. This is hard to do for large N if you don’t know the factors p and q, but once you know p and q it becomes easy! Write a finction findRoot(c,e,p,q) which solves the equation xe ≡ c mod N for x where N = pq
Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Consider the LFSR represented by the polynomial x4+x2+1x4+x2+1. What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p5=0,p4=1,p3=0,p2=1,p1=0,p0=1p5=0,p4=1,p3=0,p2=1,p1=0,p0=1).
Problem #1Given below is a well-known cryptosystem called affine Caesar cipher, as well as someciphertext generated using the affine Caesar cipher.P = C = Z 26 = {0, 1, 2, ..., 25};K = {(a, b) Z26 Z26 | gcd(a, 26) = 1}y = E([a,b], x) = (ax + b) mod 26,x = D([a,b], y) = a-1 (y – b) mod 26,where x P, y C. Ciphertext sample:VPWOMFUWOFMYMHUNWBBWGCRVVPSFVPUTHUJWMCOMFUOVSVWOVWGSRSFSREOWOQMHKOBMHVPWOUFGHETVWMFOEOVUYVMMZCVGSFEMCCOUEMCHKFMQRUNIUMBRWFUSHSRIUZHSVMBWFNVPUOUGHUVKUEVMMVPUFEMCQWRRPSJUVHCREGHSGKUNVPUOEOVUY For this problem, please do the following:(a) provide an analysis detailing its strength/weakness;(b) attempt to uncover the plaintext associated with the ciphertext;(c) attempt to determine the secret key (a, b) used.
Consider a large institution that has 16891 employees. How many keys are necessary to allow any pair of employees to securely communicate using a symmetric cipher? Suppose that we instead use an asymmetric cryptographic scheme. How many keys are required in this case?
Let Π = (Gen,Enc,Dec) be a private-key encryption scheme that has indistinguishable en- cryptions in the presence of an eavesdropper. Which of the following encryption schemes are also necessarily secure against an eavesdropper? If you think a scheme is secure, sketch a proof, if not, provide a counterexample. Here, for a bit string s, parity(s) is 1 if the number of 1’s in s is odd, and 0 otherwise. The || symbol stands for concatenation. So, for strings if x = 00 and y = 11, x||y = 0011. (a) Enc1k(m) = 0||Enck(m)(b) Enc2k(m) = Enck(m)||parity(m) (c) Enc3k(m) = Enck(m)||Enck(m)(d) Enc4k(m) = Enck(m)||Enck(m + 1). Here think of m as an integer. Please type answer note write by hend.
In an RSA cryptosystem, you intercept a ciphertext C = 2022 sent to a user whose public key is (e = 27893, n = 124711). What is the plaintext M? Show your steps.
How would you solve part a and b? This is an applied cryptography type question. a. Suppose ' = 2, so r can be from the set {0,1,2,3}. Assume you, the eavesdropper, gets the sequence: 145471,25245,14596,143468,153125 encrypted via the padded RSA scheme using (N,e) = (157439,5). Without decrypting, find the sequence of votes. b. Suppose now that ' = 100, so r can be from the set {0,1}100. What is the time complexity of your attack from part (a)? Is it feasible? If you were an employee, would you recommend this scheme to the CEO?
The notation from this problem is from Understanding Cryptography by Paar and Pelzl. We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is m=4m=4.The plaintext given by 01001011=x0x1x2x3x4x5x6x701001011=x0x1x2x3x4x5x6x7 when encrypted by the LFSR produced the ciphertext 11010110=y0y1y2y3y3y5y6y711010110=y0y1y2y3y3y5y6y7. What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 0101 to represent p3=0,p2=1,p1=0,p0=1p3=0,p2=1,p1=0,p0=1).
A ciphertext has been generated with an affine cipher. The most frequent letter of the ciphertext is “F”, and the second most frequent letter of the ciphertext is “C”. Break this code by figuring out the key numbers. Hint: Based on the letter frequency, E is the most frequent letter and T is the second most frequent letter. Therefore, F should be the ciphertext of E and C should be the ciphertext of T.
In a substitution cipher, we “encrypt” (i.e., conceal in a reversible way) a message by replacing every letter with another letter. To do so, we use a key: in this case, a mapping of each of the letters of the alphabet to the letter it should correspond to when we encrypt it. To “decrypt” the message, the receiver of the message would need to know the key, so that they can reverse the process: translating the encrypt text (generally called ciphertext) back into the original message (generally called plaintext). A key, for example, might be the string NQXPOMAFTRHLZGECYJIUWSKDVB. This 26-character key means that A (the first letter of the alphabet) should be converted into N (the first character of the key), B (the second letter of the alphabet) should be converted into Q (the second character of the key), and so forth. A message like HELLO, then, would be encrypted as FOLLE, replacing each of the letters according to the mapping determined by the key. Let’s write a program called hw6.py…
In block ciphers, if we use AES for encryption, it does not matter whether the cipher is CBC-based or ECB-based (both will have equally strong results). true or false