Cryptography Research of John Washburn
My plan for this page is to create links to papers and articles on the topic of cryptography and cryptanalysis.
Here is a link to my paper on Fuzzy Cryptanalysis
Here is a link to the FuzzyCrypto Project to the Java library implementing fuzzy cryptanalysis found on the Source Forge
Here is a link to the SVN repository to the Java library implementing fuzzy cryptanalysis found on the Source Forge
Here is a link to the API documentation to the Java library implementing fuzzy cryptanalysis
Here is the paper as I submitted it to the Crypto 2007 conference.
NIST SHA-3 Contest
I have submitted a candidate algorithm to the NIST SHA-3 Competition. The name of the candidate algorithm is WaMM (Washburn Matrix Multiplication)Current Submission
Attacks and Analysis
- The paper describing the WaMM Algorithm.
- The appendix containing the definition of the WaMM operator
- The ZIP archive of the reference implementation
- And in less than 24 hours the algorithm is broken. Here is the initial write-up by Professor David Wilson at MIT, exploiting my poor decision to use the XOR operator instead of WaMM multiplication in order to mix the 256-block into the current state matrix. This write-up demonstrates my algorithm does not meet the definition of a cryptographic hash function. A second pre-image is trivial to find instead on the being on the order of 2^4096 to find. In order to improve performance (1789 seconds [July] to 149 seconds [October] for 1 GB file), I oversimplified the round function to the point destroying the algorithm.
- Here is the version from of July 18, 2008 which is an order of magnitude too slow. It also contains several typographical errors, but those were ignored because of the performance issues. The WaMM multiplication operator has not changed since June 1, 2008, so the Appendix A is for both versions of the cipher.
A ZIP Archive of 256 pretty good 8-bit to 8-bit Substitution Boxes