Liu Zhiqiang, Gu Dawu, Zhang Jing. Multiple Linear Cryptanalysis of Reduced-Round SMS4 Block Cipher[J]. Chinese Journal of Electronics, 2010, 19(3): 389-393.
Citation: Liu Zhiqiang, Gu Dawu, Zhang Jing. Multiple Linear Cryptanalysis of Reduced-Round SMS4 Block Cipher[J]. Chinese Journal of Electronics, 2010, 19(3): 389-393.

Multiple Linear Cryptanalysis of Reduced-Round SMS4 Block Cipher

  • Received Date: 1900-01-01
  • Rev Recd Date: 1900-01-01
  • Publish Date: 2010-07-05
  • SMS4 is a 32-round block cipher with 128-bit block size and key size. It has been widely implemented in Chinese WLAN industry. In this paper, we present a modified branch-and-bound algorithm which can be used for searching multiple linear characteristics for SMS4-like block ciphers. Furthermore, we find a series of 5-round iterative linear characteristics of SMS4. Then based on these 5-round iterative linear characteristics, a list of 18-round linear characteristics of SMS4 can be constructed. According to the framework of Biryukov et al from Crypto 2004, a key recovery attack can be mounted on 22-round SMS4 by utilizing the above 18-round linear characteristics. The data complexity of our attack is 2112 known plaintexts. Compared with the previously best cryptanalytic results on 22-round SMS4 (that is, the previously best cryptanalytic results on SMS4), our result has much lower data complexity as well as comparable time complexity and memory complexity.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (659) PDF downloads(1004) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return