New answers tagged

2

This is the code i used to simulate your Sbox (no intelligence, pure application with lots of mask for security). virtual uint8 apply_s(uint16 input, int numBits) { uint16 mask = 1; for (int i = 1; i < numBits; ++i) { mask |= mask << 1; } uint32 res = input & mask; res = res * res; res = (res >> ...


3

Remark: The round function of your toy cipher is the following. | K ---> + | ------- | S | ------- | >> 2 | Hence in the last round, the shift and S-box are useless (because invertible hence do not add security) which is why in a SPN scheme the key addition at the end is preferred. I did ...



Top 50 recent answers are included