The goal in this project is to find the "round by round" differences between two nearly identical plaintexts. The two plaintexts we will use are: unsigned char Ml [ 8 ] unsigned char M2 [ 8 ] { ' \x01' , ' \x23' , ' \x45' , \x67' , ' \x89" , ' \xab' , ' \Xed' , ' \xef ' } ; { ' \x41' , ' \ x2 3 . ' \ x45 ' , ' \x67' , ' \x89" , ' \xab' , ' \xcd' , ' \xef ' } ; = = And the key for both plaintexts is this: unsigned char K[8]- (0x13,0x34,0x57,0x79,0x9B,0xBC, 0xDF, OxF1) The desired output is $$ (L- ^{M_1}R^{M.1)) \Oplus (L..! ^(M-2}R_^{M_2})$$ where 2. $\opluss denotes exclusive OR 3. $L_"(M-1 } $ s the left hand state in the $ith round for the plaintext MI, and SR_"(M-1 }$ s the right hand state in the ith round for the plaintext MI. 4. $L_"(M-2) $ S the left hand state in the Si$th round for the plaintext M2, and $R_^{M_2JS is the right hand state in the $isth round for the plaintext M2 In other words for each round we need to find the xOR of the states for that round for the respective p aintexts. The goal in this project is to find the "round by round" differences between two nearly identical plaintexts. The two plaintexts we will use are: unsigned char Ml [ 8 ] unsigned char M2 [ 8 ] { ' \x01' , ' \x23' , ' \x45' , \x67' , ' \x89" , ' \xab' , ' \Xed' , ' \xef ' } ; { ' \x41' , ' \ x2 3 . ' \ x45 ' , ' \x67' , ' \x89" , ' \xab' , ' \xcd' , ' \xef ' } ; = = And the key for both plaintexts is this: unsigned char K[8]- (0x13,0x34,0x57,0x79,0x9B,0xBC, 0xDF, OxF1) The desired output is $$ (L- ^{M_1}R^{M.1)) \Oplus (L..! ^(M-2}R_^{M_2})$$ where 2. $\opluss denotes exclusive OR 3. $L_"(M-1 } $ s the left hand state in the $ith round for the plaintext MI, and SR_"(M-1 }$ s the right hand state in the ith round for the plaintext MI. 4. $L_"(M-2) $ S the left hand state in the Si$th round for the plaintext M2, and $R_^{M_2JS is the right hand state in the $isth round for the plaintext M2 In other words for each round we need to find the xOR of the states for that round for the respective p aintexts