The composite field multiplication is an important and complex module in symmetric cipher algorithms, and its realization performance directly restricts the processing speed of symmetric cipher algorithms. Based on th...The composite field multiplication is an important and complex module in symmetric cipher algorithms, and its realization performance directly restricts the processing speed of symmetric cipher algorithms. Based on the characteristics of composite field multiplication in symmetric cipher algorithms and the realization principle of its reconfigurable architectures, this paper describes the reconfigurable composite field multiplication over GF（（2^8）k） （k=1,2,3,4） in RISC （reduced instruction set computer） processor and VLIW （very long instruction word） processor architecture, respectively. Through configuration, the architectures can realize the composite field multiplication over GF（2^8）, GF （（2^8）2）, GF（（28）3） and GF（（28）4） flexibly and efficiently. We simulated the function of circuits and synthesized the reconfigurable design based on the 0.18 μm CMOS （complementary metal oxide semiconductor） standard cell library and the comparison with other same kind designs. The result shows that the reconfigurable design proposed in the paper can provide higher efficiency under the premise of flexibility.展开更多
The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanal...The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001.展开更多
There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution o...There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution of S-box,thus disordering the internal structure of data blocks by four steps of matrix transformation.Then,the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function.The dynamic key was finally generated by using LFSR,which improved the stochastic characters of secret key in each of round of iteration.The safety performance of proposed algorithm was analyzed by simulation test.The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security.Meanwhile,the proposed algorithm has highly scalability,the dimension of S-box and the number of register can be dynamically extended according to the security requirement.展开更多
The Tiny Encryption Algorithm (TEA) is a Feistel block cipher well known for its simple implementation, small memory footprint, and fast execution speed. In two previous studies, genetic algorithms (GAs) were employed...The Tiny Encryption Algorithm (TEA) is a Feistel block cipher well known for its simple implementation, small memory footprint, and fast execution speed. In two previous studies, genetic algorithms (GAs) were employed to investigate the randomness of TEA output, based on which distinguishers for TEA could be designed. In this study, we used quan-tum-inspired genetic algorithms (QGAs) in the cryptanalysis of TEA. Quantum chromosomes in QGAs have the advan-tage of containing more information than the binary counterpart of the same length in GAs, and therefore generate a more diverse solution pool. We showed that QGAs could discover distinguishers for reduced cycle TEA that are more efficient than those found by classical GAs in two earlier studies. Furthermore, we applied QGAs to break four-cycle and five-cycle TEAs, a considerably harder problem, which the prior GA approach failed to solve.展开更多
This article explains the imbalance in DES and introduces the operators in IDEA. At last it puts forward a Unsym-metrical Block Encryption Algorithm which is achieved by adding some operators to DES.
Wireless Multimedia Sensor Network (WMSN) is an advancement of Wireless Sensor Network (WSN) that encapsulates WSN with multimedia information like image and video. The primary factors considered in the design and dep...Wireless Multimedia Sensor Network (WMSN) is an advancement of Wireless Sensor Network (WSN) that encapsulates WSN with multimedia information like image and video. The primary factors considered in the design and deployment of WSN are low power consumption, high speed and memory requirements. Security is indeed a major concern, in any communication system. Consequently, design of compact and high speed WMSN with cryptography algorithm for security, without compromising on sensor node performance is a challenge and this paper proposes a new lightweight symmetric key encryption algorithm based on 1 D cellular automata theory. Simulations are performed using MatLab and synthesized using Xilinx ISE. The proposed approach supports both software and hardware implementation and provides better performance compared to other existing algorithms in terms of number of slices, throughput and other hardware utilization.展开更多
低能耗轻量级分组密码(low energy lightweight block cipher,LELBC)算法是一种基于置换-替换-置换(permutation-substitution-permutation,PSP)结构的轻量级分组密码算法,主要适用于计算能力、存储空间及功耗受限的物联网终端设备,通...低能耗轻量级分组密码(low energy lightweight block cipher,LELBC)算法是一种基于置换-替换-置换(permutation-substitution-permutation,PSP)结构的轻量级分组密码算法,主要适用于计算能力、存储空间及功耗受限的物联网终端设备,通过对数据加密实现数据安全保障,因此对该算法安全性的准确评估尤为关键。为了深入研究该算法的安全性,首先建立S盒的差分-线性连通表,然后基于约束规划(constraint programming,CP)方法对S盒组件、中间层和整体结构进行数学建模,搜索得到概率为2-25.96的9轮差分-线性区分器,并进一步在这个区分器的基础上分别向前添加1轮,向后添加2轮,实现了对LELBC算法的12轮密钥恢复攻击,其中数据复杂度为228个明文,时间复杂度为2114.42次12轮加密。研究结果表明,相较于整体16轮,LELBC算法仍然具有足够轮数的安全冗余。展开更多
基金Supported by the National Natural Science Foundation of China(61202492,61309022,61309008)the Natural Science Foundation for Young of Shaanxi Province(2013JQ8013)
文摘The composite field multiplication is an important and complex module in symmetric cipher algorithms, and its realization performance directly restricts the processing speed of symmetric cipher algorithms. Based on the characteristics of composite field multiplication in symmetric cipher algorithms and the realization principle of its reconfigurable architectures, this paper describes the reconfigurable composite field multiplication over GF（（2^8）k） （k=1,2,3,4） in RISC （reduced instruction set computer） processor and VLIW （very long instruction word） processor architecture, respectively. Through configuration, the architectures can realize the composite field multiplication over GF（2^8）, GF （（2^8）2）, GF（（28）3） and GF（（28）4） flexibly and efficiently. We simulated the function of circuits and synthesized the reconfigurable design based on the 0.18 μm CMOS （complementary metal oxide semiconductor） standard cell library and the comparison with other same kind designs. The result shows that the reconfigurable design proposed in the paper can provide higher efficiency under the premise of flexibility.
基金Supported by the National Natural Science Foundation of China (60573032, 90604036)Participation in Research Project of Shanghai Jiao Tong University
文摘The security of international date encryption algorithm （IDEA（16））, a mini IDEA cipher, against differential cryptanalysis is investigated. The results show that [DEA（16） is secure against differential cryptanalysis attack after 5 rounds while IDEA（8） needs 7 rounds for the same level of security. The transition matrix for IDEA（16） and its eigenvalue of second largest magnitude are computed. The storage method for the transition matrix has been optimized to speed up file I/O. The emphasis of the work lies in finding out an effective way of computing the eigenvalue of the matrix. To lower time complexity, three mature algorithms in finding eigenvalues are compared from one another and subspace iteration algorithm is employed to compute the eigenvalue of second largest module, with a precision of 0.001.
基金supported in part by National Natural Science Fundation of China under Grant No.61202458,61403109
文摘There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution of S-box,thus disordering the internal structure of data blocks by four steps of matrix transformation.Then,the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function.The dynamic key was finally generated by using LFSR,which improved the stochastic characters of secret key in each of round of iteration.The safety performance of proposed algorithm was analyzed by simulation test.The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security.Meanwhile,the proposed algorithm has highly scalability,the dimension of S-box and the number of register can be dynamically extended according to the security requirement.
文摘The Tiny Encryption Algorithm (TEA) is a Feistel block cipher well known for its simple implementation, small memory footprint, and fast execution speed. In two previous studies, genetic algorithms (GAs) were employed to investigate the randomness of TEA output, based on which distinguishers for TEA could be designed. In this study, we used quan-tum-inspired genetic algorithms (QGAs) in the cryptanalysis of TEA. Quantum chromosomes in QGAs have the advan-tage of containing more information than the binary counterpart of the same length in GAs, and therefore generate a more diverse solution pool. We showed that QGAs could discover distinguishers for reduced cycle TEA that are more efficient than those found by classical GAs in two earlier studies. Furthermore, we applied QGAs to break four-cycle and five-cycle TEAs, a considerably harder problem, which the prior GA approach failed to solve.
文摘This article explains the imbalance in DES and introduces the operators in IDEA. At last it puts forward a Unsym-metrical Block Encryption Algorithm which is achieved by adding some operators to DES.
文摘Wireless Multimedia Sensor Network (WMSN) is an advancement of Wireless Sensor Network (WSN) that encapsulates WSN with multimedia information like image and video. The primary factors considered in the design and deployment of WSN are low power consumption, high speed and memory requirements. Security is indeed a major concern, in any communication system. Consequently, design of compact and high speed WMSN with cryptography algorithm for security, without compromising on sensor node performance is a challenge and this paper proposes a new lightweight symmetric key encryption algorithm based on 1 D cellular automata theory. Simulations are performed using MatLab and synthesized using Xilinx ISE. The proposed approach supports both software and hardware implementation and provides better performance compared to other existing algorithms in terms of number of slices, throughput and other hardware utilization.
