文章基本信息

标题：Study and Performance Analysis of IDEA with Variable Rounds
本地全文：下载
作者：Kamal Deep Sharma ; Harsh K Verma ; Ashish Kumar 等
期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：5
出版社：S.S. Mishra
摘要：IDEA is a 64-bit block ciph er wi th 128-bit keys introduc ed by Lai and Massey in 1991. IDEA is one of th e mo st widely u sed block ciphers, due to its in clusi on in several cryptographic packages, such as PGP. S ince its in trodu ction in 1991, IDEA has with st ood exten sive crypt- analytic effort, bu t no a ttack was foun d on the full (8.5-rou nd) varian t of the ci pher. In 2006 Eli Biham, Orr Dunkelman and Nathan Keller pre sent the first known attack on 6-round IDEA faster than exhaustive key search. The a ttack expl oits the weak k ey- sched ule algorithm of IDEA, and combines Square-like techn iques with linear cryptan alysi s to in crea se th e number of rounds that can be atta cked. In th is paper we are analyzin g the performance of IDEA algorithm by makin g its roun ds va riable. By thi s we are t rying to in crease th e secu rity of IDEA al gorith m.
关键词：Cryptograph y; Block Ciph er; I DEA; IPES; PES