• DocumentCode
    1847436
  • Title

    Related-key impossible differential cryptanalysis of full-round HIGHT

  • Author

    Rostami, Saeed ; Chafjiri, Sadegh Bamohabbat ; Tabatabaei, Seyed Amir Hossein

  • Author_Institution
    R&D Department, Tehran, Iran
  • fYear
    2013
  • fDate
    29-31 July 2013
  • Firstpage
    1
  • Lastpage
    6
  • 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.
  • Keywords
    Ciphers; Encryption; Schedules; Time complexity; Cryptanalysis; HIGHT; Impossible Differential; Lightweight Block Cipher; Related-key;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Security and Cryptography (SECRYPT), 2013 International Conference on
  • Conference_Location
    Reykjavik, Iceland
  • Type

    conf

  • Filename
    7223212
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1847436