RSA Encryption

The Modular Exponentiation Algorithm Given positive integers P, E, and n, this algorithm computes the remainder when PE is divided by n. Step 1 (initialization) Step 2 while e 0 Set r2, pP, and e -E Step 2.1 (determine parity of e) Determine the quotient Q and remainder R in the division of e by 2. Determine the remainder ri in the division of p by ifR ! Step 2.2 (square and reduce) Step 2.3 (multiply by new square if necessary) Replace r2 by the remainder in the division of r2p by n. endif Step 2.4 (update variables) Replace p with ri and e with Q. endwhile (output remainder of PE) Print r2 Step 3