dissertacao.pdf

A.2 DeLaurentis Attack
rla = {};
i = 3;
While[i < 13,
nbits = 2∧ nbits = 2 i; ∧ nbits = 2 i; ∧i; p = RandomPrime[{2∧ (nbits/2 − 1), 2∧ p = RandomPrime[{2 (nbits/2) − 1}];
∧ (nbits/2 − 1), 2∧ p = RandomPrime[{2 (nbits/2) − 1}];
∧ (nbits/2 − 1), 2∧ (nbits/2) − 1}];
q = RandomPrime[{2∧ (nbits/2 − 1), 2∧ q = RandomPrime[{2 (nbits/2) − 1}];
∧ (nbits/2 − 1), 2∧ q = RandomPrime[{2 (nbits/2) − 1}];
∧ (nbits/2 − 1), 2∧ (nbits/2) − 1}];
While[q == p, q = RandomPrime[{2∧ (nbits/2 − 1), 2∧ While[q == p, q = RandomPrime[{2 (nbits/2) − 1}]];
∧ (nbits/2 − 1), 2∧ While[q == p, q = RandomPrime[{2 (nbits/2) − 1}]];
∧ (nbits/2 − 1), 2∧ (nbits/2) − 1}]];
n = p ∗ q;
e1 = n;
While[e1 == n n n e1 == pe2 pe2 pe2 == q, e1 = RandomPrime[n]; ];
d1 = PowerMod[e1, −1, n];
e2 = n;
While[e2 == ne2 ne2 ne2 == e1, e2 = RandomPrime[n]; ];
rla = Append[rla, {nbits, Timing[
naux = (e1 ∗ d1 − 1)/GCD[e2, e1 ∗ d1 − 1];
d2crypt = PowerMod[e2, −1, naux]
][[1]]}];
Print[r1];
i++;
]
A.3 Hastad’s Common Plaintext Attack
rhc = {};
e = 3;
i = 3;
While[i < 12,
nbits = 2∧ nbits = 2 i; ∧ nbits = 2 i; ∧i; nlist = {};
b = 1;
primos = {};
While[Length[nlist] < e + 2,
p = RandomPrime[{2∧ (nbits − 1), 2∧ p = RandomPrime[{2 nbits − 1}];
∧ (nbits − 1), 2∧ p = RandomPrime[{2 nbits − 1}];
∧ (nbits − 1), 2∧nbits − 1}];
57