| Server IP : 180.180.241.3 / Your IP : 216.73.216.252 Web Server : Microsoft-IIS/7.5 System : Windows NT NETWORK-NHRC 6.1 build 7601 (Windows Server 2008 R2 Standard Edition Service Pack 1) i586 User : IUSR ( 0) PHP Version : 5.3.28 Disable Function : NONE MySQL : ON | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : C:/Program Files (x86)/MySQL/MySQL Workbench 6.1 CE/python/site-packages/Crypto/Hash/ |
Upload File : |
ó ¤'Sc @ s4 d Z d d d d d d d d d d g Z d Z d S( s Hashing algorithms Hash functions take arbitrary binary strings as input, and produce a random-like output of fixed size that is dependent on the input; it should be practically infeasible to derive the original input data given only the hash function's output. In other words, the hash function is *one-way*. It should also not be practically feasible to find a second piece of data (a *second pre-image*) whose hash is the same as the original message (*weak collision resistance*). Finally, it should not be feasible to find two arbitrary messages with the same hash (*strong collision resistance*). The output of the hash function is called the *digest* of the input message. In general, the security of a hash function is related to the length of the digest. If the digest is *n* bits long, its security level is roughly comparable to the the one offered by an *n/2* bit encryption algorithm. Hash functions can be used simply as a integrity check, or, in association with a public-key algorithm, can be used to implement digital signatures. The hashing modules here all support the interface described in `PEP 247`_ , "API for Cryptographic Hash Functions". .. _`PEP 247` : http://www.python.org/dev/peps/pep-0247/ :undocumented: _MD2, _MD4, _RIPEMD160, _SHA224, _SHA256, _SHA384, _SHA512 t HMACt MD2t MD4t MD5t RIPEMDt SHAt SHA224t SHA256t SHA384t SHA512s $Id$N( t __doc__t __all__t __revision__( ( ( s` C:\Program Files (x86)\MySQL\MySQL Workbench 6.1 CE/python/site-packages\Crypto\Hash\__init__.pyt <module>2 s