Hasher

  •        0

Hasher es capaz de generar el hash MD5 y SHA de textos de hasta 100.000 caracteres y ficheros. También te permitirá comprobar dos hash para verificar si son iguales.

http://hasher.codeplex.com/

Tags
Implementation
License
Platform

   

comments powered by Disqus


Related Projects

QFileHasher


A program to calculate and verify checksums of multiple files with wizard-like GUI. Supports 12 hashes: CRC32, MD2, MD4, MD5, SHA1, SHA2, RIPEMD,Whirlpool, ED2K, AICH, Tiger, TTH. Allows processing of nested directories and updating of checksum files

Classless-hasher - .NET Hash and Checksum Algorithm Library


Hasher is a .NET class library to help programmers implement standard hashing and checksum algorithms into their own software. Written entirely in C#, Hasher providers a uniform interface to easily use any of the algorithms contained within this library in other programs. Project hosting has been moved to Bitbucket:https://bitbucket.org/jayclassless/classless-hasher/

Md5hasher - md5 file hasher for windows


DescriptionMD5 Hasher is a small windows tool that lets you find the md5 hash of a file and verify its originality. Features -Drag n' drop support Requirements -.NET Framework 3.5 (You can get it here)

Pyclickatell - Python module which can be used to send SMS messages via the Clickatell HTTPS API


Python module which can be used to send SMS messages via the Clickatell HTTPS API. Does not requires pycurl (as the original version), but uses urllib instead. Example usageimport md5from clickatell import Clickatellct = Clickatell("username", "password", 'clientid')phone = "999999"text = "Test"if not ct.auth(): raise Exception("Can't authenticate!")hasher = md5.new()hasher.update(phone)hasher.update(text)msg_id = hasher.hexdigest()message = { 'to': str(phone), 'text': str(text), 'climsgid': str

OpenHublist.org website and crawler


This is the openhublist.org website. It includes all the files needed to run your own hublist (backend, frontend files and crawer). Public Pinger for ADC/ADCS (Advanced Direct Connect / Secure ) Hubs written in PHP ( with Java hasher ). Visit http://www.openhublist.org for more information

Classless.Hasher


Hasher is a .NET class library to help programmers implement standard hashing and checksum algorithms into their own software. Written entirely in C#, Hasher providers a uniform interface to easily use any of the algorithms contained within this library

Power Hasher


Power Hasher is a program that allow you to get the hash code of multiple files at once, and export the results to a file, making easy for this file to be imported and the files checked. Currently it supports MD5, SHA1, SHA256, SHA384 and SHA512.

Soundfingerprinting - Sound Fingerprinting System


For easier coding contribution the project has moved to GitHub Fork here: https://github.com/AddictedCS/soundfingerprinting This repository is no longer updated. Happy coding. The project aims studying the audio signal in terms of its perceptual identity resulting in an algorithm that will be able to detect (map) unknown audio snippets from a large database of known songs. Relies on the following libraries: Bass.Net Mileston 3.0 target Develop tools that will ensure that the fingerprint creation

Pyssdeep - python bindings for kornblum's ssdeep fuzzy hasher


Aboutssdeep was written by Jesse Kornblum. this is a set of python bindings for it. the python bindings work with ssdeep 2.0-2.2. Examplefrom ssdeep import ssdeeps = ssdeep()# basic hash generationfor i in sys.argv[1:]: print '%s %20s' % (i, s.hash_file(i))h1 = s.hash_file('test.py')h2 = s.hash_file('setup.py')print s.compare(h1, h2)print s.compare(h1, h1)Requirementspython 2.x (3.x not tested) - http://www.python.org/ ssdeep - http://ssdeep.sourceforge.net/ pyrex - http://www.cosc.canterbury.ac

Hashingbench - Benchmarks for hashing-related algorithms/structures


Benchmarks for hashtables with chaining, open addressing, bloom filters. Implemented bits: ScramblersIdentity (e.g. hashCode() unchanged) HashMap's ConcurrentHashMap's IdentityHashMap's Wang's Jenkin's. Probe sequencesLinear probing Quadratic probing Double hashing (using various scramblers to produce the second hash, making sure that's an odd number, so a relative prime compared to a power-of-two table size, so the probing sequence is always a permutation of the table indexes). MultihashersUniv