Canumb aims to crunch data on various forms and turn them into something meaningful. A variety of inputs are currently supported, such as different number base conversions (decimal to hexadecimal, binary to hexadecimal, octal to decimal, etc.) and various encoded formats (a base64 encoder decoder and a URI encoder decoder). It's built to allow for extension when the future demands other input formats be crunched.
phalanx computes a digest of many buffers simultaneously, and produces a combined hash of them all. It is an initiative to provide a fast, simple, and portable alternative method to compute a checksum in a parallel fashion. It has options for I/O buffer size, hash width, number of threads, and more. It can be run single-threadedly for performance comparisons. It can check files against previously-saved sums, like "MD5sum" does. It also has a "demo" mode, to ascertain accurate operation. It is intended to be useful on large files and multicore/multiprocessor/multithreaded environments.
lihata is a compact textual language which can represent a tree of lists, hashes, and tables. The syntax tries to be minimal and flexible to allow formatting a lihata file to fit the context it represents. The source release contains an event and DoM parser and helper functions for maintaining lihata trees. lihata is a convenient language for both simple and complex configuration files and text representation of data files.
JRainbow is a program that generates Rainbow tables for the MD5 and SHA-1 hash algorithms. These tables then can be used for a Rainbow attack to retrieve hashed passwords. Up to 8 digit password rainbow tables are supported. The tables use a textual format. Six variations of alphanumeric and special character sets are supported. You can choose how many times to hash the input before storing it in the table.