Decryption of Scramble Algorithms
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Scramble algorithms,which are also called pure-position permutation algorithms,are commonly used as an image ancryption,are investigated in this paper.Unfortunately, they are frail under known-text attack.According to the weakness of pure position permutation algorithm,We put forward an effective decryption algorithm for aIl pure-position permutation algorithms.First,a summary of the pure position permutation image encryption algorithms is given by introducing the concept ofergodic nieces.Secondly,by using probability theory and algebra knowledge,the declyption probabilit:of pure-position permutation algorithms is verified theoretically. Then,by defining operation system of fuzzy ergodic matrices,we improve a specific decryption algorithm.Finally some simulation results are shown.

    Reference
    Related
    Cited by
Get Citation

赵一鸣,赵晓宇,龚松春.纯位置置乱变换的破解算法.软件学报,2004,15(zk):149-156

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063