Abstract Algebra: Theory and Applications · Problem 7.4.7

Algebraic Coding Theory — Thomas Judson

Mathematics — Abstract Algebra · rsa-encryption

Problem

Encrypt each of the following RSA messages xx so that xx is divided into blocks of integers of length 2; that is, if x=142528x = 142528, encode 14, 25, and 28 separately. (a) n=3551, E=629, x=31n = 3551,\ E = 629,\ x = 31 (b) n=2257, E=47, x=23n = 2257,\ E = 47,\ x = 23 (c) n=120979, E=13251, x=142371n = 120979,\ E = 13251,\ x = 142371 (d) n=45629, E=781, x=231561n = 45629,\ E = 781,\ x = 231561 Hint. (a) 2791; (c) 11213525032442.

Browse the problem library