Abstract Algebra: Theory and Applications · Problem 7.4.10

Algebraic Coding Theory — Thomas Judson

Mathematics — Abstract Algebra · rsa-compute-decryption-exponent

Problem

For each of the following encryption keys (n,E)(n, E) in the RSA cryptosystem, compute DD. (a) (n,E)=(451,231)(n, E) = (451, 231) (b) (n,E)=(3053,1921)(n, E) = (3053, 1921) (c) (n,E)=(37986733,12371)(n, E) = (37986733, 12371) (d) (n,E)=(16394854313,34578451)(n, E) = (16394854313, 34578451) Hint. (a) n=11⋅41n = 11 \cdot 41; (c) n=8779⋅4327n = 8779 \cdot 4327.

Browse the problem library