Switch branches/tags
Nothing to show
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
..
Failed to load latest commit information.
Example
LICENSE.GPL
README
sha1hash.cpp
sha1hash.h

README

The SHA1Hash related files are 
Copyright (C) 2007-2016 Angius Fabrizio (hippydream@42cows.org)

You may use, distribute and copy the files under the terms of
GNU General Public License version 3 (see the file LICENSE.GPL for details)

-------------------------------------------------------------------------

Website: http://osdab.42cows.org/
GitHub project page: https://github.com/hippydream/osdab/

**************** ******* ******************************************************

detailed description
--------------------
A small class implementing the SHA1 hashing algorithm. 

SHA (Secure Hash Algorithm) is a cryptographically safe function developed by NIST and NSA in 1992. It fulfills all the requirements imposed for one-way hashing functions and it generates very different images for similar sequences. This code is based on the 100% free public domain implementation by Dominik Reichl. 

NO WARRANTY is given for this code. Use it at your own risk. It should always compute correct SHA1 digests, but no security-related tests have been made.

history
-------
2016-04-22 - License changed to GPLv3; update metadata
2013-06-23 - Replace QString::from|toAscii() with QString::from|toLatin1()
2006-06-09 - Minor changes (documentation and binary compatibility). 
2005-10-02 - Added some methods to hash byte arrays. 
2005-09-30 - First public release.

features
--------
Qt interface for quickly computing the SHA1 digest of some file or buffer. 
Endianness-aware (see the SHA1_LITTLE_ENDIAN #define in the header file) 

no known issues
---------------

requirements
------------
Qt version 4.0.x or later


**************** ******* *******************************************************
BEFORE SENDING ANY EMAIL, CHECK OUT THE OSDAB WEBSITE HOSTED AT OSDAB.42COWS.ORG
**************** ******* *******************************************************