
	Where results make sense

Topic: Tiger hash function

	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.
		It is frequently used in Merkle hash tree form, where it is referred to as TTH (Tiger Tree Hash).
		Tiger was a possibility for inclusion in the OpenPGP standard; however, it was abandoned in favour of RIPEMD-160.
	en.wikipedia.org /wiki/Tiger_(hash) (351 words)

	Hash (Site not responding. Last check: 2007-09-23)
		Hash collision Hash collision is a term in hash function produce identical outputs.
		Hash Oil The term hash oil is used by illicit drug users and dealers, but is a misnomer in suggesting any resemblance to...
		Hash table In associations (this is a many to one relationship as the hash table is almost universally smaller than the...
	www.brainyencyclopedia.com /topics/hash.html (318 words)

	Cryptographic hash function (Site not responding. Last check: 2007-09-23)
		In cryptography, a cryptographic hash function is a hash function with certain additional security properties to make it suitable for use as a primitive in various information security applications, such as authentication and message integrity.
		Note that checksums and Cyclic redundancy checks (CRCs) are quite distinct from cryptographic hash functions and are vulnerable to attack; for example, a CRC was used for message integrity in the WEP encryption standard, but an attack was found which exploited the linearity of the checksum.
		Mathematically, a cryptographic hash function is a hash function that is:
	www.sciencedaily.com /encyclopedia/cryptographic_hash_function (682 words)

	Joel on Software - optimized hash functions
		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.
		Thus the strength of the hash is solely defined by the number of output bits, as long as the function itself is not broken.
	discuss.joelonsoftware.com /?joel.3.135825.23 (2749 words)

	Cryptographic hash function (Site not responding. Last check: 2007-09-23)
		An ideal hash function would be maximally "boring": it would have no interesting properties such as length extension, and the only interesting way it would differ from a random function would be in that it was deterministic and efficiently computable.
		A typical use of a cryptographic hash would be as follows: Alice poses to Bob a tough math problem and claims she has solved it.
		The SHA hash functions are a series of functions developed by the NSA: SHA, also known as SHA-0, SHA-1 and four flavours of a function known as SHA-2.
	www.worldhistory.com /wiki/C/Cryptographic-hash-function.htm (1386 words)

	[No title]
		Increasing the output of a function to 192-bits increases the difficulty in attacking the function by an astronomically large amount, and provides peace of mind for cryptographers relying on the function to be secure.
		These functions do not need to be slow, and the authors of these functions have overlooked a simple enough concept in their design.
		This is the concept of optimal allocation of CPU cycles used during a hash function's execution.
	ryan.ript.net /doc/blockhash.html (2576 words)

	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.
		The algorithm(s) specified in algorithm_data.hash_algorithm, should be hash algorithms and may be used by the key generation algorithm.
		This function returns the maximum size of the key, that the key generation algorithm may produce.
	www.die.net /doc/linux/man/man3/mhash.3.html (1154 words)

	TigerDNA - Wikipedia, the free encyclopedia
		It is used to make DNAs of files using the Tiger hash function.
		In future versions, a complete 192 bit hash of the whole thing is to be added.
		It uses Tiger hash because, in my personal opinion, 64 bit machines will soon be available for personal use.
	en.wikipedia.org /wiki/TigerDNA (204 words)

	Tree Hash EXchange format (THEX)
		The Merkle Hash Tree, invented by Ralph Merkle, is a hash construct that exhibits desirable properties for verifying the integrity of files and file subranges in an incremental or out-of-order fashion.
		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.
	open-content.net /specs/draft-jchapweske-thex-02.html (2322 words)

	Cryptographic Algorithms
		Cryptographic hash functions are used in various contexts, for example to compute the message digest when making a digital signature.
		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.
		A cryptographic hash function does this in a way that makes it extremely difficult to come up with a message that would hash to a particular hash value.
	www.crazylinux.net /mirrors/www.ssh.fi/algorithms.htm (6453 words)

	Digest::SHA2 - A variable-length one-way hash function
		Returns the digest size (in bits) of the hash output used; valid sizes are 256, 384, and 512 only.
		Tiger, on the other hand, outputs 192 bits of digest, using 3 rounds; but for added security, can also use 4 rounds.
		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.
	kobesearch.cpan.org /htdocs/Digest-SHA2/Digest/SHA2.html (628 words)

	Tiger: A Fast New Hash Function (Site not responding. Last check: 2007-09-23)
		Among those cryptographic hash function which are not based on block ciphers, MD4 and Snefru seemed initially quite attractive for applications requiring fast software hashing.
		Furthermore, all these functions were designed for 32-bit processors, and cannot be implemented efficiently on the new generation of 64-bit processors such as the DEC Alpha.
		We therefore present a new hash function which we believe to be secure; it is designed to run quickly on 64-bit processors, without being too slow on existing machines.
	www.cs.technion.ac.il /~biham/Reports/Tiger/tiger/tiger.html (126 words)

	AudioSense.org - Add Tiger Tree Hash to AccurateRip DB Poll
		What the tiger tree hash is. It is basically applying the tiger hash (just another hash algorith, such as sha1, crc, md5, ect) to small chunks of the file.
		There is then a tree of hashing that occurs where the 1st 2 hashes are hashed, 3 and 4 are hashed, ect...
		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.
	www.audiosense.org /forum/showthread.php?t=157 (806 words)

	The Hashing Function Lounge
		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.
		In the FIPS 180-2 standard, NIST defined companions to the SHA-1 hash function that provide a level of collision resistance equivalent to the security of 3DES and each AES key sizes.
		It is perhaps a pity that NIST has not established a hash function quest as it had for AES.
	paginas.terra.com.br /informatica/paulobarreto/hflounge.html (1523 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 processes data in 512-bit blocks and produces a 192-bit digest.
		Tiger: A Fast New Hash Function, Ross Anderson and Eli Biham.
	www.gnu.org /software/gnu-crypto/manual/api/gnu/crypto/hash/Tiger.html (190 words)

	NetCard Project (electronic commerce) - Deliverables/Publications
		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.
		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.
	www.cl.cam.ac.uk /Research/Security/resources/NetCard/project_publ.html (1071 words)

	tiger (Site not responding. Last check: 2007-09-23)
		Tiger is a fast new hash function, designed to be very fast on modern computers, and in particular on the state...
		When Tiger Woods went on the rampage in 2000 and 2001, amassing four straight Major titles, the golf world was left in a state of shock.
		GOLFER Tiger Woods is enjoying being a new husband so much that he is in no hurry to return to dry land - except maybe to return to his honeymoon resort in the Caribbean from his yacht Privacy.
	www.animal-magazine-online.com /tiger (651 words)

	Home page for Plasm: not a crime
		For this we are using the Tiger hash function, recently published by Ross Anderson and Eli Biham.
		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.
		These identifiers are converted into a form useable by the Tiger hash code and are subsequently used to winnow out the corresponding message.
	www.plasm.com /not.a.crime (794 words)

	Encryption Tutorial — Lesson 2
		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.
		Hashes are used not only in password-matching situations, but also to ensure that the integrity of a file has not become compromised, meaning it hasn't changed in any way.
		Hashes are binary, which means the stuff in $hash_of_string is binary data.
	www.webmonkey.com /webmonkey/00/20/index4a.html (774 words)

	Software Download: Hash
		The hash will only generate the same value when the data and key are the same.
		The hash from any set of data less than 2^64 bytes in length provides a unique hash that is only creatable by the unique byte order.
		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.
	www.sharewareconnection.com /titles/hash.htm (3137 words)

	Rebel Tiger FAQ - Lokasoft (Site not responding. Last check: 2007-09-23)
		When Tiger is pondering a move till lets say 12 ply, and the opponent is playing that move, Tiger nevertheless start computing at the beginning.
		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.
	www.lokasoft.nl /rtfaq.htm (1159 words)

	Standard Cryptographic Algorithm Naming
		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.
		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).
		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.
	www.users.zetnet.co.uk /hopwood/crypto/scan/md.html (3581 words)

	Tiger (hash) -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-09-23)
		It is frequently used in Merkle Hash Tree form, where it is referred to as TTH ((additional info and facts about Tiger-Tree Hash) Tiger-Tree Hash).
		TTH is used by many clients on the (additional info and facts about Direct Connect) Direct Connect network.
		The BitPrint hash uses Tiger and (additional info and facts about SHA) SHA.
	www.absoluteastronomy.com /encyclopedia/T/Ti/Tiger_(hash).htm (114 words)

	md5deep (Site not responding. Last check: 2007-09-23)
		Hashes sets can be drawn from the National Software Reference Library, iLook Investigator, Hashkeeper, or md5sum, and other generic hash generating programs.
		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.
		Fixed bug in BSD hash file importing that caused crash when processing a line with two parenthesis but was shorter than a valid hash.
	md5deep.sourceforge.net (947 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 MD5 hash will be fastest but because it has some security issues it is not used as the default.
	software.newsforge.com /print.pl?sid=03/07/29/1727249 (2234 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).
		This page will maintain the latest information on the current status of Tiger, an updated copy of the paper, reference implementations, and the S box generation program.
	www.cs.technion.ac.il /~biham/Reports/Tiger (533 words)

	Cryptographic Algorithms
		The round function of SQUARE is composed of four transformations: a linear transformation, a nonlinear transformation, a byte permutation, and a bitwise round-key addition.
		Snefru is a hash function designed by Ralph Merkle, the designer of the Khufu and Khafre encryption algorithms.
		Tiger is a new hash algorithm by Ross Anderson and Eli Biham.
	www.baltsoft.com /files/ee/Cryptographic_Algorithms.htm (2820 words)

	mhash library
		This algorithm is specified for use in the NIST's Digital Signature Standard.
		interface for several hash algorithms (also known as ``one-way'' algorithms).
		specified in algorithm_data.hash_algorithm, should be hash algorithms and may be used by the key generation algorithm.
	mhash.sourceforge.net /mhash.3.html (1182 words)

	Mike Davidson: BitTorrenting Tiger (Site not responding. Last check: 2007-09-23)
		It is not exactly the best way to prevent piracy, but it does exactly the opposite of what companies like Microsoft do, which is punish their honest customers by forcing them to jump through hoops, while the pirates get easy work arounds.
		Sure I could download Tiger from Mac at 12:00 AM April 29, but what's the point as opposed to waiting another 8 hours going to the store and buying it, when you're not going to get around to installing it until around 5:00 in the afternoon anyway (this is just my life).
		Tiger is a totally new, fully featured operating system that contains new applications and utilities.
	www.mikeindustries.com /blog/archive/2005/04/bittorrenting-tiger (6420 words)

	hash function - OneLook Dictionary Search
		Tip: Click on the first link on a line below to go directly to a page where "hash function" is defined.
		Hash Function : Eric Weisstein's World of Mathematics [home, info]
		Phrases that include hash function: one-way hash function, one way hash function, cryptographic hash function, perfect hash function, tiger hash function, more...
	www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=hash+function (140 words)

Try your search on: Qwika (all wikis)