SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.


To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

 

#
Authors:
James F. Kurose, Keith W. Ross
Chapter:
Security In Computer Networks
Exercise:
Problems
Question:4 | ISBN:9780132856201 | Edition: 6

Question

Consider the block cipher in Figure 8.5. Suppose that each block cipher Ti   simply reverses the order of the eight input bits (so that, for example, 11110000 becomes 00001111). Further suppose that the 64-bit scrambler does not modify any bits (so that the output value of the mth bit is equal to the input value of the mth bit).

(a) With n = 3 and the original 64-bit input equal to 10100000 repeated eight times, what is the value of the output?

(b) Repeat part (a) but now change the last bit of the original 64-bit input from a 0 to a 1.

(c) Repeat parts (a) and (b) but now suppose that the 64-bit scrambler inverses the order of the 64 bits.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

(a)

Refer the block cipher in Figure 8.5 in the texbook.

With n = 3 and the original 64-bit input equal to 10100000 repeated eight times, let's calculate the value of the output:

The block cipher Ti simply reverses the order of the eight input bits, so the 64-bit input sequence after applying the block cipher would be: 00000101 00000101 00000101 00000101 00000101 00000101 00000101 00000101

The 64-bit scrambler does not modify any bits, so the output remains the same: 00000101 00000101 00000101 00000101 00000101 00000101 00000101 00000101

(b)

Now, let's change the last bit of the original 64-bit input from a 0 to a 1:

The original 64-bit input with the last bit changed would be: 10100001 repeated eight times

After applying the block cipher Ti, the 64-bit input sequence becomes: 10000101 10000101 10000101 10000101 10000101 10000101 10000101 10000101

Since the 64-bit scrambler does not modify any bits, the output remains the same: 10000101 10000101 10000101 10000101 10000101 10000101 10000101 10000101

(c)

Now, let's consider the 64-bit scrambler that inverses the order of the 64 bits:

For both parts (a) and (b), the original 64-bit input remains the same: 10100000 repeated eight times

After applying the block cipher Ti, the 64-bit input sequence becomes: 00000101 00000101 00000101 00000101 00000101 00000101 00000101 00000101

With the 64-bit scrambler inversing the order of the 64 bits, the output would be: 10100000 10100000 10100000 10100000 10100000 10100000 10100000 10100000

0 0

Discussions

Post the discussion to improve the above solution.