$\begingroup$

Closed. This question is This question is off-topic . It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Cryptography Stack Exchange. Closed 6 years ago. Improve this question

How do we verify practically the strength of a block ciphers? Most of the security analysis of block ciphers is usually around theoretical analysis and proofs in some random oracle model etc.

For example, for our recently designed FNR encryption scheme, we have only given results based on previously done theoretical work by Naor and Reingold. That is if $r$ is round count, $n$ is number of bits of input domain, $m$ is number of queries an attacker needs to make, then the security measure for FNR, is defined as below.

\begin{equation} \begin{split} & ( r/2 * m^2 / 2^{(1- 1/r)* n }) \; \textit{ where r $\geq$ 4 } \end{split} \end{equation}

But how do we practically verify this by experimental results? What about cryptanalysis tools?

I believe such tools would help any one who is designing block ciphers in general.