Home > Articles > Security > Network Security

  • Print
  • + Share This
This chapter is from the book

Exercises

1.1

What is the difference between a protocol and an algorithm?

1.2

In Prot 1.1 Alice can decide HEADS or TAILS. This may be an unfair advantage for some applications. Modify the protocol so that Alice can no longer have this advantage.

Hint: let a correct guess decide the side.

1.3

Let function f map from the space of 200-bit integers to that of 100-bit ones with the following mapping rule:

021equ01.gif


here "⊕" denotes bit-by-bit XOR operation, i.e.,

021equ02.gif


  1. Is f efficient?

  2. Does f have the "Magic Property I"?

  3. Does f have the "Magic Property II"?

  4. Can this function be used in Prot 1.1?

1.4

Is an unbroken cryptographic algorithm more secure than a known broken one? If not, why?

1.5

Complex systems are error-prone. Give an additional reason for a complex security system to be even more error-prone.

  • + Share This
  • 🔖 Save To Your Account