Resistance of Statistical Attacks of Parastrophic Quasigroup Transformation
This addresses cryptographic security for encryption systems by demonstrating resistance to statistical attacks, but it appears incremental as it builds on a previously proposed transformation.
The paper proves that applying the PE-transformation n times results in a uniform distribution of l-tuples, which implies resistance to statistical attacks, with experimental results provided for illustration.
In this paper, we prove an important cryptographic property of $PE$-transformation proposed elsewhere. If $PE$-transformation is used as encrypting function then after $n$ applications of it on arbitrary message the distribution of $l$-tuples ($l=1,2,\dots, n$) is uniform. This property implies the resistance of statistical kind of attack of this transformation. For illustration of theoretical results, some experimental results are presented as well.