• DocumentCode
    3513306
  • Title

    Lagrange Interpolation Attack against 6 Rounds of Rijndael-128

  • Author

    Jingmei Liu ; Shaopeng Chen ; Linsen Zhao

  • Author_Institution
    Nat. Key Lab. of Integrated Service Networks, Xidian Univ., Xi´an, China
  • fYear
    2013
  • fDate
    9-11 Sept. 2013
  • Firstpage
    652
  • Lastpage
    655
  • Abstract
    By chosing all the 232 plaintexts of the four bytes in the first round, it can generate 224 Λ1 sets. Each Λ1 set will make all the input bytes balanced in the fifth round, so all the 232 input plaintexts will be balanced before the fifth round. If we combine partial sum technique, the Lagrange interpolation attack can be completed. The research results show that the attacking complexity can be decreased to 250, and it is better than the best of the existing result which is 272.
  • Keywords
    cryptography; Lagrange interpolation attack; Rijndael-128; attacking complexity; input plaintexts; partial sum technique; Ciphers; Complexity theory; Encryption; Galois fields; Interpolation; Polynomials; AES; Lagrange interpolation attack; Rijndael; Square attack;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Networking and Collaborative Systems (INCoS), 2013 5th International Conference on
  • Conference_Location
    Xi´an
  • Type

    conf

  • DOI
    10.1109/INCoS.2013.122
  • Filename
    6630507