**3.9** A **decryption exponent** for an RSA public key \((N, e)\) is an integer \(d\) with the property that \(a^{de} \equiv a \ (\text{mod} \ N)\) for all integers \(a\) that are relatively prime to \(N\).**(a)** Suppose that Eve has a magic box that creates decryption exponents for \((N, e)\) for a fixed modulus \(N\) and for a large number of different encryption exponents \(e\). Explain how Eve can use her magic box to try to factor \(N\).**(b)** Let \(N = 38749709\). Eve’s magic box tells her that the encryption exponent \(e = 10988423\) has decryption exponent \(d = 16784693\) and that the encryption exponent \(e = 25910155\) has decryption exponent \(d = 11514115\). Use this information to factor \(N\).**(c)** Let \(N = 225022969\). Eve’s magic box tells her the following three encryption/decryption pairs for \(N\):\[(70583995, 4911157), \quad (173111957, 7346999), \quad (180311381, 29597249).\]Use this information to factor \(N\).**(d)** Let \(N = 1291233941\). Eve’s magic box tells her the following three encryption/decryption pairs for \(N\):\[(1103927639, 76923209), \quad (1022313977, 106791263), \quad (387632407, 7764043).\]Use this information to factor \(N\).---### Explanation of Diagrams/GraphsThis section contains mathematical exercises related to encryption, specifically involving RSA encryption. Each part provides a scenario where Eve has access to certain encryption and decryption pairs or exponents, allowing her to potentially factor a large modulus \(N\). These exercises are used to illustrate the relationship between public keys, encryption exponents, and decryption exponents in RSA encryption. The given examples and pairs are purely numerical and do not involve visual diagrams or graphs.

RSA (Rivest-Shamir-Adleman) is a widely used asymmetric cryptographic algorithm that provides secure…

3.9. A decryption exponent for an RSA public key (N, e) is an integer d with the property that ade = a (mod N) for all integers a that are relatively prime to N. (a) Suppose that Eve has a magic box that creates decryption exponents for (N, e) for a fixed modulus N and for a large number of different encryption expo- nents e. Explain how Eve can use her magic box to try to factor N. (b) Let N = 38749709. Eve's magic box tells her that the encryption exponent e = 10988423 has decryption exponent d = 16784693 and that the encryp- tion exponent e = 25910155 has decryption exponent d = 11514115. Use this information to factor N. 178 Exercises (c) Let N = 225022969. Eve's magic box tells her the following three encryp- tion/decryption pairs for N: (70583995, 4911157), (173111957, 7346999), (180311381, 29597249). Use this information to factor N.

3.9. A decryption exponent for an RSA public key (N, e) is an integer d with the property that ade = a (mod N) for all integers a that are relatively prime to N. (a) Suppose that Eve has a magic box that creates decryption exponents for (N, e) for a fixed modulus N and for a large number of different encryption expo- nents e. Explain how Eve can use her magic box to try to factor N. (b) Let N = 38749709. Eve's magic box tells her that the encryption exponent e = 10988423 has decryption exponent d = 16784693 and that the encryp- tion exponent e = 25910155 has decryption exponent d = 11514115. Use this information to factor N. 178 Exercises (c) Let N = 225022969. Eve's magic box tells her the following three encryp- tion/decryption pairs for N: (70583995, 4911157), (173111957, 7346999), (180311381, 29597249). Use this information to factor N.

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

Question 15 For Questions 15.1 - 15.2 consider the following integers: In a RSA cryptosystem with public- key (3233, 59), compute: 15.1 the private-key and give you final answer as an ordered pair (n, d).
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?
4. Encryption is used to secure data messages in computer networks. One possible way of encrypting text consists of rewriting the text by including first the characters found at even indexes (starting from 0) followed by the characters stored at odd indexes, while ignoring whitespace characters. For instance, the String "Exam is fun" can be encoded using the previously explained technique as "Easfnxmiu". To be able to recover the original message based on the encrypted version of the message, some additional information should be added to the encrypted message, namely, the number of characters found at even indexes, the number of characters found at odd indexes, and the indexes at which the white space characters existed in the original message. In this way, reconsidering our previous example, the string "Exam is fun" can be encoded using the previously explained technique as "5 4 4 7 Easfnxmiu". This is particularly true since the original message had 5 characters at even indexes…
Answer please fast.
Question 4. A sealed-bid auction is a process where a number of partiescalled bidders submit sealed bids for buying some item. Once all sealed bidshave been submitted, the bids are revealed and the highest bidder is the onethat buys the item.Suppose that the following cryptographic primitives are available:• A fully secure public-key encryption scheme (e.g., RSA-OAEP) thatconsists of the key-generation algorithm PKE.Gen, the encryption algorithm Enc, and the decryption algorithm Dec.• An existentially unforgeable digital signature scheme (e.g., RSA-FDH)that consists of the key-generation algorithm DS.Gen, the signing algorithm Sign, and the verification algorithm Vrfy.• A trusted certificate authority (CA) that can be used to issue publickey certificates for any party.Using the cryptographic primitives above, design and analyse an electronic sealed-bid auction protocol according to the following guidelines:• The parties involved in the auction are: (i) an auction administrator(AA) and…
Consider a very simple symmetric block encryption algorithm in which 32-bits blocks of plaintext are encrypted using a 64-bit key. Encryption is defined as C = (PK₁) K₁ where C = ciphertext, K = secret key, Ko = leftmost 64 bits of K, K₁ = rightmost 64 bits of K,+ = bitwise exclusive OR, and is addition mod 264. a. Show the decryption equation. That is, show the equation for P as a function of C, Ko, and K₁. b. Suppose and adversary has access to two sets of plaintexts and their correspond- ing ciphertexts and wishes to determine K. We have the two equations: C = (PK) K₁; C = (PK) K₁ First, derive an equation in one unknown (e.g., Ko). Is it possible to proceed fur- ther to solve for Ko?
2. 2 independent problems about Elgamal: (a) what things go badly if Alice picks the private keys 0 or 1? (b) Suppose Alice receives the ciphertexts (6, 17) and (6, 25), working under p = 29. Say Eve knows that Alice and Bob has an agreement where Bob always sends his ID, 21, as the first plaintext. Find the second plaintext.
Question 4. A sealed-bid auction is a process where a number of partiescalled bidders submit sealed bids for buying some item. Once all sealed bidshave been submitted, the bids are revealed and the highest bidder is the onethat buys the item.Suppose that the following cryptographic primitives are available:• A fully secure public-key encryption scheme (e.g., RSA-OAEP) thatconsists of the key-generation algorithm PKE.Gen, the encryption algorithm Enc, and the decryption algorithm Dec. • An existentially unforgeable digital signature scheme (e.g., RSA-FDH)that consists of the key-generation algorithm DS.Gen, the signing algorithm Sign, and the verification algorithm Vrfy. • A trusted certificate authority (CA) that can be used to issue publickey certificates for any party.Using the cryptographic primitives above, design and analyse an electronic sealed-bid auction protocol according to the following guidelines: • The parties involved in the auction are: (i) an auction administrator(AA)…
In the Elgamal encryption scheme, Bob's public key is fixed, but Alice uses a fresh random i e {2,...,p – 2}, and hence a fresh random kg, whenever she wants to send Bob a message. What happens if Alice uses the same i for ecrypting multiple messages? Can Trudy recover any meaningful information from the ciphertexts?
In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 77 ASCII characters. You can review the ASCII characters here.. Exactly 27=12827=128 of these codes are for printable characters; we will assume every character in the password is printable. What is the size of the keyspace that consists of passwords of this form?What is the equivalent key length in bits? Assuming that you could check one password every 10−810−8 seconds, what is the worst case running time for cracking this password by brute force search (in days)? Now assume that the user used only 3131 characters from the keyboard. What is the key length in bits in this case? How many days, in the worst case, would it take to break this weaker password? You can't round to the nearest day here -- be as exact as possible. Supposing you used only 3131 characters, how long is the shortest password that achieves 252252 bits of security?
Alice and Bod have decided to use a symmetric encryption algorithm. They have some assumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. For example, if the plain text is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), then for each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) Write a program in Python, C/C++ or JavaScript to…