As you have seen in the reading, decrypting a shift codes or affine codes is not a particularly

hard thing to do given that there are only $26$ letters in the Engligh alphabet. One way to

get around this is to encode the message as numbers and group the plaintext message into

blocks. For example, using the encoding $A01,B02,$dots,$Z26,$ we can encode the

word NUMBER into two$-$letter blocks as

NU MB ER $14211302518.$

Decrypt the following message, which was encrypted using multiplication by $11$ modulo

$2800($i$.$e$.$ the encryption function is $f(n)=$mod$(11n,2800)).$

$1643185427201711185540919725651876255525982597.$

Solution: Solution goes here.