Purchase Solution

Cryptography: substitution-permutation network

Not what you're looking for?

Ask Custom Question

Consider the following 2x2 s-box

x | S(x)
---|-------
0 | 3
1 | 1
2 | 0
3 | 2

Consider 2-round SPN (substitution-permutation network) with a block length of 4 bits. If the key mixing is done using a mod-4 addition operation before each round and after the last round, determine the ciphertext corresponding to the message m=15.

Assume the round keys as k1=11, k2=10, and k3=7.

Mod-4 operation is to solved by picking two bits blocks each time and treating them individually without propagating carry forward to next set of two bits blocks.

Purchase this Solution

Solution Summary

Solution gives detailed step-by-step computation in the sequence "key mixing, first round, key mixing, second round, key mixing".

Solution Preview

Numbers, in brackets below, indicate the corresponding 4 bits representation of message and key values.

m=15 (1111)
k1=11 (1011)
k2=10 (1010)
k3=7 (0111)

Bits are numbered from right(0) to left(3).
X10 indicates 2 bits value formed from (bit1 bit0) and X32 indicates 2 bits value formed from (bit3 bit2). Same is the case with Y10, ...

Purchase this Solution


Free BrainMass Quizzes
C# variables and classes

This quiz contains questions about C# classes and variables.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Basic Networking Questions

This quiz consists of some basic networking questions.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.