1. What Is Hashing? hashing . . . it s a mixture of athleticism and sociability, hedonism and hard work, a refreshing escape from the nineto-five dweebs you re stuck with five http://onin.com/hhh/hhhexpl.html

Who Are the Hash House Harriers? Hashing . . . it's a mixture of athleticism and sociability, hedonism and hard work, a refreshing escape from the nine-to-five dweebs you're stuck with five days a week. Hashing is an exhilaratingly fun combination of running, orienteering, and partying, where bands of harriers and harriettes chase hares on eight-to-ten kilometer-long trails through town, country, and desert, all in search of exercise, camaraderie, and good times. Hashing began in Kuala Lumpur, Malaysia, in 1938, when a group of British colonial officials and expatriates founded a running club called the Hash House Harriers. They named the group after their meeting place, the Selangor Club, nicknamed the "Hash House." Hash House Harrier runs were patterned after the traditional British paper chase. A "hare" was given a head start to blaze a trail, marking his devious way with shreds of paper, all the while pursued by a shouting pack of "harriers." Only the hare knew where he was going . . . the harriers followed his clues to stay on trail. Apart from the excitement of chasing the hare and solving the clues, reaching the end was its own reward . . . for there, thirsty harriers would find a tub of iced-down beer. Hashing died out during World War II (Japanese occupying forces being notoriously anti-fun) but picked up in the post-war years, spreading through the Far East, Australia, and New Zealand . . . then exploding in popularity in the mid-70s. Today there are thousands of Hash House Harrier clubs in all parts of the world, with newsletters, directories, and even regional and world hashing conventions.

2. What Is Hashing? - A Definition From Whatis.com - See Also: Hash, Hash Function hashing is the transformation of a string of character s into a usually shorter fixedlength value or key that represents the original string. http://searchsqlserver.techtarget.com/sDefinition/0,,sid87_gci212230,00.html

mboxCreate('global'); hashing Home SQL Server Definitions - Hashing SearchSQLServer.com Definitions (Powered by WhatIs.com) EMAIL THIS LOOK UP TECH TERMS Powered by: Search listings for thousands of IT terms: Browse tech terms alphabetically: A B C D ... Z hashing Digg This! StumbleUpon Del.icio.us ttWriteMboxDiv('searchSQLServer_Definition_Body'); ttWriteMboxContent('searchSQLServer_Definition_Body'); - Hashing is the transformation of a string of character s into a usually shorter fixed-length value or key that represents the original string. Hashing is used to index and retrieve items in a database because it is faster to find the item using the shorter hashed key than to find it using the original value. It is also used in many encryption algorithms. As a simple example of the using of hashing in databases, a group of people could be arranged in a database like this: Abernathy, Sara Epperdingle, Roscoe Moore, Wilfred Smith, David (and many more sorted into alphabetical order) Each of these names would be the key in the database for that person's data. A database search mechanism would first have to start looking character-by-character across the name for matches until it found the match (or ruled the other entries out). But if each of the names were hashed, it might be possible (depending on the number of names in the database) to generate a unique four-digit key for each name. For example:

3. Half-Mind Catalog Historical Information on the Hash House Harriers, compiled from various sources. http://half-mind.com/Hashing/who.htm

Half-Mind,com Catalog

4. Hashing A small paper that explains how hashing works with examples in Pascal. http://www.palfrader.org/hashing/

home Hashing Hashing V 0.1 Hashing is a method to store data in an array so that storing, searching, inserting and deleting data is fast (in theory it's O(1)). For this every record needs an unique key. The basic idea is not to search for the correct position of a record with comparisons but to compute the position within the array. The function that returns the position is called the 'hash function' and the array is called a 'hash table'. In our examples our key is an integer value as is the actual data. [note that I use pascal syntax since this is easily readable by everybody I asume] type record key integer data integer end the hash table now looks like this: const type array of If we know that the key is in a small range we could use the key itself as an index (also called hash address) for our array. However this is very rarely the case so we have to find some kind of hash function. A very common and not so bad function is a simple MODulo function: function key integer integer begin key MOD end If we now want to insert a record into the hash we could do it this way: procedure VAR hash rec begin hash rec key rec end But wait! What happens if two different keys return the same hash address from the hash function? Well if you have a good hash function this happens very rarely but it can and will happen. There are two ways to handle a so called 'hash collision'.

5. PHP Security Consortium: Password Hashing In this article I m going to cover password hashing, a subject which is often poorly understood by newer developers. Recently I ve been asked to look at http://phpsec.org/articles/2005/password-hashing.html

Home About Articles Contact ... Projects Articles Article List Password Hashing by James McGlinn In this article I'm going to cover password hashing, a subject which is often poorly understood by newer developers. Recently I've been asked to look at several web applications which all had the same security issue - user profiles stored in a database with plain text passwords. Password hashing is a way of encrypting a password before it's stored so that if your database gets into the wrong hands, the damage is limited. Hashing is nothing new - it's been in use in Unix system password files since long before my time, and quite probably in other systems long before that. In this article I'll explain what a hash is, why you want to use them instead of storing real passwords in your applications, and give you some examples of how to implement password hashing in PHP and MySQL. Foreword As you read on you'll see that I advocate the use of a hashing algorithm called Secure Hashing Algorithm 1 (or SHA-1). Since I wrote this article, a team of researchers - Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu - have shown SHA-1 to be weaker than was previously thought. This means that for certain purposes such as digital signatures, stronger algorithms like SHA-256 and SHA-512 are now being recommended. For generating password hashes, SHA-1 still provides a more than adequate level of security for most applications today. You should be aware of this issue however and begin to think about using stronger algorithms in your code as they become more readily available.

6. Hashing Animation Tool Trouble viewing the applet? Click for Operating Requirements. http://www.engin.umd.umich.edu/CIS/course.des/cis350/hashing/WEB/HashApplet.htm

Trouble viewing the applet? Click for Operating Requirements

7. What Is Hashing? - A Word Definition From The Webopedia Computer Dictionary This page describes the term hashing and lists other pages on the Web where you can find additional information. http://www.webopedia.com/TERM/h/hashing.htm

You are in the: Small Business Computing Channel ECommerce-Guide Small Business Computing Webopedia ... Refer-It Enter a word for a definition... ...or choose a computer category. choose one... All Categories Communications Computer Industry Companies Computer Science Data Graphics Hardware Internet and Online Services Mobile Computing Multimedia Networks Open Source Operating Systems Programming Software Standards Types of Computers Wireless Computing World Wide Web Home Term of the Day New Terms Pronunciation ... Be a Commerce Partner hashing Last modified: Tuesday, October 14, 2003 Producing hash values for accessing data or for security . A hash value (or simply hash ), also called a message digest , is a number generated from a string of text. The hash is substantially smaller than the text itself, and is generated by a formula in such a way that it is extremely unlikely that some other text will produce the same hash value. Hashes play a role in security systems where they're used to ensure that transmitted messages have not been tampered with. The sender generates a hash of the message, encrypts it, and sends it with the message itself. The recipient then decrypts both the message and the hash, produces another hash from the received message, and compares the two hashes. If they're the same, there is a very high probability that the message was transmitted intact.

8. MySQL :: MySQL 5.0 Reference Manual :: 5.4.9 Password Hashing As Of MySQL 4.1 When a client attempts to connect to the server, there is an initial authentication step in which the client must present a password that has a hash value http://dev.mysql.com/doc/mysql/en/Password_hashing.html

Skip navigation links The world's most popular open source database Contact a MySQL Representative Login Register MySQL.com ... MySQL 5.1 Reference Manual MySQL 5.0 Reference Manual MySQL 3.23/4.0/4.1 Manual Search manual: Additional languages French Spanish MySQL 5.0 Reference Manual 5 MySQL Server Administration ... 5.4 The MySQL Access Privilege System :: 5.4.9 Password Hashing as of MySQL 4.1 Section Navigation Toggle 5.4 The MySQL Access Privilege System 5.4.1 What the Privilege System Does 5.4.2 How the Privilege System Works ... 5.4.8 Causes of Access denied Errors 5.4.9 Password Hashing as of MySQL 4.1 5.4.9.1 Implications of Password Hashing Changes for Application Programs 5.4.9. Password Hashing as of MySQL 4.1 5.4.9.1. Implications of Password Hashing Changes for Application Programs MySQL user accounts are listed in the user table of the mysql database. Each MySQL account is assigned a password, although what is stored in the Password column of the user table is not the plaintext version of the password, but a hash value computed from it. Password hash values are computed by the function.

9. Cuckoo Hashing Definition of cuckoo hashing, possibly with links to more information and implementations. http://www.nist.gov/dads/HTML/cuckooHashing.html

cuckoo hashing (data structure) Definition: A dictionary implemented with two hash tables , T and T , and two different hash functions , h and h . Each key , k, is either in T [h (k)] or T [h (k)]. A new key , k, is stored in T [h (k)]. If that location is already occupied by another key, l, the other key is moved to T [h (l)]. Key are moved back and forth until a key moves to an empty location or a limit is reached. If the limit is reached, new hash functions are chosen, and the tables are rehashed. For tables that are a bit less than half full and universal hashing functions, performance is good. A key is deleted by removing it from a table. Generalization (I am a kind of ...) hash table Aggregate parent (I am a part of or used in ...) dictionary Aggregate child (... is a part of or used in me.) array hash function See also 2-left hashing Note: The name comes from the European cuckoo , whose young pushes other, competing eggs out of the nest. Author: PEB More information Rasmus Pagh and Flemming Friche Rodler Cuckoo Hashing , Proceedings of ESA 2001, Lecture Notes in Computer Science, vol. 2161, pages 121-?, 2001.

10. Hmac Keyed Hashing For Message Authentication Network Working Group H. Krawczyk Request for Comments 2104 IBM Category Informational M. Bellare UCSD R. Canetti IBM February 1997 HMAC Keyedhashing http://www.ietf.org/rfc/rfc2104.txt

11. RFC 2104 (rfc2104) - HMAC: Keyed-Hashing For Message Authentication RFC 2104 HMAC Keyed-hashing for Message Authentication. http://www.faqs.org/rfcs/rfc2104.html

RFC 2104 (RFC2104) Internet RFC/STD/FYI/BCP Archives RFC Index RFC Search Usenet FAQs Web FAQs ... Cities Alternate Formats: rfc2104.txt rfc2104.txt.pdf RFC 2104 - HMAC: Keyed-Hashing for Message Authentication RFC 1826 , August 1995. [BCK1] M. Bellare, R. Canetti, and H. Krawczyk, "Keyed Hash Functions and Message Authentication", Proceedings of Crypto'96, LNCS 1109, pp. 1-15. ( http://www.research.ibm.com/security/keyed-md5.html ) [BCK2] M. Bellare, R. Canetti, and H. Krawczyk, "Pseudorandom Functions Revisited: The Cascade Construction", Proceedings of FOCS'96. [Dobb] H. Dobbertin, "The Status of MD5 After a Recent Attack", RSA Labs' CryptoBytes, Vol. 2 No. 2, Summer 1996. http://www.rsa.com/rsalabs/pubs/cryptobytes.html [PV] B. Preneel and P. van Oorschot, "Building fast MACs from hash functions", Advances in Cryptology CRYPTO'95 Proceedings, Lecture Notes in Computer Science, Springer-Verlag Vol.963, 1995, pp. 1-14. [MD5] Rivest, R., "The MD5 Message-Digest Algorithm", RFC 1321 , April 1992. [MM] Meyer, S. and Matyas, S.M., Cryptography, New York Wiley, 1982. [RIPEMD] H. Dobbertin, A. Bosselaers, and B. Preneel, "RIPEMD-160: A strengthened version of RIPEMD", Fast Software Encryption, LNCS Vol 1039, pp. 71-82.

12. Dchashing.org/net/com New Hash In Southern Maryland SMUTTy Crab H3. Saturday, March 15th, 2008 200 PM Joint BAH3-SMUTTy Crab Green Dress Hash (Annapolis) http://www.dchashing.org/

Weekly calendar of local hashes Coming Local Events MVH3 Annual General Meeting (AGM) April 25-27th, 2008 Theme: "Think Beach!" Details here (updated 3/10) New Hash In Southern Maryland - SMUTTy Crab H3 Joint BAH3-SMUTTy Crab Green Dress Hash (Annapolis) More SMUTTy Crab HHH information EWH3 Presents the 469th / $15 Prom Hash Saturday, March 29th, 2008 4-10:00 PM details OTH4 17th Annual Hash-A-Thon Saturday, April 5th, 2008 Sign-in 11:00 AM details Gathering of the Clans DC Full Moon Hash Sponsor: S.H.I.T. Saturday, April 19th, 2008 5:00 PM Birthday Hash details OTH4 presents the 12th Anal Tubing In The Shenandoah (T.I.T.S) July 3rd-6th, 2008 Details Last update: March 24th, 2008 Hard Drive t SE

13. PwdHash As a result, the site only sees a domainspecific hash of the password, PwdHash must somehow recognize the old password field and avoid hashing it. http://crypto.stanford.edu/PwdHash/

Web Password Hashing Description Publications Download Challenges ... Project Staff Description The Common Password Problem. Users tend to use a single password at many different web sites. By now there are several reported cases where attackers breaks into a low security site to retrieve thousands of username/password pairs and directly try them one by one at a high security e-commerce site such as eBay. As expected, this attack is remarkably effective. A Simple Solution. PwdHash is an browser extension that transparently converts a user's password into a domain-specific password. The user can activate this hashing by choosing passwords that start with a special prefix ( ) or by pressing a special password key (F2). PwdHash automatically replaces the contents of these password fields with a one-way hash of the pair (password, domain-name). As a result, the site only sees a domain-specific hash of the password, as opposed to the password itself. A break-in at a low security site exposes password hashes rather than an actual password. We emphasize that the hash function we use is public and can be computed on any machine which enables users to login to their web accounts from any machine in the world. Hashing is done using a Pseudo Random Function (PRF).

14. Locality Sensitive Hashing (LSH) Home Page LocalitySensitive hashing (LSH) is an algorithm for solving the (approximate/exact) Near Neighbor Search in high dimensional spaces. http://www.mit.edu/~andoni/LSH/

LSH Algorithm and Implementation (E2LSH) Locality-Sensitive Hashing (LSH) is an algorithm for solving the (approximate/exact) Near Neighbor Search in high dimensional spaces. On this webpage, you will find pointers to the newest LSH algorithm in Euclidean (l_2) spaces, as well as the description of the package , an implementation of this new algorithm for the Euclidean space. LSH algorithm description: Most recent algorithm (2006): "Near-Optimal Hashing Algorithms for Near Neighbor Problem in High Dimensions" (by Alexandr Andoni and Piotr Indyk). In Proceedings of the Symposium on Foundations of Computer Science (FOCS'06) Slides: Here are some slides on the LSH algorithm from a talk given by Piotr Indyk. A good description of earlier algorithms: a book with a good introduction to LSH, and the description of affairs as of 2005, is Nearest Neighbor Methods in Learning and Vision: Theory and Practice , by T. Darrell and P. Indyk and G. Shakhnarovich (eds.), MIT Press, 2006. See book introduction for a smooth introduction to NN problem and LSH, as well as the following book chapter on LSH.

15. Tom White's Blog: Consistent Hashing I ve bumped into consistent hashing a couple of times lately. The paper that introduced the idea (Consistent hashing and Random Trees Distributed Caching http://weblogs.java.net/blog/tomwhite/archive/2007/11/consistent_hash.html

User: Password: Register Login help My pages Projects ... java.net Get Involved java-net Project Request a Project Project Help Wanted Ads Publicize your Project ... Submit Content Get Informed About java.net Articles Blogs Events ... java.net Archives Get Connected java.net Forums Wiki and Javapedia People Partners , and Jobs Java User Groups RSS Feeds Search Web and Projects: Online Books: Advanced Search Tom White's Blog Main Consistent Hashing Posted by tomwhite on November 27, 2007 at 09:56 AM Comments (2) I've bumped into consistent hashing a couple of times lately. The paper that introduced the idea ( Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web by David Karger et al ) appeared ten years ago, although recently it seems the idea has quietly been finding its way into more and more services, from Amazon's Dynamo to memcached (courtesy of Last.fm ). So what is consistent hashing and why should you care? The need for consistent hashing arose from limitations experienced while running collections of caching machines - web caches, for example. If you have a collection of n cache machines then a common way of load balancing across them is to put object o in cache machine number hash(o) mod n . This works well until you add or remove cache machines (for whatever reason), for then

16. Java Theory And Practice: Hashing It Out In this installment of Java theory and practice, Java developer Brian Goetz shows you the rules and guidelines you should follow when creating Java classes http://www.ibm.com/developerworks/java/library/j-jtp05273.html

Skip to main content Country/region select All of dW AIX and UNIX Information Mgmt Lotus Rational Tivoli WebSphere Architecture Autonomic computing Java technology Linux Multicore acceleration Open source Web development XML dW forums alphaWorks All of IBM Home Business solutions IT services Products ... Rate this page Related links Java technology technical library developerWorks Java technology Java theory and practice: Hashing it out Document options Document options requiring JavaScript are not displayed Discuss Rate this page Help us improve this content Level: Introductory Brian Goetz brian@quiotix.com ), Principal Consultant, Quiotix Corp 27 May 2003 Every Java object has a and an method. Many classes override the default implementations of these methods to provide a higher degree of semantic comparability between object instances. In this installment of Java theory and practice , Java developer Brian Goetz shows you the rules and guidelines you should follow when creating Java classes in order to define and effectively and appropriately.

17. Hashing, Hash Tables, And Scatter Tables hashing, Hash Tables, and Scatter Tables. A very common paradigm in data processing involves storing information in a table and then later retrieving the http://www.brpreiss.com/books/opus5/html/page205.html

Data Structures and Algorithms with Object-Oriented Design Patterns in Java Hashing, Hash Tables, and Scatter Tables A very common paradigm in data processing involves storing information in a table and then later retrieving the information stored there. For example, consider a database of driver's license records. The database contains one record for each driver's license issued. Given a driver's license number, we can look up the information associated with that number. Similar operations are done by the Java compiler. The compiler uses a symbol table to keep track of the user-defined symbols in a Java program. As it compiles a program, the compiler inserts an entry in the symbol table every time a new symbol is declared. In addition, every time a symbol is used, the compiler looks up the attributes associated with that symbol to see that it is being used correctly and to guide the generation of the bytecodes Typically the database comprises a collection of key-and-value pairs. Information is retrieved from the database by searching for a given key. In the case of the driver's license database, the key is the driver's license number and in the case of the symbol table, the key is the name of the symbol. In general, an application may perform a large number of insertion and/or look-up operations. Occasionally it is also necessary to remove items from the database. Because a large number of operations will be done we want to do them as quickly as possible.

18. Hashing - Definition From The Merriam-Webster Online Dictionary Definition of hashing from the MerriamWebster Online Dictionary with audio pronunciations, thesaurus, Word of the Day, and word games. http://www.merriam-webster.com/dictionary/hashing

Home Visit Our Sites Unabridged Dictionary Learner's Dictionary ... Contact Us Also Visit: Unabridged Encyclopedia Britannica Visual ESL: Learner's for Kids: Spell It! Word Central Dictionary Thesaurus Spanish/English Medical Search "hash" in: Thesaurus Spanish/English Medical Dictionary Open Dictionary Browse words next to: hash Browse the Dictionary: A B C D ... Z hashing One entry found. hash[1,transitive verb] Main Entry: hash Pronunciation: Function: transitive verb Etymology: French hacher, from Old French hachier, from hache battle-ax, of Germanic origin; akin to Old High German sickle; akin to Greek koptein capon Date: 1 a  to chop (as meat and potatoes) into small pieces b confuse muddle  to talk about review over or out Learn more about "hash" and related topics at Britannica.com Find Jobs in Your City Pronunciation Symbols Products ... Advertising Info

19. Consistent Hashing And Random Trees Distributed Caching Protocols We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. http://citeseer.ist.psu.edu/karger97consistent.html

20. Hashing In Smalltalk « The Weekly Squeak hashing in Smalltalk Andrés Valloud has just published “hashing in Smalltalk Theory and Practice” on Lulu. He describes the book as providing “a strong http://news.squeak.org/2008/02/25/hashing-in-smalltalk/

var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); The Weekly Squeak Hashing in Smalltalk February 25, 2008 Andr©s Valloud Hashing in Smalltalk: Theory and Practice Lulu Andr©s has also posted a great illustration of the dangers of the use of inappropriate hashing functions Posted by Michael Davies Filed in Books Smalltalk Squeak Tags: book hashing Brian Says: February 26, 2008 at 1:34 am Any chance this will come out for the Amazon Kindle? Andres Says: February 29, 2008 at 11:00 pm Brian, At this time, the book will only be available through Lulu. Is there a reason why Lulu is not suitable for you? Thanks, Andres. Leave a Reply Name (required) Mail (will not be published) (required) Website Pages About The Weekly Squeak Write us! Category Cloud application Beginners Books Croquet ... Video Links Bug Reporting Croquet Planet Squeak Seaside ... SqueakSwiki Tutorials Croquet Tutorials More Squeak Tutorials Seaside Tutorial Squeak By Example Meta Log in Entries RSS Comments ... WordPress.com

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 1     1-20 of 74    1  | 2  | 3  | 4  | Next 20