Related-key impossible differential cryptanalysis of full-round HIGHT

2013 International Conference on Security and Cryptography (SECRYPT) Pub Date : 2013-07-29 DOI:10.5220/0004528805370542

Saeed Rostami, S. B. Chafjiri, Seyed Amir Hossein Tabatabaei

引用次数: 1

Abstract

The HIGHT algorithm is a 64-bit block cipher with 128-bit key length, at CHES'06 as a lightweight cryptographic algorithm. In this paper, a new related-key impossible differential attack on the full-round algorithm is introduced. Our cryptanalysis requires time complexity of 2127.276 HIGHT evaluations which is slightly faster than exhaustive search attack. This is the first related-key impossible differential cryptanalysis on the full-round HIGHT block cipher.

查看原文本刊更多论文

全圆ight的相关密钥不可能差分密码分析

ight算法是一种64位分组密码，密钥长度为128位，是一种轻量级的加密算法。本文提出了一种新的针对全轮算法的关联密钥不可能差分攻击。我们的密码分析需要2127.276 high评估的时间复杂度，比穷举搜索攻击略快。这是第一个关于全轮HIGHT分组密码的相关密钥不可能差分密码分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊