
	Where results make sense

Topic: Tiger (hash)

Related Topics

Hash

Cryptographic hash function

Zora Tunic

SHA

Airframe (novel)

Platinum, Alaska

John Maitland, Duke of Lauderdale

Helvetia, Wisconsin

Sloop

Nervous Man in a Four Dollar Room

The Amateur Scientist

Tilbury

William Richardson Davie

CSX Transportation

Darkness at Noon

	Tiger (hash) - Wikipedia, the free encyclopedia
		In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms.
		Tiger is frequently used in Merkle hash tree form, where it is referred to as TTH (Tiger Tree Hash).
		Tiger was considered for inclusion in the OpenPGP standard, but was abandoned in favour of RIPEMD-160.
	en.wikipedia.org /wiki/Tiger_(hash) (469 words)

	Discover the Wisdom of Mankind on Tiger (Site not responding. Last check: 2007-11-03)
		Tigers (Panthera tigris) are mammals of the Felidae family and one of four "big cats" in the Panthera genus.
		Tigers overpower their prey from almost any angle, usually from ambush, and bite the neck, often breaking the prey's spinal column or windpipe, or severing the jugular vein or carotid artery, much as the domestic cat does to far-smaller prey.
		Habitat destruction is the main threat to the existing tiger population (logging continues even in the supposedly protected national parks), but 66 tigers were recorded as being shot and killed between 1998 and 2000andmdash;nearly 20% of the total population.
	www.blinkbits.com /blinks/tiger (2477 words)

	UtterNoncesense » Future-proofing Your Hash Implementations
		Because the first Hash of the concatenation is reduces the length back to shorter, fixed length of known characters (hexadecimal), the Repetition argument applies until we reduce it to Hash of Concatenation.
		These hashes are then concatenated, and a second random seed of maximum length 10, consisting of characters drawing from 95 Printable ASCII characters, is inserted somewhere in this string.
		This string is then Hashed with TIGER, RIPEMD, or SHA-512 (these algorithms chosen because it is less likely they have a Rainbow Table created for them of this size), and the two seeds, as well as the location of the insertion of the second, are appended to this output.
	utternoncesense.com /security/future-proof-hash-implementation (2561 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)

	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)

	Mac OS X password hashes - MacShadows KB
		A hash function is an algorithm which, in essence, produces a digital 'fingerprint' of a set length (typically expressed in bits) completely unique to the data input to the function.
		A hash algorithm is considered cryptographically secure if there is no way to replicate the output of the hash function other than either inputting the original input, or doing a brute force search of the keyspace of the hash function.
		Hashes in this article will refer to the output of a cryptographic hash function given as input a password or passphrase.
	www.macshadows.com /kb/index.php?title=Mac_OS_X_password_hashes (1433 words)

	Tiger-hash - README (Site not responding. Last check: 2007-11-03)
		The Tiger module allows you to use the Tiger hash algorithm developed by Ross Anderson and Eli Biham in Perl programs.
		The Tiger extension may be redistributed either under the GPL or the Perl Artistic License.
		The Tiger interface was written by Rafael Sevilla (`dido@pacific.net.ph'), shamelessly stealing from the SHA interface written by Uwe Hollerbach (`uh@alumni.caltech.edu').
	cpan.uwinnipeg.ca /htdocs/Tiger-hash/README.html (273 words)

	Hash tree - Wikipedia, the free encyclopedia
		In cryptography, hash trees (also known as Merkle trees) are an extension of the simpler concept hash list, which in turn is an extension of the old concept of hashing.
		But combined with hash trees they can be used for many messages and then become a fairly efficient digital signature scheme.
		Tiger tree hashes are used in the Gnutella, Gnutella2, and Direct Connect P2P file sharing protocols and in file sharing applications such as BearShare, LimeWire, Shareaza, DC++, Valknut, and RevConnect.
	en.wikipedia.org /wiki/Tiger-Tree_Hash (769 words)

	Morgud.com :: Software Review - WinHasher (hash file creator and verifier)
		A hash function (or hash algorithm) is a way of creating a small digital "fingerprint" from any kind of data.
		The hash value is commonly represented as a short string of random-looking letters and numbers.
		You can rename the hash file to anything you like as long as the extension remains ".hash" and it remains in the same path relative to the files added in the previous step (i.e.
	www.morgud.com /reviews/software/WinHasher.asp (1372 words)

	Schneier on Security: NIST Hash Workshop Liveblogging (5)
		VSH (Very Smooth Hash) was the interesting one; it's based on factoring and the discrete logarith problem, like public-key encryption, and not on bit-twiddling like symmetric encryption.
		Hash functions are a hot area of research right now, but anything we can do to stoke that will pay off in the future.
		Among the hashes we have SHA-1 at 70, SHA-256 at 40, Tiger at 40, RIPE-MD160 at 50 (all figures in MB/s rounded to nearest 10).
	www.schneier.com /blog/archives/2005/11/nist_hash_works_4.html (3502 words)

	ChessGenius v. Chess Tiger (PalmOS)
		Tiger was running on a Sony Clié N760C and Genius was running on a Visor Prism.
		Chess Tiger, on the other hand, was written for the present-day Intel processor then rewritten for the Motorola processor.
		Overall, Tiger's Normal engine (with or without the Anti-Human setting enabled) tended to be slightly more draw-ish, drawing 13 of the 40 games it played, while the Gambit engine drew only 8 of its 40 games.
	www.fishdev.net /chess/palmchess/genius_v_tiger.html (688 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 (824 words)

	Hash Algorithm
		HAVAL -- a one-way hashing algorithm with variable length of output, Y. Zheng, J. Pieprzyk and J. Seberry, Advances in Cryptology -- AusCrypt'92, LNCS 718, pp.
		Tiger: A Fast New Hash Function, Ross Anderson, and Eli Biham, Proceedings of Fast Software Encryption 3, Cambridge, 1996 (local copy).
		Hash Functions Based on Block Ciphers and Quaternary Codes, L. Knudsen and B. Preneel, Advances in Cryptology - Proc.
	www.securitytechnet.com /crypto/algorithm/hash.html (964 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 (726 words)

	96Crypt Help
		A HASH function is a cryptographic algorithm that accepts input, arbitrary in length
		The Secure Hash Algorithm (SHA) was developed by NIST along with the NSA in 1993.
		SHA256 is a newer secure hash standard announced by NIST on October 12, 2000.
	www.erightsoft.com /help/HashSlc.htm (940 words)

	hashing speed - IA64wiki
		The benchmark tests the hashing speed of several different hashing functions on a buffer of pseudo-random data.
		The 64 bit optimised tiger hash performs well on the Itanium, but not on the 32 bit machines.
		You could quite easily add your favourite hash to the test; just add a function in tests.c (prototyped in tests.h) as void test_name(char buf, int size) which runs your hash* on string buf (length size).
	www.gelato.unsw.edu.au /IA64wiki/hashing_speed (396 words)

	Digest::Tiger - a module that implements the tiger hash (Site not responding. Last check: 2007-11-03)
		A perl module that implements the tiger hash, which is believed to be secure and runs quickly on 64-bit processors.
		Perl interface by Clinton Wong, reference C code used by Digest::Tiger supplied by Ross Anderson and Eli Biham.
		Hash of "Tiger": 0 7 8 15 16 23 DD00230799F5009F EC6DEBC838BB6A27 DF2B9D6F110C7937
	cpan.uwinnipeg.ca /htdocs/Digest-Tiger/Digest/Tiger.html (214 words)

	Shareaza Wiki - TigerTree (Site not responding. Last check: 2007-11-03)
		Tiger-Tree Hashing is a way of verifying that small pieces of a file are valid, and free from corruption.
		In a tree hash, a file is broken up into small pieces, and each small piece of a file is hashed.
		When you start a download, Shareaza can get the root hash from a source of the file, or Shareaza may know the root already (if it was contained in a magnet-link from which you began the download, for example, or it may have been in the search results results).
	wiki.shareaza.com /static/TigerTree (391 words)

	AccurateRip suggestion - Hydrogenaudio Forums (Site not responding. Last check: 2007-11-03)
		If the data base is populated with tiger tree hashes and the rip is found to have an error it could be localized to part of the audio track, which could then be reread.
		But with the tiger tree hash you could potentially know that the error occured in the 30th mb of a 40 mb song and only reread that mb a few times since all the other portions of the song passed the hash verification.
		Well I guess I should explain what the tiger tree hash is. From my reading it is basically applying the tiger hash (just another hash algorith, such as sha1, crc, md5, ect) to small chunks of the file.
	www.hydrogenaudio.org /forums/index.php?showtopic=21157 (546 words)

	Eggs Unlimited - bloom-filter
		The number of hash functions, k, is not necessarily the same as the number of message-digests.
		A hash function is defined as returning an unsigned 32 bit integer.
		The actual length of the hash is divided into 32 bit blocks to get the individual hash functions.
	www.call-with-current-continuation.org /eggs/bloom-filter.html (365 words)

	GGEP H - Gnutella Developers (Site not responding. Last check: 2007-11-03)
		It is meant to replace the "urn:xxx:" representation defined by HUGE in order to save bandwidth and prevent needless conversions from the base32 form into the binary form.
		This is to preserve the ability of gtk-gnutella users to perform queries by hash: the HUGE representation will be used in the interim.
		The first 20 bytes refer to the SHA1, the trailing 24 bytes refer to the Tiger tree hash.
	the-gdf.org /index.php?title=GGEP_H (255 words)

	Talisman tiger texture (Site not responding. Last check: 2007-11-03)
		In the fisrt texure version of the tiger i use color map based on scan of different tiger picture.
		I start with a material in hash to make the orange basic tone of the tiger skin (different range of the orange tone is obtained by two level of checker attribute,with turb.)
		The fl decals(left)for the tiger mask transp color set to white in hash...
	www.hash.com /users/alweb/tutorial5/tiger2.htm (343 words)

	Macintosh Underground :: View topic - Tiger Hash (Site not responding. Last check: 2007-11-03)
		Can someone with Tiger installed create a new account with a password like "password" and actually TELL us what the password is, AND post the hash.
		Could be that a SHA1 hash is used for old accounts, while a new 48 characters hash is used for new accounts (analogous to OS 10.3's treatment of 10.2 accounts...).
		This further supports the theory that characters 104 to 104+48 is reserved for new 24 byte hash, and characters 176 to 176+20 is reserved for compatibility SHA1 hashes.
	freaky.staticusers.net /ugboard/viewtopic.php?t=17175&...+files+macosx (1041 words)

	Ares Hash UNDER ATTACK!!!! - Peer Evolution Forums
		In theory, it is very very very unlikely that any 2 files will have the same hash, and also, in theory, if you change a file by the slightest amount, it should be given a new hash.
		You are given the original Tiger-Tree hash, and that checks the whole file, but it can somehow be broken into smaller and smaller segments, so that you can check pieces as well.
		Even though Viralg's technique of faking file hashes works only with some of the old peer-to-peer applications, such as Kazaa, it is nevertheless illegal to take matters into one's own hands when fighting against copyright infringements.
	www.peerevolution.com /forums/showthread.php?t=4269&page=1 (1346 words)

	LLCryptoLib.Hash (Site not responding. Last check: 2007-11-03)
		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.
		On DEC-Alpha, Tiger hashes more than 132Mbits per second (measured on Alpha 7000, Model 660, on one processor).
		On the same machine, MD5 hashes only about 37Mbps (this is probably not the best optimized md5 code).
	www.littlelite.net /llcryptolib/docs/LLCryptoLib.Hash.html (117 words)

	Proposal for development of Gnutella (hashs) - Gnutella Forums
		Doing a hash for each query would not be a good idea...
		It describes hash positioning in Query/Queryhits and necesarry HTTP headers.
		Then it encodes the hash to make it fit into Gnutella traffic (null inside the hash must encoded!) and also into HTTP traffic.
	www.gnutellaforums.com /showthread.php?t=6969&page=4&pp=15 (1223 words)

	Macintosh Underground :: View topic - Tiger Hash
		At that point the user password would have to be re-entered and the hash would be generated and stored either in the existing shadow hash file (in place of some of the many zeros) or in /private/var/samba/hash since the directory structure does appear to be in place in Tiger.
		The hashes used by all versions of OS X are designed to be one-way only and not reversible so that the hash can't be "decrypted".
		This is an upgraded hash from Panther to Tiger and should have had zeros at the beginning.
	freaky.staticusers.net /ugboard/viewtopic.php?p=93827 (1421 words)

	Slyck News - Major DirectConnect Upgrade
		Tiger Tree Hashes allow Direct Connect to find alternate sources for the files in your queue.
		If the remote peer supports Tiger Tree Hashes, Direct Connect will verify data as it is written to disk.
		An exact match occurs only when you have the tiger tree hash of the file in question and are able to find another client exporting that same tiger tree hash.
	www.slyck.com /news.php?story=421 (486 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)

Try your search on: Qwika (all wikis)