Harry Wiggins

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1