Related Experiment Videos
Decryption of pure-position permutation algorithms
Xiao-Yu Zhao1, Gang Chen, Dan Zhang
1Institute of DSP and Software Techniques, Ningbo University, Ningbo 315211, China. zhxiaoyu@math.zju.edu.cn.
Abstract:
Pure position permutation image encryption algorithms, commonly used as image encryption investigated in this work are unfortunately frail under known-text attack. In view of the weakness of pure position permutation algorithm, we put forward an effective decryption algorithm for all pure-position permutation algorithms. First, a summary of the pure position permutation image encryption algorithms is given by introducing the concept of ergodic matrices. Then, by using probability theory and algebraic principles, the decryption probability of pure-position permutation algorithms is verified theoretically; and then, by defining the operation system of fuzzy ergodic matrices, we improve a specific decryption algorithm. Finally, some simulation results are shown.
Related Concept Videos
Synthetic Disvision of Polynomials
Position and Displacement Vectors
Further, several important kinds of...
Position and Displacement Vectors
Further, several important kinds of...
Position Vectors
For instance, we want to locate a point P(x, y, z) relative to the origin of coordinates O. In that case, we can define a position...
¹H NMR: Pople Notation
A proton...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility