The roughly 8 billion people in the world want to each randomly choose two N-digit primes to use for RSA communication. How big should N be to make this (likely) secure against a gcd attack, so that none share a prime? Explain.

The roughly 8 billion people in the world want to each randomly choose two N-digit primes to use for RSA communication. How big should N be to make this (likely) secure against a gcd attack, so that none share a prime? Explain.

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

N blocks of plaintext (P1 to PN) are being encrypted in CFB mode into ciphertext (C1 to CN). Assume that two bits of C3 are erroneous (their binary values have flipped). What bits of C3, C4, and C20 are erroneous?
A summary of RSA algorithm is described on W10 Notes. Assume that the algorithm is used with p= 11,q=3 and e = 3. 1. Compute n, d, and the decryption key, d 2. Suppose that we wanted to use this system to send a message secretly by letting A = 2, B3,C4,...,Z 27, a - 28, b= 29,... and interleave/scramble the words in the message for extra added security purposes. Compute the plaintext message if the received ciphertext is BQRRCDIHICHM
Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Consider the LFSR represented by the polynomial x^4+x^3+x^2+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=1).
Encryption with writing steps
ONLY THE TAP BITS. 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).
Alice and Bob decided to perform a secure communicate using symmetric crypto system. They decided to use Data Encryption Standard (DES), but they understand the key size of 56-bit for DES is too-short. Alice and Bob decided to do the encryption/decryption three times using three different DES keys to increase the overall key size for the encryption/decryption operations. Explain how Alice and Bob can increase the effective key size of the operation to 168-bit using three different keys?
Can the whole exchange (connection + data) be encrypted? For what purpose? Give an example when any and all forms of encryption would be beneficial.
Suppose a message is 13500 bits long. If it is to be encrypted using a block cipher of 128 bits, find both the size of the padding and the number of blocks needed. Show your work
The substitution tables in a Feistel network may be irreversible. 1. True/False. Justify your answer. 2. How can the encryption/decryption operation work if the tables are irreversible? (Justify the answer clearly) ***THIS IS NOT THE ANSWER BELOW. PLEASE DO NOT COPY AND PASTE THE WRONG ANSWER*** Ans : a) GCD of 2938 and 183 using Eucledian algorithm 2938=183⋅16+10 183=10⋅18+3 10=3⋅3+1 3=1⋅3+0 Hence GCD(2938,183)=1 b)a) GCD of 93182 and 246 using Eucledian algorithm 93182=246⋅378+194 246=194⋅1+52 194=52⋅3+38 52=38⋅1+14 38=14⋅2+10 14=10⋅1+4 10=4⋅2+2 4=2⋅2+0 GCD(93182,246)=2 -> a inverse b exist in case of first option because there GCD(2938,183)=1 it will be 55≡2938−1(mod183) 55≡2938−1(mod183) 55×2938≡1(mod183) Hence 55 is the inverse
Alice and Bob are using the ElGamal cipher with the parameters p = 199 and a = 3. Their parameters are small and we decide to crack the cipher. Suppose Alice is observed sending public ephemeral key k = 103 and Bob sends public key = 136. ß Alice is observed transmitting the ciphertext y = 68. a) What is the masking key km? b) What is the plaintext?
Consider the case of Alice sending a message, m, to Bob. Both Alice and Bob use public key cryptography and each has a public and private key as described in the text. The figure attached below shows the operations that Alice must perform to provide confidentiality, authentication, and integrity when sending a message to Bob over the network. We can use either symmetric key or public key cryptography to encrypt a message. For our purposes, either technique will encrypt the message, and applying both doesn't make it "more secure". Also, we can assume that the session key would remain a secret so the fact that it is discarded does not make it "more secure". Why do we use a session key, Ks, instead of relying only on public key Cryptography? In other words, why do we use both public key and symmetric key cryptography?
Suppose a public-key cryptosystem encrypts integers (say, modulo another integer n). Show that if this scheme has the property that Dec(Enc(x) · Enc(y)) = x + y for any messages x, y, then the scheme is necessarily vulnerable to a CCA2 attack.