文主要介绍了基于IDEA(Internation Data Encryption Algorithm)加密方法的网络中一种密钥分配方案。它将整个网络系统中的密钥不会以明文的形式出现进行传送,而是以被高级密钥加密的形式传输和保存。从而较好的提供了一种安全稳定的密...文主要介绍了基于IDEA(Internation Data Encryption Algorithm)加密方法的网络中一种密钥分配方案。它将整个网络系统中的密钥不会以明文的形式出现进行传送,而是以被高级密钥加密的形式传输和保存。从而较好的提供了一种安全稳定的密钥管理方案。展开更多
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.展开更多
基金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.
