A redundant cryptographic symmetric algorithm that confounds statistical tests

We introduce a new symmetric cryptographic algorithm, based on the biological principle of redundancy presents in pre-mRNA ribbon. This algorithm has very good security and statistical properties. In addition it suggests a non trivial information theoretical interpretration of the redundancy mechanism in DNA sequences which does not seem to be present in the biological literature: according to this interpretation the introns do not directly code information, but play an essential role in the decoding procedure. Furthermore, using strategic functions, the algorithm is able to confound the standard statistical tests (like Test-U01 or Die-Harder) responding in a nonsignificant way. The final result shows that rely on statistical tests as well as there´s never sufficient, sometimes is also not necessary.