A cryptography student has accidentally used the same keystream to encrypt two different messages, M1 and0x7894c0d145 fd8536 and C2 = 0x faf61234a0e65dc2. We alsoM2. We know that the ciphertexts are C1happen to know that M1= Ox ƒ70bca4869ded9a5.a) What is M, in hexadecimal? Please give your answer a leading Ox and use lowercase letters only.b) What is the keystream? Please give your answer a leading Ox and use lowercase letters only.Hint: These are all 8 byte numbers and will fit in an unsigned long type on most systems.

Below are the required answers with calculation and explanation:

Answered: A cryptography student has accidentally…

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

Consider the hex strings A=0x274dce4716a5705c and B=0x98d54fc92cd0eed0. a) What is A O B in hexadecimal? Please give your answer a leading Ox and use lowercase letters only. hexadecimal: b) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A is 1? c) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A O B is 1?
An animal name has been encoded using the letter to number correspondence abc de f 8hijk 1 m nopP arstu vH x y z e 1 2 3 4 5 6 7 8 9 1e 11 12 13 14 15 16 17 18 19 28 21 22 23 24 25 and the encryption function e:n + (n + 2) mod 26 The result is the secret identification kiwcpc . What is the animal? The answer will be a nonsense word (no numbers).
Someone sends you a message of “4”. They also send you a copy of their message encrypted with their private key. The “signed”, or encrypted copy is “49”. Their public key is (exponent 23, clock 55). Show the math you can do to authenticate the message.
Messages are to be encoded using the RSA method, and the primes chosen are p “ 17 and q “ 19, so that n “ pq “ 323, and e “ 19. Thus, the public key is p323, 19q. (a) Show that the decryption exponent d (your private key) is 91.
Decrypt Using these two prime numbers p: 11472448678961361675809388014248341 q: 46838031327322626556194693766252933 an RSA public key was constructed (these are same prime numbers we used in class) and the following message (an encoded palindromic sentence) has been sent to you: s: 206852398229333288394377911072663657292972237656591756203408205688278 What is that palindromic sentence?
How many 14-bit strings (that is, bit strings of length 14) are there which: a. Start with the sub-string 011? 2048 b. Have weight 4 (i.e., contain exactly 4 1's) and start with the sub-string 011? 330 c. Either start with 011 or end with 01 (or both)? 6144 d. Have weight 4 and either start with 011 or end with 01 (or both)? 825
Alice wants to send Bob her account number for his dining dollars. Bob’s account number is 24. Bob wants to encrypt her account number using the RSA algorithm scheme as evil Eve wants to steal her money to buy M&Ms. Bob chooses two prime numbers, 23 and 37, and uses them to compute the number m. Bob then computes the number e and the number d by using things he knows about the number m and its relationship to e. Bob sends the number e and the number m to Alice and she uses them to encrypt her number A and obtains the number C. C is the encrypted version of her code. Alice sends the number C to Bob, and then Bob uses the number d to decrypt Alice’s message. Using this information, encrypt and decrypt the message to show that the RSA algorithm works, then in a few words explain what makes the algorithm secure if the key for encrypting is always public.
Consider the following binary number: 1.11000000000000000000100. What are the values of guard, round , and sticky bits after 8 right shifts? The encoding of the options is (guard)(round)(sticky). For example, if guard bit is 1, round is 0, and sticky bit is 0, the encoding is 100. 100 001 00 010 Arrange the steps involved in floating point multiplication. The first step must be at the top and the last step must be at the bottom. You can assume that the result is still normalized after rounding. Start 1 | Multiply the significands 2 E Set the sign of the result 3 | Check for overflow or underflow. If true, flag an exception, otherwise continue. 4 E Subtract bias from the sum | Add biased exponents of the two numbers 6 E Normalize the product, if needed 7 | Round the significand Done
Design a cryptographic solution for implementing the dinning cryptographers protocol. You should consider the following: The secret messages shared between any two agents in the protocol are communicated over public channels only. The announcements made by each agent must be traceable in a trustworthy way to that agent. Your solution should be a new protocol that addresses the above two requirements.
The operator of a Vigenere encryption machine is bored and encrypts a plaintext consisting of the same letter of the alphabet repeated several hundred times. The key is a seven-letter English word. Eve knows that the key is a word but does not yet know its length. What property of the ciphertext will make Eve suspect that the plaintext is one repeated letter and will allow her to guess that the key length is seven? What will the number of matches be for the different displacements?
Let S be the set of bit strings of length four or more. For example, 10011l e S, 00111100 € S, or 1011 e S. Let R = {(r, y)|r E S,y E S, and r, y agree on their first four bits}. For example, (1010111, 1010010) e R but (10010111, 110010) g R. Show that R is an equivalence relation on S. What are the equivalence classes of the bit string 11110101
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…

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS