fudamentos matematicos para computação

CRIPTOGRAFANDO
Tabela de criptografia

Números primos: p=5; q=11; e=3 {pode ser usado, pois MDC[ 3, (p-1)(q-1)] = 1}

Nome a ser criptografado: JOSE GAMELEIRA DO REGO NETO

J = 19³ (mod 55) -> 19² x 19 (mod 55) -> 31 x 19 (mod 55) -> 39 (mod 55).
O = 24³ (mod 55) -> 24² x 24 (mod 55) -> 26 x 24 (mod 55) -> 19 (mod 55).
S = 28³ (mod 55) -> 28² x 28 (mod 55) -> 14 x 28 (mod 55) -> 7 (mod 55).
E = 14³ (mod 55) -> 14² x 14 (mod 55) -> 31 x 14 (mod 55) -> 49 (mod 55).

Esp = 99³ (mod 55) -> 44³ (mod 55) -> 44² x 44 (mod 55) -> 11 x 44 (mod 55)
-> 44 (mod 55).

G = 16³ (mod 55) -> 16² x 16 (mod 55) -> 36 x 16 (mod 55) -> 26 (mod 55).
A = 10³ (mod 55) -> 10² x 10 (mod 55) -> 45 x 10 (mod 55) -> 10 (mod 55).
M = 22³ (mod 55) -> 22² x 22 (mod 55) -> 44 x 22 (mod 55) -> 33 (mod 55).
E = 14³ (mod 55) -> 14² x 14 (mod 55) -> 31 x 14 (mod 55) -> 49 (mod 55).
L = 21³ (mod 55) -> 21² x 21 (mod 55) -> 1 x 21 (mod 55) -> 21 (mod 55).
E = 14³ (mod 55) -> 14² x 14 (mod 55) -> 31 x 14 (mod 55) -> 49 (mod 55).
I = 18³ (mod 55) -> 18² x 18 (mod 55) -> 49 x 18 (mod 55) -> 2 (mod 55).
R = 27³ (mod 55) -> 27² x 27 (mod 55) -> 14 x 27 (mod 55) -> 48(mod 55).
A = 10³ (mod 55) -> 10² x 10 (mod 55) -> 45 x 10 (mod 55) -> 10 (mod 55).

Esp = 99³ (mod 55) -> 44³ (mod 55) -> 44² x 44 (mod 55) -> 11 x 44 (mod 55)
-> 44 (mod 55).

D = 13³ (mod 55) -> 13² x 13 (mod 55) -> 4 x 13 (mod 55) -> 52 (mod 55).
O = 24³ (mod 55) -> 24² x 24 (mod 55) -> 26 x 24 (mod 55) -> 19 (mod 55).

Esp = 99³ (mod 55) -> 44³ (mod 55) -> 44² x 44 (mod 55) -> 11 x 44 (mod 55)
-> 44 (mod 55).

R = 27³ (mod 55) -> 27² x 27 (mod 55) -> 14 x 27 (mod 55) -> 48 (mod 55).
E = 14³ (mod 55) -> 14² x 14 (mod 55) -> 31 x 14 (mod 55) -> 49 (mod 55).
G = 16³ (mod 55) -> 16² x 16 (mod 55) -> 36 x 16 (mod 55) -> 26 (mod 55).
O = 24³ (mod 55) -> 24² x 24 (mod 55) -> 26 x 24 (mod 55) -> 19 (mod 55).

Esp = 99³ (mod 55) -> 44³ (mod 55) -> 44² x 44 (mod 55) -> 11 x 44 (mod 55)
-> 44 (mod