The musash project is to enable users to produce hashes of text, file or single character easier. Rather than other software, which allows them to use the software specific hashing algorithm, musash allows users to either use MD5, SHA1, SHA256, SHA384 and SHA512. What's more, musash also allows users to produce single hash using multiple algorithm. In this manner, the second and the subsequent algorithm will based on the previous hash produced by the algorithm before it and produce another hash. Since capital letters and small letters in a hash matters alot, users also have control over it.
First Release - musash 1.0 unstable
Unfortunately, when we say unstable, we do not mean that it is in beta. Instead, we really mean it. Maybe you can call it musash stable unstable. However, normal functions are all stable. Find out why musash can be unstable here.
Download musash 1.0 unstable binaries (for Windows 2000 and above, with .net 2.0 framework installed) (347,932 bytes)
- or -
Download musash 1.0 source code (C# 2005 codes) here. (1,459,549 bytes)
Digest
As mentioned before, musash enables users to digest text, files and a single character easier using MD5, SHA1 and the SHA2 family algorithms with multiple algorithm hashing capabilities. Hashing a single character is simple, especially for characters that are not available on the keyboard. All you have to specify is the byte number (0 to 255) that will give you the byte representation.
Compare
Works on top of the digest mechanism, the compare function allows you to compare a file to another file, a file to a hash, text to a hash and a single character to a hash and will return a message if they match or not. Only comparing a file to another file will not require any hash or algorithm to be used as the comparision will check from byte to byte of each file.
Search
As we all know, hashes are so secure and lossy such that it is very hard to "crack" them. The search capability of the software, will try to search for the string of the hash that you have provided, by going through every single possible strings. This will work, when you specify the number of characters of the string that evaluates to the hash, and then musash will look for the string that contains the number of character only. However, this time to complete searching all possible string for 1 character can take up to a few seconds but as the number of characters rises, the time can increase exponentially to even a few thousand years, even on our computer! But musash, will the terminate the process once it finds the string, so, in very rare cases, you won't have to wait until you die! most probably your computer will die first. (See why they always want you to keep your password 7 characters or more?)
This process is highly unstable in this release as once you go above 8 characters, musash can hang because it number of possible string is too high (14 is the max). You can try to disable all the status messages to see if it helps alot (most probably no). musash also allows you to search using multiple instances (up to 10 instances) to search of a single string of hash. This, however, does not mean that you can complete the task faster, (you are still using one computer!), but this can possibly increase your CHANCE of retrieving the string faster. If you want to understand on how musash search function works, click here.
Future Release - musash SI
The future release of musash (codenamed SI) will attempt to rid the the stability problem of the current version by using a made-up class of integer (based on string) called SuperInteger, which is similar to Java's BigInteger, only that it is written in C#. Once complete, SuperInteger class file will also be release on this site.
|
musash