18.11.2014 Views

Anais - Engenharia de Redes de Comunicação - UnB

Anais - Engenharia de Redes de Comunicação - UnB

Anais - Engenharia de Redes de Comunicação - UnB

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Configuration 1.3<br />

(<br />

a<br />

t−1<br />

i−1<br />

a t−1<br />

i<br />

a t−1<br />

i+1<br />

x a t i x<br />

)<br />

=<br />

(<br />

a<br />

t−1<br />

i−1 1 a t−1<br />

i+1<br />

x 0 x<br />

)<br />

This configuration allows one to immediately <strong>de</strong>termine a t−1<br />

i−1 = 1. However, a t−1<br />

i+1<br />

remains un<strong>de</strong>fined. If the attacker flips the bit a t−1<br />

i and then recomputes the bit a t i, there<br />

will be two possibilities:<br />

• If a t i = 1, then a t−1<br />

i−1 = 1 and a t−1<br />

i+1 = 0<br />

• If a t i = 0, then a t−1<br />

i−1 = 1 and a t−1<br />

i+1 = 1<br />

Configuration 1.4<br />

(<br />

a<br />

t−1<br />

i−1<br />

a t−1<br />

i<br />

a t−1<br />

i+1<br />

x a t i x<br />

)<br />

=<br />

(<br />

a<br />

t−1<br />

i−1 1 a t−1<br />

i+1<br />

x 1 x<br />

)<br />

This configuration allows one to immediately <strong>de</strong>termine a t−1<br />

i−1 = 0. However, a t−1<br />

i+1<br />

remains un<strong>de</strong>fined. If the attacker flips the bit a t−1<br />

i and then recomputes the bit a t i, there<br />

will be two possibilities:<br />

• If a t i = 1, then a t−1<br />

i−1 = 0 and a t−1<br />

i+1 = 1<br />

• If a t i = 0, then a t−1<br />

i−1 = 0 and a t−1<br />

i+1 = 0<br />

STEP 2: Determination of the bits on the right si<strong>de</strong> of the central column.<br />

Assume the following notation.<br />

(<br />

α β<br />

x δ<br />

)<br />

=<br />

(<br />

a<br />

t−1<br />

i−1<br />

x<br />

a t−1<br />

i<br />

a t i<br />

)<br />

One can easily see that there are 8 different possibilities for the bits {α, β, δ}. Basing on<br />

equation 1, an adversary in possession of the bits {α, β, δ} can <strong>de</strong>termine the bit a t−1<br />

i+1 by<br />

applying one fault into the register.<br />

We shall now analyze these 8 possibilities.<br />

Configuration 2.1<br />

(<br />

a<br />

t−1<br />

i−1<br />

a t−1<br />

i<br />

a t−1<br />

i+1<br />

x a t i x<br />

)<br />

=<br />

(<br />

0 0 a<br />

t−1<br />

i+1<br />

x 0 x<br />

• This configuration is only possible for a t−1<br />

i+1 = 0.<br />

Configuration 2.2<br />

(<br />

a<br />

t−1<br />

i−1<br />

a t−1<br />

i<br />

a t−1<br />

i+1<br />

x a t i x<br />

)<br />

=<br />

(<br />

0 0 a<br />

t−1<br />

i+1<br />

x 1 x<br />

)<br />

)<br />

88

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!