dissertacao.pdf

A.4 Related Plaintext Attack
rrp = {};
b = 3;
While[b < 10,
nbits = 2∧ nbits = 2 b; ∧ nbits = 2 b; ∧b; i = 3;
g = 50;
nlist = {};
primos = {};
While[Length[nlist] < g,
e = Prime[RandomInteger[{2, 5}]];
p = RandomPrime[{2∧ (nbits − 1), 2∧ p = RandomPrime[{2 nbits − 1}];
∧ (nbits − 1), 2∧ p = RandomPrime[{2 nbits − 1}];
∧ (nbits − 1), 2∧nbits − 1}];
q = RandomPrime[{2∧ (nbits − 1), 2∧ q = RandomPrime[{2 nbits − 1}];
∧ (nbits − 1), 2∧ q = RandomPrime[{2 nbits − 1}];
∧ (nbits − 1), 2∧nbits − 1}];
While[Intersection[{p}, primos] = = = {},
p = RandomPrime[{2∧ (nbits − 1), 2∧ p = RandomPrime[{2 nbits − 1}]; ];
∧ (nbits − 1), 2∧ p = RandomPrime[{2 nbits − 1}]; ];
∧ (nbits − 1), 2∧nbits − 1}]; ];
While[Intersection[{q}, primos] = = = {}p {}p {}p == q,
q = RandomPrime[{2∧ (nbits − 1), 2∧ q = RandomPrime[{2 nbits − 1}]; ];
∧ (nbits − 1), 2∧ q = RandomPrime[{2 nbits − 1}]; ];
∧ (nbits − 1), 2∧nbits − 1}]; ];
n = p ∗ q;
neuler = (p − 1)(q − 1);
If[GCD[e, neuler] == 1,
nlist = Append[nlist, {e, n}];
primos = Append[primos, p];
primos = Append[primos, q],
nbits = nbits + 1;
];
];
l = Max[Table[nlist[[i, 1]] ∗ 2, {i, 1, g}]];
coef = Table[{RandomInteger[{0, 2}], i}, {i, 1, l}];
poli = Function[{i, m},
Mod[m∧ Mod[m coef[[i, 1]] + coef[[i, 2]], nlist[[i, 2]]]
∧ Mod[m coef[[i, 1]] + coef[[i, 2]], nlist[[i, 2]]]
∧coef[[i, 1]] + coef[[i, 2]], nlist[[i, 2]]]
];
deg = Function[i, coef[[i, 1]]];
max = Max[Table[nlist[[i, 1]] ∗ deg[i], {i, 1, l}]];
i = 2;
n0 = nlist[[1, 2]];
59