| Computer & Information Science |
|
|
|
|
| Decryption of pure-position permutation algorithms |
| ZHAO Xiao-yu, CHEN Gang, ZHANG Dan, WANG Xiao-hong, DONG Guang-chang |
| Institute of DSP and Software Techniques, Ningbo University, Ningbo 315211, China; Institute of Imaging and Computer Graphics, Zhejiang University, Hangzhou 310027, China; Computer Science College, Zhejiang University, Hangzhou 310027, China |
|
|
|
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.
|
|
Received: 12 February 2004
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
