|
| |
| | mhash(3): Hash Library - Linux man page |
 | | Tiger was designed to be very fast on modern computers, and in particular on the state-of-the-art 64-bit computers, while it is still not slower than other suggested hash functions on 32-bit machines. | | | This function returns the number of the hash algorithms the key generation algorithm will use. | | | : Tiger is a fast hash function, by Eli Biham and Ross Anderson. |
|
http://www.die.net/doc/linux/man/man3/mhash.3.html
(1154 words)
|
|
| |
| | Tiger (hash) - Wikipedia, the free encyclopedia |
| | In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1996 with a view for efficiency on 64-bit platforms. | | | Tiger — A Fast New Hash Function, by Ross Anderson and Eli Biham, proceedings of Fast Software Encryption 3, Cambridge, 1996. | | | Therfore in the example below the 192-bit (24-byte) Tiger hashes are represented as 48-digit hexadecimal numbers in big endian byte order. |
|
http://en.wikipedia.org/wiki/Tiger_(hash)
(351 words)
|
|
| |
| | Joel on Software - optimized hash functions |
| | A hash function maps all possible inputs to a limited output. | | | Hash functions that are described as cryptographic are generally the ones which are hard to invert in this sense (amongst other desirable properties). | | | A cryptographic hash function is designed in such a way that the correlations between any of the bits is kept down to an absolute minimum that can't be used for an attack. |
|
http://discuss.joelonsoftware.com/?joel.3.135825.23
(2749 words)
|
|
| |
| | Tree Hash EXchange format (THEX) |
| | This attribute specifies the size of the output of the hash function, in bytes. | | | The same hash algorithm is used as the basis of each construct, but a single '1' byte in network byte order, or 0x01 is prepended to the input of the internal node hashes, and a single '0' byte, or 0x00 is prepended to the input of the leaf node hashes. | | | If the the segment size is equal to or larger than the file to be hashed, the tree hash value is the value of the single segment's value, which is the same as the underlying hash algorithm value for the whole file. |
|
http://open-content.net/specs/draft-jchapweske-thex-02.html
(2322 words)
|
|
| |
| | blockhash.html |
| | This is the concept of optimal allocation of CPU cycles used during a hash function's execution. | | | Since the enhanced function would not be able to retain the same internal algorithm, it wouldn't be compatible with software implementing the original version. | | | These functions do not need to be slow, and the authors of these functions have overlooked a simple enough concept in their design. |
|
http://ryan.ript.net/doc/blockhash.html
(2576 words)
|
|
| |
| | md5deep |
| | Tiger is a fast new hash function, designed to be very fast on modern computers, and in particular on the state-of-the-art 64-bit computers. | | | Hashes sets can be drawn from the National Software Reference Library, iLook Investigator, Hashkeeper, or md5sum, and other generic hash generating programs. | | | The program can display either those input files that match the list of known hashes or those that do not match. |
|
http://md5deep.sourceforge.net
(947 words)
|
|
| |
| | Digest::SHA2 - A variable-length one-way hash function |
| | Before calculating another digest, reset() refreshes the hash state, and is, therefore, functionally equivalent to the new() method, except that no SHA-2 object is created. | | | SHA-2 is the collective name of one-way hash functions developed by the NIST. | | | Generates the hash output as a binary string |
|
http://kobesearch.cpan.org/htdocs/Digest-SHA2/Digest/SHA2.html
(628 words)
|
|
| |
| | Rebel Tiger FAQ - Lokasoft |
| | This is a function of the chess engine, this is not (yet) supported by the chess tiger engine. | | | The user book is a function of the chess engine, if the engine does not support this function the menu is grayed. | | | This is a known bug, this happens when a level with a fixed time per move is selected. |
|
http://www.lokasoft.nl/rtfaq.htm
(1159 words)
|
|
| |
| | Cryptographic Algorithms |
| | Cryptographic hash functions are used in various contexts, for example to compute the message digest when making a digital signature. | | | The standard defines DSS to use the SHA-1 hash function exclusively to compute message digests. | | | A hash function compresses the bits of a message to a fixed-size hash value in a way that distributes the possible messages evenly among the possible hash values. |
|
http://www.crazylinux.net/mirrors/www.ssh.fi/algorithms.htm
(6453 words)
|
|
| |
| | Tiger: A Fast New Hash Function (Designed in 1995) |
| | Tiger is a fast new hash function, designed to be very fast on modern computers, and in particular on the state-of-the-art 64-bit computers (like DEC-Alpha), while it is still not slower than other suggested hash functions on 32-bit machines (well, not any more, after MD5 and SHA-1 were broken). | | | On DEC-Alpha, Tiger hashes more than 132Mbits per second (measured on Alpha 7000, Model 660, on one processor). | | | Still is hashes faster than MD5 on 486s and Pentiums. |
|
http://www.cs.technion.ac.il/~biham/Reports/Tiger
(533 words)
|
|
| |
| | Encryption Tutorial — Lesson 2 |
| | Obviously, hash functions are very useful in determining if a file or string has changed. | | | Now create the hash, by assigning the value of the output of the mhash() function to a variable. | | | For more information about the concept of hashing algorithms, a good place to start is with the "What is a Hash Function" section of the RSA Labs Crypto FAQ. |
|
http://www.webmonkey.com/webmonkey/00/20/index4a.html
(774 words)
|
|
| |
| | Tiger (GNU cryptographic primitives and tools, version 2.0.0) |
| | Tiger was designed by Ross Anderson and Eli Biham, with the goal of producing a secure, fast hash function that performs especially well on next-generation 64-bit architectures, but is still efficient on 32- and 16-bit architectures. | | | Tiger: A Fast New Hash Function, Ross Anderson and Eli Biham. | | | the bytes to pad the remaining bytes in the buffer before completing a hash operation. |
|
http://www.gnu.org/software/gnu-crypto/manual/api/gnu/crypto/hash/Tiger.html
(190 words)
|
|
| |
| | Unix Host and Network Security Tools |
| | The data is transformed by a one-way function into a 8-byte key, which is then used by the algorithm. | | | Included are functions implementing the algorithm, functions implementing related capabilities including a DES implementation for recipients in the USA, and a program, rpem, that implements a simple Privacy Enhanced Mail system. | | | CrackLib is a library containing C function which may be used in a "passwd"-like program. |
|
http://csrc.nist.gov/tools/tools.htm
(6877 words)
|
|
| |
| | AudioSense.org - Add Tiger Tree Hash to AccurateRip DB Poll |
| | Adding Tiger Tree Hashes to the Accurate Rip Database could allow for greatly increased functionality and versitility when using the database. | | | IF the root hash matches there is no reason to verify the chunks, but if the root does not match you could attempt to verify chunks of the file to see if a segment can be identified that is corrupt. | | | Also, as stated before, the function inevitably is left up-to the developers, but end-user input has been known to move mountains in coder world |
|
http://www.audiosense.org/forum/showthread.php?t=157
(806 words)
|
|
| |
| | Software Download: Hash |
| | It is a collection of functions for Windows programmers that allows to implement RSA public key encryption, AES (Rijndael) and ArcFour (RC4) secret key encryption and digital signatures using the SHA-1, SHA-256 or MD5 Secure Hash Algorithm in your programs. | | | The hash function is the fingerprint of file. | | | Free calculator to compute multiple hashes, checksums and HMACs for files, text and hex strings. |
|
http://www.sharewareconnection.com/titles/hash.htm
(3137 words)
|
|
| |
| | hash function - OneLook Dictionary Search |
| | hash function : Free On-line Dictionary of Computing [home, info] | | | hash function : Hutchinson Dictionary of Computers, Multimedia, and the Internet [home, info] | | | hash function : Glossary of Communications, Computer, Data, and Information Security Terms [home, info] |
|
http://www.onelook.com/cgi-bin/cgiwrap/bware/dofind.cgi?word=hash+function
(140 words)
|
|
| |
| | Cryptographic Algorithms |
| | Snefru is a hash function designed by Ralph Merkle, the designer of the Khufu and Khafre encryption algorithms. | | | This precludes the possibility of using TEA as a hash function. | | | Blowfish combines a Feistel network, key-dependent S-Boxes, and a non-invertible F function to create what is perhaps one of the most secure algorithms available. |
|
http://www.baltsoft.com/files/ee/Cryptographic_Algorithms.htm
(2820 words)
|
|
| |
| | The Hashing Function Lounge |
| | Daemen, " Cipher and Hash Function Design, Strategies Based on Linear and Differential Cryptanalysis", Doctoral dissertation, Katholiek Universiteit Leuven, 1995. | | | Daemen, R. Govaerts, and J. Vandewalle, "A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on Cellular Automata", Advances in Cryptology - Asiacrypt'91, LNCS 739, Springer-Verlag (1993), pp. | | | Whenever a hash function can produce several hash sizes, separate versions are listed only if the distinct sizes are obtained by means other than mere truncation. |
|
http://paginas.terra.com.br/informatica/paulobarreto/hflounge.html
(1523 words)
|
|
| |
| | Standard Cryptographic Algorithm Naming |
| | The paper "Tiger: A Fast New Hash Function," specified that padding for Tiger would be done in the same way as the MD4 family, i.e. | | | When the compression function is used directly, it is considered to include the chaining variable addition (as opposed to being separate as shown in the specification). | | | Example: if the bit string 1110 is hashed with a big-bit-endian, little-byte-endian, left-justified algorithm, then this becomes the octet string [11101000, 00000000, 00000000, 00000000], which corresponds to the word 00000000000000000000000011101000. |
|
http://www.users.zetnet.co.uk/hopwood/crypto/scan/md.html
(3581 words)
|
|
| |
| | Hash |
| | Hash collision Hash collision is a term in hash function produce identical outputs. | | | Perfect hash function Perfect hash functions are hash functions which guarantee O(1) operations complexity when used in... | | | Hash function A hash function is a strings it will have to deal with; i.e. |
|
http://www.brainyencyclopedia.com/topics/hash.html
(318 words)
|
|
| |
| | ABC Online Forum |
| | Tiger is a fast new hash function, designed to be very fast... | | | Genuine commercial websites need IE and other browsers to function correctly so the site works properly and can record hits so advertising can be sold. | | | Yet for reasonable protection from known sites of poor reputation this function of IE needs to be used. |
|
http://www2b.abc.net.au/science/techtalk/newposts/162/topic162910.shtm
(6364 words)
|
|
| |
| | C/C++ Users Journal Web Site |
| | For a given list of strings, it produces a "perfect" (no collisions) hash function and hash table, in form of C or C++ code, for looking up a value depending on the input string. | | | Providing modular functions for math functions, arbitrary precision, queues, lists, bit arrays, hash tables, soundex, date functions, CRC/checksum, malloc with fenceposts, timers, POSIX funcs, etc. etc. | | | a Win32 implementation of R.J. Cichelli's perfect hash function generation algorithm from the January 1980 CACM. |
|
http://www.cuj.com/link/subject4.htm
(601 words)
|
|
| |
| | GNU Crypto - GNU Project - Free Software Foundation (FSF) |
| | This Singleton generator is an instance of the pseudo-random number generator based on a generic hash function—the class | | | HAVAL: A One-Way Hashing Algorithm with Variable Length of Output (Extended Abstract). | | | One of the objectives of such format is to provide free Java projects with similar functionalities to those offered by the Java Keystore (JKS) format. |
|
http://www.gnu.org/software/gnu-crypto
(1595 words)
|
|
| |
| | NetCard Project (electronic commerce) - Deliverables/Publications |
| | The recursive hashing technique greatly reduces the computational complexity in applications where a series of low value payments are made to the same merchant. | | | Hash chains, as used in the NetCard protocol, are utilised in a different way to establish secure association at low computational cost. | | | The key innovation is that, instead of having to do a digital signature each time the customer spends a coin, she can sign a whole stick of coins that are hashed together in a recursive way and then spend these coins one at a time. |
|
http://www.cl.cam.ac.uk/Research/Security/resources/NetCard/project_publ.html
(1071 words)
|
|
| |
| | CTNHashProc - anmar.eu.org open source projects |
| | An unsupported hash function can also be added but you need a C++ implementation of the function or a library that supports it. | | | Any other hash function supported by the library Crypto++ Version 5.1 may be added easy to CTNHashProc. | | | Currently the supported hash functions are linked from Crypto++ and are the following: |
|
http://anmar.eu.org/projects/CTNHashProc
(235 words)
|
|
| |
| | Articles |
| | It is also possible to change the hash function used by samhain to increase its speed. | | | Samhain uses the TIGER hash function and computes 192-bit signatures, but can be set to use SHA-1 and MD5 hashes instead. | | | The feature is very useful and samhain has a nice audit-trail function for dealing with the file changes. |
|
http://software.newsforge.com/print.pl?sid=03/07/29/1727249
(2234 words)
|
|
| |
| | Moonlight's eMule Tweaks Documentation: Hash tree generation benchmarks |
| | (Moonlight's P3-1000/PC133/XP) Base Level: 10, Buildup Level: 12, Depth Level= 2, IO Level 13 Now benchmarking the hashes... | | | --------------------------------------------------------------------------------------- Base Level: 10, Buildup Level: 12, Depth Level= 2, IO Level 14 Now benchmarking the hashes... | | | Dummy : 0.282s (134.572MB/s) 00000000 MD4 : 1.253s (30.327MB/s) 7CD35633:245B22FF:753B3245:9588653C MD5: 1.783s (21.322MB/s) 4CE0036E:6D81FE0D:A892403D:371903FC Tiger : 5.382s (7.063MB/s) 8525B8D7:7D61B76A:9540074A:2517E873:555ADC06:52AD8BDA SHA-1 : 4.237s (8.970MB/s) 6A8BF0A8:24725759:84D011CF:B780E0C0:2A200B7E --------------------------------------------------------------------------------------- Base Level: 14, Buildup Level: 16, Depth Level= 2, IO Level 17 Now benchmarking the hashes... |
|
http://pages.infinit.net/moonligh/eMule/Demo001Extra.html
(797 words)
|
|
| |
| | Home page for Plasm: not a crime |
| | The results of the hash function, the original unencrypted data and that data's position in the original communication are combined to form a chunk. | | | For this we are using the Tiger hash function, recently published by Ross Anderson and Eli Biham. | | | Each of these pieces is then combined with a secret identifier, and the combination is authenticated with a crytographically secure hash function. |
|
http://www.plasm.com/not.a.crime
(794 words)
|
|
| |
| | Gtk-Gnutella: tiger.h File Reference |
| | Runs some test cases to check whether the implementation of the tiger hash algorithm is alright. | | | Go to the source code of this file. | | | Generated on Sat Nov 12 13:57:12 2005 for Gtk-Gnutella by |
|
http://gtk-gnutella.sourceforge.net/doxygen/tiger_8h.html
(50 words)
|
|
|
umich.edu