0
$\begingroup$

in advance, excuse my eventuelly bad english. It's not my mother tongue.

I work on a coolege Computer Science Project. For this, i need to know the upper bound of the complexity for the MFC( Formal coding method. I'm from germany, so this may change) DSA with linear S-Boxes. I know the general upper bound is something like $6 \times 2^{56}$.

Does someone know how i can calcualte or "know it" ?

Greetings and thanks in advance!

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.