Suppose that we decide to use the 8-bit ASCII encoding for alphabetic charac-ters with block size of one character (or letter). Using the RSA cryptosystem,let the public key is (2993, 217), where the two primes p = 41 and q = 73.Determine the private key (n, e) and encrypt some characters (not necessarilyall characters - but make sure you include the first character "M" in the oneyou choose) of the word "MONEY", where M = 77, O = 79, N = 78, E = 69,Y = 89 according to the 8-bit ASCII encoding table. Show ALL workings.

We need to implement RSA algorithm for given characters.

Answered: Suppose that we decide to use the 8-bit…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

You may use a software to do calculations but you have to write down the details. The correspondence of letters table: A 01 B C D E F GH I J K L M 02 03 04 05 06 07 08 09 10 11 12 13 TU V W X Y N O P Q R 14 15 16 17 18 Z space S 19 20 21 22 23 24 25 26 00 4. Decipher the message "NUMBER", which was enciphered using the blocked cipher that sends the plaintext block (x₁, x2) into the ciphertext block (y₁, y2) with 2 (22) = (₂¹9) (2) mod 27.
make a code , if you can uses mathlab keep basic code no if or return
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).
Example 2 Enter message to be encrypted: Dèyè mòn, gen mòn. Enter step size: -1 ORIGINAL MESSAGE Dèyè mòn, gen mòn. ENCRYPTED MESSAGE Cçxç lim, fdm lim. Enter message to be encrypted: Dèyè mòn, gen mòn. Enter step size: 0 ORIGINAL MESSAGE Dèyè mòn, gen mòn. ENCRYPTED MESSAGE Dèyè mòn, gen mòn. Enter message to be encrypted: QUIT Example 3 Enter message to be encrypted: Perfer et obdura, dolor hic tib: proderit olim. Enter step size: 8 ORIGINAL MESSAGE Perfer et obdura, dolor hic tibi proderit olim. ENCRYPTED MESSAGE Xmznmz m| wjl)zi, lwtwz pąk |qją xzwlmzą| wtqu. Enter message to be encrypted: QUIT
How do I solve the picture below?
Let's say that an AES-128 key was 00 00 00 01 00 00 00 02 00 00 00 03 00 00 00 04. (It's a bad key because it's not random, but we'll use it in this problem anyway.) This is used as "round key 0" what are the first four bytes in "round key 1"? Write each using exactly two hex digits (using lower- case hex for a-f). You may look at these slides 2 or this chapter e if you wish.
RSA cryptosystem Let p = 29 and q = 31. Then the RSA modulus n = pq = 899. We set the length of plaintext blocks to be 2 and the length of ciphertext blocks 3. Let the encryption exponent b = 29. If, for example, we want to encrypt the word live, we first divide the word into blocks of length 2, li and ve, and then find its corresponding number blocks 11 8 and 21 4. We consider these number blocks as numbers in base 26. Then we find the corresponding integers in base 10, that is 11 8 = 11 × 26 + 8 = 294 and 21 4 = 21 × 26 + 4 = 550. The integers 294 and 550 are regarded as modular numbers in Z899 and encrypted as 29429 (mod 899) = 91 and 5502⁹ (mod 899) = 492. Now write 91 and 492 in base 26 of length 3 we get 91 = 0 x 26² +3 x 26 +13 and 492 = 0 x 262 +18 × 26 +24 and the corresponding number blocks of length 3 are 0 3 13 and 0 18 24. Hen the ciphertext for live is ADNASY as 0 3 13 = ADN and 0 18 24 = ASY.
You are given a string that was encoded by a Caesar cipher with an unknown distance value. The text can contain any of the printable ASCII characters. Suggest an algorithm for cracking this code.
Encrypt the animal name marmot using the letter to number correspondence abc de f 8hijk 1 mnopar stuvw x y 2 e 1 2 3 4 5 6 7 8 9 18 11 12 13 14 15 16 17 18 19 28 21 22 23 24 25 and the encryption function e :n + (n +1) mod 26 The answer will be a nonsense word (no numbers).
Now assume that the user used only 34 characters from the keyboard. What is the key length in bits in this case? Provide the correct answer for the fourth question. This is not a graded assignment.
write an encoder and a decoder for a modified "book cipher." A book cipher uses a document or book as the cipher key, and the cipher itself uses numbers that reference the words within the text. For example, one of the Beale ciphers used an edition of The Declaration of Independence as the cipher key. The cipher you will write will use a pair of numbers corresponding to each letter in the text. The first number denotes the position of a word in the key text (starting at 0), and the second number denotes the position of the letter in the word (also starting at 0). For instance, given the following key text (the numbers correspond to the index of the first word in the line) [0] 'Twas brillig, and the slithy toves Did gyre and gimble in the wabe; [13] All mimsy were the borogoves, And the mome raths outgrabe. [23] "Beware the Jabberwock, my son! The jaws that bite, the claws that catch! [36] Beware the Jubjub bird, and shun The frumious Bandersnatch!" [45] He took his vorpal sword in…
Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzi. Consider the LFSR represented by the polynomial x¹ + x³ +x+1 What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p = 0, P4 = 1, P3 = 0, P2 = 1, P₁ = 0, Po = 1).

SEE MORE QUESTIONS

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS