More Differential Paths of TIB3

Harry Wiggins; Philip Hawkes; Gregory G.  Rose; Cameron McDonald

Paper 2009/417

More Differential Paths of TIB3

Harry Wiggins, Philip Hawkes, Gregory G. Rose, and Cameron McDonald

Abstract

The TIB3-256 hashing algorithm [3] is a first round candidate in the SHA-3 competition [2]. Properties of the message expansion and the PHTX function are observed, and then exploited to create new high-probability differential paths through the compression function. Examples conforming to the differential paths are presented. Only one of these differential paths can be applied to the tweaked version of TIB3v2 [4]. Due to the dual-block input mode used in TIB3 and TIB3v2, these differential paths do not seem extensible to the full hash functions. Note: In the time between when this paper was written and when the paper was made public, the SHA-3 Round 2 Candidates were announced, and TIB3 had been eliminated from the competition.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: hash functions TIB3
Contact author(s): phawkes @ qualcomm com
History: 2009-09-01: received
Short URL: https://ia.cr/2009/417
License: CC BY

BibTeX

@misc{cryptoeprint:2009/417,
      author = {Harry Wiggins and Philip Hawkes and Gregory G.  Rose and Cameron McDonald},
      title = {More Differential Paths of {TIB3}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/417},
      year = {2009},
      url = {https://eprint.iacr.org/2009/417}
}