This is pretty poorly explained in the notes considering the exam questions we're meant to answer.....basically we've been given one diagram of its implementation.
For example the diagram given basically has some 2-bit inputs:
A |0 0 1 1
B |0 1 0 1
This then goes through an s-box to produce:
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
Now how are those above being determined? Is it as simple as the inputs, basically you're trying to cover all possibilities? If so surely this doesnt or is there only allowed to be one 1 in each sequence?
In some of the past papers you're told to provide 3-bit inputs. I assume this would be something like:
A 0 0 0 1 1 0 1 1
B 0 0 1 0 1 1 0 1
C 0 1 0 0 0 1 1 1
Futher questions ask about product ciphers (multiple p-boxes and s-boxes.) Such as an 18-bit p-box is used 4 times, a 3-bit s-box is used, how many s-boxes will there be? I assume here s-boxes should be used to 'cover' the p-boxes as such so 6 per p-box in this case? How do you know whether additional s-boxes go before the p-boxes or simply in-between?
What i mean by this is how do you know the product cipher will be like this:
PBox | SBox | PBox | SBox | PBox
rather than:
SBox | PBox | SBox | PBox | SBox | PBox | SBox
Hope that isn't too random and confusing, thanks for any insight you can provide!
For example the diagram given basically has some 2-bit inputs:
A |0 0 1 1
B |0 1 0 1
This then goes through an s-box to produce:
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
Now how are those above being determined? Is it as simple as the inputs, basically you're trying to cover all possibilities? If so surely this doesnt or is there only allowed to be one 1 in each sequence?
In some of the past papers you're told to provide 3-bit inputs. I assume this would be something like:
A 0 0 0 1 1 0 1 1
B 0 0 1 0 1 1 0 1
C 0 1 0 0 0 1 1 1
Futher questions ask about product ciphers (multiple p-boxes and s-boxes.) Such as an 18-bit p-box is used 4 times, a 3-bit s-box is used, how many s-boxes will there be? I assume here s-boxes should be used to 'cover' the p-boxes as such so 6 per p-box in this case? How do you know whether additional s-boxes go before the p-boxes or simply in-between?
What i mean by this is how do you know the product cipher will be like this:
PBox | SBox | PBox | SBox | PBox
rather than:
SBox | PBox | SBox | PBox | SBox | PBox | SBox
Hope that isn't too random and confusing, thanks for any insight you can provide!