Paper 2011/323

A New Related-Key Boomerang Distinguishing Attack of Reduced-Round Threefish-256

Shusheng Liu, Libin Wang, and Zheng Gong


On Nov 2007, NIST announced the SHA-3 competition to select a new hash standard as a replacement of SHA-2. On Dec 2010, five submissions have been selected as the final round candidates, including Skein, which have components based on ARX. In this paper, a new related-key boomerang distinguishing attack is proposed on 31-round Threefish-256 with a time complexity of about $2^{234}$. Our improved attack is based on the efficient algorithms for calculating differentials of modular addition.

Note: Updated version

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
SkeinDifferential analysisRelated keyBoomerang attack
Contact author(s)
cis gong @ gmail com
2011-11-20: last of 2 revisions
2011-06-17: received
See all versions
Short URL
Creative Commons Attribution


      author = {Shusheng Liu and Libin Wang and Zheng Gong},
      title = {A New Related-Key Boomerang Distinguishing Attack of Reduced-Round Threefish-256},
      howpublished = {Cryptology ePrint Archive, Paper 2011/323},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.