Explanation Given information: The given cipher text 675 089 089 048. Concept used: Inverse of a modulo n : For all integers a and n , if gcd ( a , n ) = 1 , then there exists an integer s such that a s ≡ 1 ( mod n ) . The integer s is called the inverse of a modulo n . Calculation: Consider the cipher text, 675 089 089 048 The objective is to decrypt the given cipher text and find the original message. The decryption key is d = 307 , since 307 is the inverse of 43 . Public key is n = 713 = 23 ⋅ 31 and e = 43 . Thus, to decrypt the message, compute the following: 675 307 mod 713 , 89 307 mod 713 , 89 307 mod 713 , 48 307 mod 713 Convert 307 to a sum of powers of 2. 307 = 256 + 32 + 16 + 2 + 1 = 2 8 + 2 5 + 2 4 + 2 1 + 1 Perform 675 2 k for k = 1 , 2 , 3 , 4 . 675 ≡ 675 ( mod 713 ) 675 2 ≡ 455625 ( mod 713 ) since 675 2 = 455625 = 18 mod 713 since 455625 mod 713 = 18 675 4 ≡ ( 675 2 ) 2 mod 713 ≡ 18 2 mod 713 since 675 2 mod 713 = 18 = 324 mod 713 since 18 2 = 324 675 8 ≡ ( 675 4 ) 2 mod 713 ≡ ( 324 ) 2 mod 713 since 675 4 mod 713 = 324 ≡ 104976 mod 713 since 324 2 = 104976 ≡ 165 mod 713 since 104976 mod 713 = 165 675 16 ≡ ( 675 8 ) 2 mod 713 ≡ ( 165 ) 2 mod 713 since 675 8 mod 713 = 165 ≡ 27225 mod 713 since 165 2 = 27225 ≡ 131 mod 713 since 27225 mod 713 = 131 Perform 675 2 k for k = 5 , 6 , 7 , 8 675 32 ≡ ( 675 16 ) 2 mod 713 ≡ ( 131 ) 2 mod 713 since 675 16 mod 713 = 131 ≡ 17161 mod 713 since 131 2 = 17161 ≡ 49 mod 713 since 17161 mod 713 = 49 675 64 ≡ ( 675 32 ) 2 mod 713 ≡ ( 49 ) 2 mod 713 since 675 32 mod 713 = 49 ≡ 2401 mod 713 since 49 2 = 2401 ≡ 262 mod 713 since 2401 mod 713 = 262 675 128 ≡ ( 675 64 ) 2 mod 713 ≡ ( 262 ) 2 mod 713 since 675 64 mod 713 = 262 ≡ 68644 mod 713 since 262 2 = 68644 ≡ 196 mod 713 since 68644 mod 713 = 196 675 256 ≡ ( 675 128 ) 2 mod 713 ≡ ( 196 ) 2 mod 713 since 675 128 = 196 mod 173 ≡ 38416 mod 713 since 196 2 = 38416 ≡ 627 mod 713 since 38416 mod 713 = 627 Use the fact that 675 307 mod 173 = ( 675 256 + 32 + 16 + 8 + 2 + 1 ) mod 173 = ( 675 256 ⋅ 675 32 ⋅ 675 16 ⋅ 675 2 ⋅ 675 1 ) mod 173 = ( 627 ⋅ 49 ⋅ 131 ⋅ 18 ⋅ 675 ) mod 173 = 48900262950 mod 173 = 3 mod 173 using calculator =3 Thus, 675 is decrypted as 3 , which corresponds to letter C . Calculate 89 2 k for k = 1 , 2 , 3 , 4 . 89 ≡ 89 mod 713 since by a ≡ a ( mod n ) 89 2 ≡ 89 2 mod 713 = 7921 mod 713 since 89 2 = 7921 = 78 mod 713 since 7921 mod 713 = 78 89 4 ≡ ( 89 2 ) 2 mod 713 ≡ ( 78 ) 2 mod 713 since 89 2 mod 713 = 78 ≡ 6084 mod 713 since 78 2 = 6084 = 380 mod 713 since 380 = 6084 mod 713 89 8 ≡ ( 89 4 ) 2 mod 713 ≡ ( 380 ) 2 mod 713 since 89 4 mod 713 = 380 ≡ 144400 mod 713 since 380 2 = 144400 = 374 mod 713 89 16 ≡ ( 89 8 ) 2 mod 713 ≡ ( 374 ) 2 mod 713 since 89 8 mod 713 = 374 ≡ 139876 mod 713 since 374 2 = 139876 = 128 mod 713 since 139876 mod 713 = 126 Perform 89 2 k for k = 5 , 6 , 7 , 8

5th Edition

ISBN: 9781337694193

Author: EPP, Susanna S.

Publisher: Cengage Learning,

See similar textbooks

Videos

Question

Chapter 8.4, Problem 39ES

To determine

To decrypt the given cipher text and calculate the original message:

675 089 089 048.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 8.4, Problem 38ES

Chapter 8.4, Problem 40ES

Students have asked these similar questions

Solve y"+3y+2y= 0, y(0) = 3, y'(0) = -1 y(t) =

Solve 4y"-23y+15y = 0, y(0) = -8, y'(0) = -23 y(t) =

Car A starts from rest at t = 0 and travels along a straight road with a constant acceleration of 6 ft/s^2 until it reaches a speed of 60ft/s. Afterwards it maintains the speed. Also, when t = 0, car B located 6000 ft down the road is traveling towards A at a constant speed of 80 ft/s. Determine the distance traveled by Car A when they pass each other.Write the solution using pen and draw the graph if needed.

Chapter 8 Solutions

Discrete Mathematics With Applications

Ch. 8.1 - If R is a relation from A to B, xA , and yB , the...Ch. 8.1 - Prob. 2TY Ch. 8.1 - Prob. 3TY Ch. 8.1 - Prob. 4TY Ch. 8.1 - If R is a relation on a set A, the directed graph...Ch. 8.1 - As in Example 8.1.2, the congruence modulo 2...Ch. 8.1 - Prove that for all integers m and n,m-n is even...Ch. 8.1 - The congruence modulo 3 relation, T, is defined...Ch. 8.1 - Define a relation P on Z as follows: For every...Ch. 8.1 - Prob. 5ES

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

To decrypt the given cipher text and calculate the original message: 675 089 ​ 089 048.

Solution Summary: The author explains how to decrypt the given cipher and calculate the original message.

Videos

To decrypt the given cipher text and calculate the original message: 675 089​ 089 048.

Want to see the full answer?

Chapter 8 Solutions

To decrypt the given cipher text and calculate the original message: 675 089 089 048.

To decrypt the given cipher text and calculate the original message:

675 089 089 048.