Alice is using RSA digital signatures. When she signs 2 messages m₁ and m2 with signatures s(m₁) and s(m₂) and sends them to Bob, Eve intercepts all 4 pieces of this information. Eve now wants to forge the signatures for one of the following 3 messages (all considered as elements mod N, the public RSA modulus). One of them is easier than the others. Find it and show that Eve can forge it. 1. m = m1m2; 2. mm₁ + m2; 3. m 2 * M₁.

Alice is using RSA digital signatures. When she signs 2 messages m₁ and m2 with signatures s(m₁) and s(m₂) and sends them to Bob, Eve intercepts all 4 pieces of this information. Eve now wants to forge the signatures for one of the following 3 messages (all considered as elements mod N, the public RSA modulus). One of them is easier than the others. Find it and show that Eve can forge it. 1. m = m1m2; 2. mm₁ + m2; 3. m 2 * M₁.

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

A cryptography student has accidentally used the same keystream to encrypt two different messages, M1M1 and M2M2. We know that the ciphertexts are C1=0x42e8ede51496d10cC1=0x42e8ede51496d10c and C2=0xa5ec5666da7419d0C2=0xa5ec5666da7419d0. We also happen to know that M1=0x713dc2f31c1e6c87M1=0x713dc2f31c1e6c87. a) What is M2M2 in hexadecimal? Please give your answer a leading 0x and use lowercase letters only. b) What is the keystream? Please give your answer a leading 0x and use lowercase letters only. Hint: These are all 8 byte numbers and will fit in an unsigned long type on most systems.
Analyze the message integrity of the following scenario? messäge m tag Alice Bob Generate tag: Verify tag: tag CRC(m) V(m, tag) 'yes' %3D
Suppose we have an alphabet of 30 characters, labelled as the integers modulo 30. Suppose that a 2 × 2 affine shift cipher is used to encode a message and it is known that the translation vector B is (0,0). The cipher text comes along as "21, 2, 13, 3, 14, 7, 0, 15,..." and you figure out through some other means that the plaintext starts "15, 16, 1, 1, plaintext? ." What is the encryption key? What are the next four digits of the ....
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…
We are interested to see divisibility checking of only prime numbers in base 10. For a prime P, you need to find the smallest positive integer N such that P's divisibility testing is "N-sum" or "N-alterum". Remember divisibility testing of 3 in base 10? It was simple, right? We need to add all the digits and then check if it is divisible by 3. Call this method "1-sum". In case of testing of 11, we need to add all digits by alternating their signs. For example,1354379988104 = 11*123125453464 and (4- 0+1-8+8-9+9-7+3-4+5-3+1) = 0, which is divisible by 11 (0 = 0*11). Let's call this method "1-altersum". In case of 7, we need to add all 3-digit-groups by alternating their signs. For example, 8618727529993 = 7*1231246789999 and (993- 529+727-618+8) = 581, which is divisible by 7 (581 = 7*83). Similarly, we call this method "3-altersum". In similar Manner, 13's checking is "3-altersum". Develop a C++ program that solve the above problem, sample input output is listed below. Input: 1 78…
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
There is an N of components, represented by the strings S1,S2, .... SN into the kitchen. The chef took all the ingredients, put them in a cauldron and mixed them. In the cauldron, the letters of the strings representing the ingredients are completely shuffled, so that each letter appears in the cauldron as many times as it has appeared in all the strings combined; now the cook can take out one letter from the cauldron at will (if that letter appears in the cauldron more than once, it can be taken out that many times) and use it in a dish. Complete Food is a "chef" chain. Help the chef find the maximum number of complete meals he can make! Please Answer in Java Programming language. Input 1 3 Code Chef hacker Output 1
Expanding randomness. Alice wants to implement AES in CTRmode on a small IoT device that doesn’t have a good source of randomness.She has observed that, in practice, she can obtain four randombits for each encryption. To produce the 64 bits of nonce needed foreach encryption, she proceeds as follows. She takes the SHA256 of thefour random bits. Then she uses the first 64 bits of the SHA256 outputas the nonce. Is this method secure? Explain your reasoning. (Hint:consider what happens if the adversary tries to guess the nonce. Howmany possibilities are there? Would guessing the nonce help themdecrypt the message?)
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?
Show the trace of the brute-force algorithm in the style of the figures in the textfor the following pattern and text stringsa. pattern: AAAAAAAB text: AAAAAAAAAAAAAAAAAAAAAAAABb. pattern: ABABABAB text: ABABABABAABABABABAAAAAAAA
The ROT-13 algorithm encrypts a string one character at a time by adding 13 to the value of the internal representation of the character. We want our encryption scheme to cover the entire printable ASCII range. After examining the ASCII character set and their internal representations, we see that characters 0 through 32 and character 127 are control characters. Technically, characters 32 (space) and 127 (DEL) are printable, but we don’t want to include them in our encryption routine. Therefore, we want our encrypted string to only contain characters in the range of 33 through 126. As an example: Plaintext: Norwich Ciphertext: [|!&vpu The internal representation of ‘N’ is 78. 78 plus 13 is 91, which is the character ‘[‘. The internal representation of ‘o’ is 111. 111 plus 13 is 124, which is the character ‘|’. The internal representation of ‘r’ is 114. 114 plus 13 is 127. Since 126 is our maximum value for our desired printable range, we…
Substitution Cipher is an old technique that substitutes one thing for another. For example, alphabet messages can be ciphered by applying the following substitution. plaintext: abcdefghijklmnopqrstuvwxyz | | V Vciphertext: mnbvcxzasdfghjklpoiuytrewq However, this type of ciphering produces patterns since the same plaintext strings produce the same cipher text. Polyalphabetic Cipher, on the other hand mitigates this problem as plaintext characters are not always replaced with the same cipher text character. The replacement of each character dependson a key as well as on the position of the character in the text; for example, by using a formula such as: for (int i=0; i < length of P; i++) C[i] = P[i] + K + (i mod 3) In essence, if the key, K, is choses as K=10, then 10 is added to characters in position 0, 3, 6, …; and 11 is added for those in…