Related-key impossible differential cryptanalysis of full-round HIGHT

Sadegh Bamohabbat Chafjiri; Saeed Rostami; Seyed Amir Hossein Tabatabaei

Related-key impossible differential cryptanalysis of full-round HIGHT

Sadegh Bamohabbat Chafjiri
, Saeed Rostami^*
, Seyed Amir Hossein Tabatabaei

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 2^127.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.

Original language	English
Title of host publication	2013 International Conference on Security and Cryptography (SECRYPT, Reykjavik, Iceland)
Place of Publication	Lisbon, Portugal
Publisher	SciTePress
Pages	537–542
Number of pages	6
Edition	First edition
ISBN (Electronic)	9789897581311
ISBN (Print)	9789898565730
Publication status	Published (VoR) - 27 Aug 2015

Keywords

HIGHT
Block cipher
Related-key
Impossible Differential
Cryptanalysis

Access to Document

https://ieeexplore.ieee.org/document/7223212

Cite this

@inproceedings{4dd71b692352473eb0e1d920f536a514,

title = "Related-key impossible differential cryptanalysis of full-round HIGHT",

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 2\textasciicircum{}127.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.",

keywords = "HIGHT, Block cipher, Related-key, Impossible Differential, Cryptanalysis",

author = "\{Bamohabbat Chafjiri\}, Sadegh and Saeed Rostami and Tabatabaei, \{Seyed Amir Hossein\}",

year = "2015",

month = aug,

day = "27",

language = "English",

isbn = "9789898565730",

pages = "537–542",

booktitle = "2013 International Conference on Security and Cryptography (SECRYPT, Reykjavik, Iceland)",

publisher = "SciTePress",

edition = "First edition",

}

Related-key impossible differential cryptanalysis of full-round HIGHT. / Bamohabbat Chafjiri, Sadegh; Rostami, Saeed; Tabatabaei, Seyed Amir Hossein.
2013 International Conference on Security and Cryptography (SECRYPT, Reykjavik, Iceland). First edition. ed. Lisbon, Portugal: SciTePress, 2015. p. 537–542.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Related-key impossible differential cryptanalysis of full-round HIGHT

AU - Bamohabbat Chafjiri, Sadegh

AU - Rostami, Saeed

AU - Tabatabaei, Seyed Amir Hossein

PY - 2015/8/27

Y1 - 2015/8/27

N2 - 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 2^127.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.

AB - 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 2^127.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.

KW - HIGHT

KW - Block cipher

KW - Related-key

KW - Impossible Differential

KW - Cryptanalysis

M3 - Conference contribution

SN - 9789898565730

SP - 537

EP - 542

BT - 2013 International Conference on Security and Cryptography (SECRYPT, Reykjavik, Iceland)

PB - SciTePress

CY - Lisbon, Portugal

ER -

Related-key impossible differential cryptanalysis of full-round HIGHT

Abstract

Keywords

Access to Document

Fingerprint

Cite this