ocr: mathematical trickery and the secret de- tion is to restore the original messages 0 the exponents are simply multiplied. cryption exponent D. This can be illus- - 34. Thus: trated by the simple example in Fig 1. This example is clearly trivial, but it (XE"-X DE In this example, N is chosen to be 35, illustrates how the original messages can But in modulo arithmetic, the following whichi ist the product of7and5, two primes. be restored in spite of the modulo opera- rule applies: mod PhiN) There are thus 35 possible messages, the tion at each multiplication. All that needs (XE mod N) D mod N - X ...
