共查询到19条相似文献,搜索用时 93 毫秒
1.
高级加密标准AES候选算法的比较 总被引:1,自引:0,他引:1
通过了AES第2轮选拔的MARS、RC6TM、Rijndael、Serpent、TwoFish5种加密算法,每种算法各有千秋.作者从多种角度对以上5种算法进行比较,分析了各自的优缺点. 相似文献
2.
通过非线性函数变换改进后的谱间Pearson相关分析可同时获取高光谱影像光谱间的综合相关系数(rcl)、相关类型和统计显著性水平;研究发现,非线性是高光谱影像的谱间相关性的主要类型。基于相关系数的波段相邻相关系数(rac)在自适应波段选择算法(ABS)中是为了表达波段的独立性,然而发现ABS算法中rac并不能有效表达波段独立性。鉴于此,提出了一种信息相邻相关系数(riac)和基于此指数改进的自适应波段选择算法(MABS)。使用公共数据和实验室采集数据,对ABS、基于线性相关系数(rl)的MABS(rl)和基于rcl的MABS(rcl)等三种算法进行实验。结果表明:在波谱范围和算法有效性及精度方面,MABS均优于ABS;MABS较好地兼顾了大信息量和强独立性原则,其波段选择结果的光谱范围明显大于ABS;MABS(rcl)的光谱范围略大于MABS(rl);三种算法的总体分类精度(OA)和Kappa系数的大小顺序均为:MABS(rcl) MABS(rl) ABS。 相似文献
3.
高级加密标准AES候选之一--Rijndael 总被引:3,自引:0,他引:3
介绍了理解Rijndael算法的数学基础和Rijndael算法本身,并介绍了此算法用不同语言编写时的执行性能和对目前几种流行的攻击算法的抵抗能力. 相似文献
4.
高级加密标准AES候选之一--RC6 总被引:1,自引:0,他引:1
RC6是一个安全、简单、灵活的参数化的分组加密算法,它是RC5的发展,以更好地符合AES的要求.本文详细介绍了RC6-w/r/b的加解密算法和密钥扩展算法,以及对其性能的评估. 相似文献
5.
介绍了AES的一个候选算法——Twofish,它是一个128位分组加密算法.该密码由一个16圈的Feistel网络构成.描述了Twofish的加解密过程及子密钥生成过程,同时对其性能和抗攻击能力作了分析. 相似文献
6.
高级加密标准AES候选之一--Serpent 总被引:1,自引:0,他引:1
介绍了一个新的分组加密算法——Serpent,它是AES的一个候选算法,该算法使用256位的密钥对128位的块数据进行加解密;描述了Serpent的加解密过程及子密钥生成过程,同时对其性能作了部分阐述. 相似文献
7.
高级加密标准AES评判规则 总被引:1,自引:0,他引:1
作为DES的替代标准,AES密码算法的选择已成为世人关注的热点问题.美国国家标准与技术协会(NIST)接受了15种候选密码算法的提案,并以统一的规则进行评判,选择优胜者作为AES的算法标准.AES的制定将会成为密码发展史上的又一里程碑.本文对其评判规则做出了简明的阐述. 相似文献
8.
9.
数据加密标准(DES)算法是典型的分组对称式私钥密码机制,在加密学研究领域中占据着十分重要的地位,且对于以融合网络和物联网为代表的下一代网络中各类嵌入式加密应用而言具有很好的适用性。本文简单介绍了DES算法原理及其安全性,主要针对DES算法易受穷举攻击法的不足,依据DES算法本身的特点提出了改进措施,采用双密钥交叉加密,提高加密过程中密钥的复杂度,增强抵抗攻击的能力,达到对DES算法安全性的改善。 相似文献
10.
介绍了DVB数字视频广播条件接收系统中通用加扰算法的原理和实现过程,详细分析了块加密和流加密的实现过程及两者的结合,并编写了C程序,通过软件实现了通用加扰算法. 相似文献
11.
Wei Kuang Lai Kuo‐Shu Tseng Jiunn‐Ching Chen 《Wireless Communications and Mobile Computing》2009,9(2):197-208
The deployment of directional antennas offers many advantages, such as transmission range extension, co‐channel interference reducing, the increasing of spatial reuse degree, throughput improving of networks, and transmission power saving. Hence, many ad hoc MAC protocols with directional antennas have been proposed. However, these protocols do not provide significant improvement of network performance due to the lack of supporting multiple transmissions and receptions simultaneously. With the adaptive beam‐forming system (Smart Antenna), a newly designed MAC protocol (MARS) that enables nodes with multiple transmissions and receptions is proposed. Simulation results show that our MARS do exploit the advantage of space division multiple access. In terms of total number of data forward and complete sessions in bottleneck nodes, MARS achieves three times better than Novel and nine times better than IEEE 802.11. In addition, the end‐to‐end delay keeps very short. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
12.
13.
In this article, a high-speed and highly restricted encryption algorithm is proposed to cipher high-definition (HD) images based on the modified advanced encryption standard (AES) algorithm. AES is a well-known block cipher algorithm and has several advantages, such as high-level security and implementation ability. However, AES has some drawbacks, including high computation costs, pattern appearance, and high hardware requirements. The aforementioned problems become more complex when the AES algorithm ciphers an image, especially HD images. Three modifications are proposed in this paper to improve AES algorithm performance through, decreasing the computation costs, decreasing the hardware requirements, and increasing the security level. First, modification was conducted using MixColumn transformation in 5 rounds instead of 10 rounds in the original AES-128 to decrease the encryption time. Security is enhanced by improving the key schedule operation by adding MixColumn transformation to this operation as second modification. In addition, to decrease the hardware requirements, S-box and Inv. S-box in the original AES are replaced by one simple S-box used for encryption and decryption in the proposed method. The proposed AES version conducts one of the ciphering modes to solve the appearance pattern problem. Experimental results indicate that the proposed modifications to the AES algorithm made the algorithm more compatible with HD image encryption. 相似文献
14.
15.
文章分析了AES算法自身的特点,对轮变换内部的执行进行了合并和简化,并且解开算法内部的轮变换,代之以流水线的方式实现,从而高速实现了AES算法加解密。 相似文献
16.
17.
This paper presents novel techniques for computing the minimum number of memory locations in statically scheduled digital signal processing (DSP) programs. Two related problems are considered. In the first problem, we compute the minimum number of memory locations required for a scheduled program assuming that no circuit transformations (such as pipelining and retiming) are to be performed after scheduling. For this problem, we consider memory minimization for theoperation-constrained, processor-constrained andunconstrained memory models which represent various restrictions on how data can be allocated to memory. Then we consider the second problem, where memory minimization for a scheduled program is considered simultaneously with retiming using a variation of the retiming problem referred to as theminimum physical storage location (MPSL) retiming. While both problems consider memory minimization for scheduled programs, the second problem minimizes memory using retiming whereas the first problem performs no retiming. The scheduling results obtained from the MARS design system are used to compare memory requirements in the context of both of these problems. Our experiments show that MARS performs an optimal retiming for the schedule it generates. These memory requirements are then compared with an integer linear programming solution to the scheduling problem which is optimal under the unconstrained memory model. It is concluded that the schedule obtained by the MARS system achieves optimality or near-optimality with respect to register minimization. 相似文献
18.
DES已被攻破,AES即将诞生 总被引:4,自引:0,他引:4
介绍了DES及其发展,以及利用Internet联网计算机的空闲CPU时间攻破DES的情况。从1997年初,美国已经开始计划建立新的加密标准AES,并在世界范围内公开征集AES算法。本文对此也作了介绍,并介绍了AES标准的提纲。 相似文献
19.
Conventional cryptographic algorithms are not sufficient to protect secret keys and data in white‐box environments, where an attacker has full visibility and control over an executing software code. For this reason, cryptographic algorithms have been redesigned to be resistant to white‐box attacks. The first white‐box AES (WB‐AES) implementation was thought to provide reliable security in that all brute force attacks are infeasible even in white‐box environments; however, this proved not to be the case. In particular, Billet and others presented a cryptanalysis of WB‐AES with 230 time complexity, and Michiels and others generalized it for all substitution‐linear transformation ciphers. Recently, a collision‐based cryptanalysis was also reported. In this paper, we revisit Chow and others’ first WB‐AES implementation and present a conditional re‐encoding method for cryptanalysis protection. The experimental results show that there is approximately a 57% increase in the memory requirement and a 20% increase in execution speed. 相似文献