• DocumentCode
    494914
  • Title

    Related-Key Cryptanalysis of RAIDEN

  • Author

    Karroumi, M. ; Malherbe, Christo

  • Author_Institution
    Technol. Group, Thomson R&D France, Cesson-Sevigne, France
  • fYear
    2009
  • fDate
    24-26 June 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    RAIDEN is a recent light-weight 128-bit block cipher. We report in this paper a critical weakness in its key schedule. Besides it reduces a 128-bit key down to 112-bit security, the weakness allows us to mount two related-key attacks. The best of the two attacks has a complexity of about 265. More precisely, the algorithm can be broken with one unknown plaintext, at most 33 unknown related keys, and about 265 trial encryptions. This is the first successful attack on RAIDEN. We also suggest some changes for the key schedule so that our attacks are no more applicable.
  • Keywords
    cryptography; 128-bit block cipher; 265 trial encryptions; RAIDEN; key attack; key schedule; related-key cryptanalysis; Algorithm design and analysis; Cryptography; Design optimization; Laboratories; Proposals; Protocols; Research and development; Resists; Scheduling; Security;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network and Service Security, 2009. N2S '09. International Conference on
  • Conference_Location
    Paris
  • Print_ISBN
    978-2-9532-4431-1
  • Type

    conf

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