首页 | 本学科首页   官方微博 | 高级检索  
     

对折置乱算法及置乱度分析
引用本文:刘廷银,徐佩霞. 对折置乱算法及置乱度分析[J]. 信息安全与通信保密, 2006, 0(12): 188-190
作者姓名:刘廷银  徐佩霞
作者单位:中国科学技术大学电子工程与信息科学系,安徽,合肥,230027
摘    要:论文通过对准逆序置乱算法的研究,提出了一种新颖的置乱处理算法—对折置乱算法。针对一维序列置乱算法分别按行列对图像置乱所固有的弊端进行了改进,获得了良好的置乱效果,并具有保密功能。同时提出了一个置乱度评估指标,该指标实现了严格意义上的归一化,计算简单而有效。

关 键 词:置乱  对折置乱算法  置乱度
文章编号:1009-8054(2006)12-0188-03
修稿时间:2006-05-25

Folio Scrambling Algorithm and Degree of Scrambling Analysis
Liu TingYin,Xu PeiXia. Folio Scrambling Algorithm and Degree of Scrambling Analysis[J]. China Information Security, 2006, 0(12): 188-190
Authors:Liu TingYin  Xu PeiXia
Abstract:In this paper, a novel scrambling processing algorithm called Folio Scrambling Algorithm (FSA) is proposed after researching the Quasi-anti-order Scrambling Algorithm (QSA). We find that one-dimensional sequence scrambling algorithms have inherent fault if scramble an image by row or column. An elementary improve upon these algorithms has been achieved by using private key, which make the scrambling system have the function of encryption. Proposing an assessment indicator upon scrambling processing. The indicator's proposing is meaningful in two aspects, one is the achievement of proper normalization, the other is estimating the effects of one-dimensional sequence algorithms conveniently. Experiment results shows that the algorithm is effective.
Keywords:Scrambling  Folio Scrambling Algorithm(FSA)  Degree of Scrambling
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号