Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 12 - Theory of Computation - Section 12.6 - Public-Key Cryptography - Questions & Exercises - Page 569: 4

Answer

325

Work Step by Step

n = p = q = 7 = 19 = 133. To find d we need a positive integer value k such that k(p = 1)(q = 1) = 1 = k(6 = 18) = 1 = 108k = 1 is evenly divisible by e = 5. The values k =1 and k = 2 are not satisfactory, but k = 3 produces 108k = 1 = 325, which is divisible by 5. The quotient 65 is the value of d.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.