Differences
This shows you the differences between two versions of the page.
|
ic:laboratoare:04 [2020/10/27 18:42] acosmin.maria |
ic:laboratoare:04 [2020/11/02 01:08] (current) acosmin.maria |
||
|---|---|---|---|
| Line 77: | Line 77: | ||
| * d) Construct a new PRF $F_4 : K × X \to Y$ that remains secure if the attacker learns any single bit of the key. Your function $F_4$ may only call $F$ once. Briefly explain why your PRF remains secure if any single bit of the key is leaked. | * d) Construct a new PRF $F_4 : K × X \to Y$ that remains secure if the attacker learns any single bit of the key. Your function $F_4$ may only call $F$ once. Briefly explain why your PRF remains secure if any single bit of the key is leaked. | ||
| - | ==== Exercise 2 ==== | + | ==== Exercise 2-3-4 ==== |
| Let's analyse some substitution-permutation networks (SPN). | Let's analyse some substitution-permutation networks (SPN). | ||
| - | === SPN 1 (3p) === | + | ==== SPN 1 (3p) ==== |
| We have the SPN from this figure: | We have the SPN from this figure: | ||
