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.

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

i+1 = 1.<br />

Configuration 2.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 />

• This configuration is not possible.<br />

Configuration 2.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 />

If the attacker flips the bit a t−1<br />

i<br />

possibilities:<br />

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

i+1 = 1.<br />

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

i+1 = 0.<br />

Configuration 2.5<br />

(<br />

a<br />

t−1<br />

i−1<br />

a t−1<br />

i<br />

)<br />

)<br />

=<br />

=<br />

(<br />

0 1 a<br />

t−1<br />

i+1<br />

x 0 x<br />

(<br />

0 1 a<br />

t−1<br />

i+1<br />

x 1 x<br />

)<br />

)<br />

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

a t−1<br />

i+1<br />

x a t i x<br />

)<br />

=<br />

(<br />

1 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 = 1.<br />

Configuration 2.6<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 />

1 0 a<br />

t−1<br />

i+1<br />

x 1 x<br />

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

i+1 = 0.<br />

Configuration 2.7<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 />

If the attacker flips the bit a t−1<br />

i<br />

possibilities:<br />

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

i+1 = 0.<br />

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

i+1 = 1.<br />

Configuration 2.8<br />

(<br />

a<br />

t−1<br />

i−1<br />

a t−1<br />

i<br />

)<br />

=<br />

(<br />

1 1 a<br />

t−1<br />

i+1<br />

x 0 x<br />

)<br />

)<br />

)<br />

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

a t−1<br />

i+1<br />

x a t i x<br />

)<br />

=<br />

(<br />

1 1 a<br />

t−1<br />

i+1<br />

x 1 x<br />

)<br />

89

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

Saved successfully!

Ooh no, something went wrong!