 Solution

Use the agreed text encoding to split the plaintext into integer blocks $m_j\in \{0,\dots ,1072\}$. RSA encrypts each block by modular exponentiation:Because $1073=29\cdot 37$ is a product of distinct primes, its Euler totient function is $\phi (1073)=28\cdot 36=1008$. The inverse exponent follows fromThus a decryption exponent is 275, and the three recovered blocks areTo check every block, including blocks not coprime to the modulus, reduce modulo each prime. If $m_j$ is nonzero modulo 29, Fermat's little theorem gives $m_j^{3025}=m_j$ because $28\mid 3024$; if it is zero the equality is immediate. The same argument works modulo 37 because $36\mid 3024$. The Chinese remainder theorem then gives the equality modulo 1073. Finally reverse the agreed text encoding. The symbols $r_1,r_2,r_3$ are unspecified, so there are no numerical message blocks to evaluate further.