| Home Page |
Author: Benjamin Bloom
Committee
Chair: Prof. Alan Kaminsky
Reader: Prof. Warren Carithers
Observer: Prof. Reynold Bailey
Title: SAT Solver Attacks on CubeHash
Defense Date: May 20, 2010
Abstract: The use of a SAT solver to attack a hash function is a fairly unexplored field in computer science. This paper examines the use of a state of the art SAT solver to attempt to break a strong hash function. The way that the Boolean expression is set up to encompass the function is covered, as well as various results that show specific cases to be unbreakable; other cases are breakable, and example collisions are given. This paper is based on a project which generates the Boolean expression for specific function parameters, and is able to interpret the SAT solver output to retrieve and show the actual collision generated.
Proposal: proposal.pdf
Report: report.pdf
Defense Presentation: presentation.pdf
| Home Page |