Abstract

The lightweight block ciphers, which have the characteristics of lightweight structure and low power consumption, are especially suitable for resource-constrained environments. Bit-based division property with Mixed Integer Linear Programming (MILP) model is constructed according to the structural characteristics of the ciphers, which gives an automatic search method for the longest 10-round integral distinguisher of GRAN-ULE and the 9-round integral distinguisher of ESF, respectively. Based on the 8-round integral distinguisher, 12-round integral attack of GRANULE is obtained by extending backward 4-round. Employing the key equivalence relation to reduce the complexity, the time complexity is about 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">58.17</sup> and the data complexity is about 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">62.17</sup> chosen plaintexts of GRANULE. Compared with other attack methods of current GRANULE and ESF, this is the optimal analysis result of the two ciphers on the length of distinguisher and the number of attack rounds.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.