21. Half-Mind Catalog: Information & Resources For Hash House Harriers Current and historical information on the Hash House Harriers, around the world, compiled from various sources. the best point of entry for hashing seems to be www.halfmind.com Mind Catalog http://www.half-mind.com/

Navigating this site requires JavaScript. Use the Sitemap ". . . the best point of entry for hashing seems to be www.half-mind.com From there you can find unlimited goofiness around the galaxy." - Mar/Apr 2000 Fitness Runner, the magazine of Road Runner Sports tm IH UK 2004 World HHH Directory IH Goa 2002 World HHH Directory IH Tasmania 2000 World HHH Directory IH 2006 Bidders Overcome Challenges IH Registration Exchange This site is a member of WebRing. To browse visit here This page works best with MS Internet Explorer and display set to either 800 X 600 or 1024 X 768. Latest Update: May 22, 2004 www.half-mind.com

22. The Hashing Function Lounge The hashing Function Lounge. Welcome! 128132. NN91 NIST/NSA, FIPS 180 (supersededby FIPS 1801 and FIPS 180-2). See also NIST s Secure hashing site. http://planeta.terra.com.br/informatica/paulobarreto/hflounge.html

The Hashing Function Lounge Welcome! On this page we try to give an overview of hash functions intended for cryptographic applications. We have been motivated by The Block Cipher Lounge maintained by Lars Knudsen and Vincent Rijmen Whenever a hash function can produce several hash sizes, we only list separate versions if the distinct sizes are obtained by means other than mere truncation. Pentium implementations and performance comparisons for some of the following hash functions can be found at Antoon Bosselaers 's site (though, alas, you won't find any code there). 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. The new hash functions are SHA-224 SHA-256 SHA-384 , and SHA-512 It is perhaps a pity that NIST has not established a hash function quest as it had for AES. In this regard, I used to say here that not all is lost because of the NESSIE project. However, the only hash function submitted to NESSIE was W HIRLPOOL . It may therefore be no wonder but I'm nevertheless delighted, of course that W

23. Encryption, Decryption, Activex, Component, Library, Rijndael, Twofish, RSA, Sec Provides data encryption and hashing services with supports for AES, Twofish, RSA, SHA2, and HAVAL algorithms. By Xceed Software Inc. Component, Commercial http://www.xceedsoft.com/products/Encrypt/

PlaceMenu("mainmenu") Intro Features Versions Download Get in touch with us Sales Support Vanguard Support General Info Info Introduction Current Version : 1.1 Strong encryption for any developer The Xceed Encryption Library is a component for Windows developers that allows applications to encrypt and decrypt data using the latest industry standard strong encryption algorithms. Encryption can be used not only to protect data so that it can only be accessed by the intended partie(s), but also to digitally sign documents and to verify their authenticity. Encryption types The library supports both traditional secret-key encryption as well as public-key encryption, and can encrypt or decrypt memory buffers, strings, blobs, streaming data or files. For traditional strong encryption, the library supports the new AES (US Advanced Encryption Standard) symmetric encryption algorithm known as Rijndael which uses 128, 192 or 256-bit keys. It also supports Twofish, the runner-up candidate for AES. For public-key encryption, the library offers the well-known RSA algorithm with unlimited key sizes. Hashing algorithms The library uses the modern SHA-2 and HAVAL hashing algorithms so that passphrases can be converted to exactly the amount of bits required for an encryption key and with better mathematical properties than older hashing algorithms such as MD5.

24. Hash House Harriers Hash House Harriers, Atlanta, Georgia, Southern Comfort Hash House Harriers, Atlanta's SouthSide Hash House Harriers, shiggy, extreme hashing, jogging, beer drinking, singing, Knoxville, Tennessee http://www.onin.com/hhh

Georgia Hashes Atlanta H4 Every Saturday NEXT TRAIL Black Sheep Every Other Sunday NEXT TRAIL Dark Side New Moon Lunar Cycles Atlanta's Longest Hash NEXT TRAIL Hog Mountain Every Other Sunday NEXT TRAIL Moonlite Every Monday NEXT TRAIL Pine Lake Every Saturday NEXT TRAIL SOB Start Info Hash Trash Every Other Sunday NEXT TRAIL Southern Comfort Every Friday NEXT TRAIL Middle Georgia Macon, GA Area NEXT TRAIL Wheel Hopper Atlanta Bike Hashing NEXT TRAIL Ben Hill Every Other Monday Fitzgerald, GA Area NEXT TRAIL Houston Every Other Wednesday Houston County, GA Area NEXT TRAIL Chattahoochee Valley Fort Benning, GA NEXT TRAIL Slow Lazy Urban Thursday (S.L.U.T.) First Thursday of the Month NEXT TRAIL Slackers On Trail Volksmarching in disguise... these folks avoid all shiggy NEXT TRAIL Peach Fuzz Hash Augusta, GA NEXT TRAIL Savannah Augusta, GA NEXT TRAIL Two for Tuesday 2nd Tuesday of the Month Atlanta, GA NEXT TRAIL Samurai Far Eastern Atlanta Hashing (Kanagawa-ken) NEXT TRAIL Who are the Hash House Harriers? Click here to see an explanation. Click here to locate Hash Groups. Read Hashing related news articles Click here to see a Press Kit about Hashing.

25. Video: Political Parties Already Hashing Out 2004 Primary Schedule - May 1, 2000 CNN http://www.cnn.com/2000/ALLPOLITICS/stories/05/01/video.woodruff/index.html

allpolitics.com EXIT POLLS: Louisiana, GOP Louisiana, Dem Texas, GOP Texas, Dem Tennessee, GOP Tennessee, Dem Oklahoma, GOP Oklahoma, Dem Mississippi, GOP Mississipp, Dem Florida, GOP Florida, Dem Colorado, Dem Colorado, GOP Georgia, GOP Georgia, Dem Vermont, GOP Vermont, Dem Ohio, GOP Ohio, Dem Connecticut, GOP Connecticut, Dem Maine, GOP Maine, Dem Maryland, GOP Maryland, Dem Massachusetts, GOP Massachusetts, Dem Missouri, GOP Missouri, Dem Rhode Island, GOP Rhode Island, Dem New York, GOP New York, Dem California, GOP California, Dem California, nonpartisan Virginia, GOP Arizona, GOP Michigan, GOP South Carolina, GOP Delaware, GOP Delaware, Dem New Hampshire, GOP New Hampshire, Dem Iowa RESULTS: Kentucky Oregon New Mexico New Jersey South Dakota Montana Alabama Nebraska West Virginia North Carolina Indiana District of Columbia Pennsylvania Wisconsin Wyoming, Dem Delaware, Dem Nevada, GOP Louisiana Texas Tennessee Oklahoma Mississippi Florida Minnesota, Dem Nevada, Dem South Carolina, GOP Utah Colorado South Carolina, Dem American Samoa

26. Calu's Macromedia Director Xtras Data Linker Xtra links Director to various data sources including Access and Excel. MD5 hashing Xtra encodes strings and files using the RSA MD5 Message Digest Algorithm. http://www.calu.us/xtras/

Calu Macromedia Director Xtras XTRAS ARTICLES LINKS FORUMS ... Support Forum Rosetta Xtra v1.0.4 for Windows March.10.2004 The Rosetta Xtra is a multi-media scripting xtra for Macromedia Director developers. Rosetta is designed to add a broad range of support for additional media types not natively supported by Director. These media types include many of today's popular software products that is available on the market. The goal is to help you integrate your Director product with other application quickly and seamlessly. Some of Rosetta Xtra's features include: Create and/or extract text and images from Microsoft PowerPoint. Control Presentations (PPT, PPS) Create and/or extract text, images and Excel Charts from Microsoft Excel (XLS) Create and extract files zip compatible files (ZIP) Read and write ASCII to support binary and plain text files. Read and/or write to windows Registry (and INI files ) with advance data type conversions Read and/or write popular image formats (BMP, JPEG, GIF, PNG, TIFF, ICO, PCX, TGA, WMF, JBG, J2K, PDF) Capture images from windows, Director's internal buffer, or off screen buffer.

27. A Brief History Of The Hash House Harriers MODERN HARRIERS. hashing in Kuala Lumpur was suspended during the World War IIoccupation by Japanese forces, but then reestablished after peace returned. http://harrier.net/presskit/shistory.html

Press Kit Home Premise of Hashing A Brief History of Hashing Essential Definitions ... In Memory of "G" A Brief History of the Hash House Harriers ANCIENT HARRIERS Hash House Harrier roots extend back to the old English schoolboy game of " Hares and Hounds ," in which some players, called "hounds," chase others, called "hares," who have left a trail of paper scraps along their route across fields, hedges, streams, bogs, and hills. One of the earliest Hares and Hounds events on record was the "Crick Run" at Rugby School in Warwickshire, England, first held in 1837. Hare and Hounds as an adult sport began in the fall of 1867 with a group of London oarsmen who wanted to keep fit during the winter. Also called "Paper Chasing" or the "Paper Chase," the game became very popular after its introduction on Wimbledon Common in 1868 by the Thames Hare and Hounds. Early clubs called themselves "Hare and Hounds" or simply "Harriers." THE HASH IS BORN The Hash House Harriers as we know it today was founded in Malaya (now Malaysia) by Albert Stephen Ignatius Gispert, an English chartered accountant.

28. Medussa: A Distributed Password Cracker A distributed password cracking tool for LAN environments supporting a multitude of hashing algorihms. http://www.bastard.net/~kos/medussa/

Medussa: A distributed password cracker Speaking of the scheduler, after a successful compile you ought to have three components at your disposal. These are: Medussa The keeper of the keyspace and distributor at large. Tentacle The client executable. Mecon Administration interface to medussa. Download medussa-0.6pl2.tar.gz Dev version: More generators, compartmentalized code. medussa-0.7.tar.gz No major changes, makefile/compilation fixes. Somewhat old doc: [HTML] [PS] Dependencies OpenSSL: version 0.9.6 tested gmp: GNU multiple precision library, version 4.1 tested Any bugs, inaccuracies, blame me Back $Id: index.html,v 1.5 2003/02/05 05:00:22 kos Exp $

29. Hashing? 2. A crosscountry runner. hashing? So you re interested in hashing. If you re seriousabout trying hashing come on out and join the fun! See you at the hash! http://harrier.net/primer/hashing.html

Hash House Harriers? According to Webster: hash house (slang), n., a cheap restaurant. harrier , n., any of an English breed of dog used for hunting rabbits. A cross-country runner. Hashing? So you're interested in hashing. Maybe it's because you've seen strange flour markings on roads and trails in the Pikes Peak region (arrows, circles, and the such), or you've noticed a group of people on a Saturday afternoon senselessly running in Monument Creek or through Chapel Hills Mall. Most likely, it's because a hasher's silver tongue convinced you to consider the sport. In any event, welcome to the Pikes Peak Hash House Harriers and Harriettes (P2H4). Variously described as "the lunatic fringe of running" and "the drinking club with a running problem," the Hash House Harriers are a worldwide group with some 350 chapters in the United States, including a dozen in Colorado. Our premise is simple, one harrier (the hare) lays a trail of flour over a course (s)he chooses. The other harriers (the hounds) try to follow that trail to the end where we enjoy munchies and beer (or soft drinks for those disinclined to imbibe). The typical hash is 3-5 miles over hill and dale, through suburbs, woods, malls, et al. The hash isn't a race - no prizes to the swift. Following the trail is the challenge, camaraderie and beverages are the rewards.

30. The Guide To Hashing In Japan, Hash House Harriers Join us! The Guide to hashing in Japan. This page last updated 20 February2004 Guide to hashing in Japan Webmaster@gotothehash.net. http://gotothehash.net/japan.html

Japan H3 Lineage International Weather Storm Watch World Hash Links ... Lonely Planet Get FREE E-mail here: Beer.com Excite Mail Hotmail Mail City ... Yahoo Mail The Guide to Hashing in Japan (click on map for more info) All Japan Nash Hash 2004 H3 Pages in Japan Hiroshima H3 Ibaraki H3 Iwakuni White Snake H3 Kanto Katch the Hare ... Tokyo Ladies H3 Select: The Web Web Catalog Auctions Audio/MP3 Images Newscrawler This page last updated 20 February 2004 Guide to Hashing in Japan Webmaster@gotothehash.net

31. Kuala Lumpur Mountain Bike Hash Club Homepage of the premier bike hash in Malaysia, the home of hashing. http://www.bikehash.freeservers.com

Free Web site hosting - Freeservers.com Web Hosting - GlobalServers.com Choose an ISP NetZero High Speed Internet ... Dial up $14.95 or NetZero Internet Service $9.95 since 1994 The menu has downgraded. Articles Intro and FAQ How to set a hash Membership form Equipment Review Seven Sola Ti Avid Ultimate Levers Speedplay Frogs MSR Hydromedary bladder ... Crankbros Eggbeater pedals GPS GPS Primer Which GPSr? Snakebite: what to do if... Teach a child to ride ... Paranormal Ride, Part II Gallery 2001 Annual Dinner Bukit Kiara Photo Essay Monsoon Madness 800 Tips for the Home Mechanic ... Who's There Wins Trailguide Overview Old Dam Trail, Ulu Gombak Sg Dua, Pahang Kg Sg Pusu, Ulu Gombak ... Forum Archives Historical Hareline Hare Tonic Run Sites Basherama! ... Next Bash Selamat datang, welcome to the home page of the Kuala Lumpur Mountain Bike Hash. KLMBH holds monthly mountain bike hashes (" bashes ") in the Klang Valley area, usually on the last Sunday of each month. You're welcome to join us on our forays into the countryside. Click HERE for the directions to our next hash. Bash Orgynisation Basher in Chief: Pat "Pigpen" Brunsdon Bash Cash: Phil Bee Bash News: Mary Yap Bash Piss: Paul Moir Hare Raiser: Melody "Tank Girl" Web Bash: Kelvin Wong Bash Haberdash: Lim Ann Nee What's New Who's There Wins An article on cycling in Beijing by Dr Nosedive.

32. Hashing In Hanoi http://www.wso.net/hhhh/

This page uses frames, but your browser doesn't support them.

33. Network Working Group H. Krawczyk Request For Comments 2104 IBM Working Group H. Krawczyk Request for Comments 2104 IBM Category InformationalM. Bellare UCSD R. Canetti IBM February 1997 HMAC Keyedhashing for Message http://www.ietf.org/rfc/rfc2104.txt

34. Eric Nusbaum Software :: Modern Applications For A Modern World Duplicate file remover implementation of both optical recognition and RSA MD5 hashing. Beta http://www.jpegduper.com/

Released JPEG Duper v1.0 Build 185 Released JPEG Duper v1.0 Build 184 Be sure to check out our Frequent Updates on the development of JPEG Duper v2.0! Lauched Web Hosting Service Released a SNEAK PREVIEW at an early version of the JPEG Duper v2.0 U.I.! JPEG Duper v2.0 information packet released. Check out the Information Page for more details. Released JPEG Duper v1.0 Build 182 as final! Released JPEG Duper v1.0 Build 178 to public for beta testing! Released JPEG Duper v1.0 Build 175 to public for beta testing! Here you will find the latest information on current and upcoming software releases. Our latest product line currently consists of our ground breaking application JPEG Duper . This utility allows anyone ranging from home office user to a professional photographer to scan through 1000's of Images and eliminate duplicates thus freeing space and cleaning out a library of unwanted images. We here at Eric Nusbaum Software are dedicated in bringing people quality software at a fraction of the cost. Current retail software packages are costing more and more these days, making it

35. News: Encryption, Hashing, And Obfuscation Alerts, News Commentary, Encryption, hashing, and obfuscation. By work.That’s where encryption, hashing, and obfuscation come in. This http://zdnet.com.com/2100-1107-995962.html

Comcast to offer phone service in 2006 Free e-mail news alerts Hardware Software ... Alerts News Commentary Encryption, hashing, and obfuscation By Paul Tyma Special to ZDNet April 8, 2003, 4:20 AM PT Add your opinion Forward in Format for COMMENTARYI can imagine a world where the computers needed no security. Where there were no passwords, no security checks, and no firewalls. Where the computers communicated freely and shared information rather than hiding it. I can also imagine the scoundrels of earth hacking that world’s net and stealing all their credit cards. Unfortunately, that is our reality. In today’s world of interconnected networks: Secure it, or lose it. We don’t have the luxury of running insecure networks or exposing insecure data. Unfortunately, it’s often our task to sell that data and try to prevent those from seeing it to profit from our work. That’s where encryption, hashing, and obfuscation come in. This article hopes to clear up some misconception in the industry as to how these technologies work and how they relate to each. In practice, they do not conflict at all. Simply put, each works best in a specific problem domain.

36. The Beaver Parser Generator A LALR(1) parser generator. Uses very fast (based on perfect hashing) parsing engine. Open source, LGPL http://beaver.sourceforge.net

Beaver - a Parser Generator Home Manual Usage Input Actions Precedence ... Download Introduction Beaver is a LALR(1) parser generator. It takes a context free grammar and converts it into a Java class that implements a parser for the language described by a grammar. Beaver is similar to CUP , yet it has several important distinctive characteristics: It uses more sophisticated parsing engine which is much faster It supports some EBNF notations in grammars to allow more compact specifications. It is implemented to allow multiple parsing instances to work in parallel, and to allow parser instance reuse. It can be easily integrated in a development environment.

37. Data Structures And Algorithms Hash Tables 1) search time table. Unfortunately, finding a perfect hashing functionis not always possible. Rehashing. Re-hashing schemes use http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/hash_tables.html

Data Structures and Algorithms 8.3 Hash Tables 8.3.1 Direct Address Tables If we have a collection of n elements whose keys are unique integers in (1, m ), where m n then we can store the items in a direct address table, T[m] where T i is either empty or contains one of the elements of our collection. Searching a direct address table is clearly an O(1) operation: for a key, k , we access T k if it contains an element, return it, if it doesn't then return a NULL. There are two constraints here: the keys must be unique, and the range of the key must be severely bounded. If the keys are not unique, then we can simply construct a set of m lists and store the heads of these lists in the direct address table. The time to find an element matching an input key will still be O(1) However, if each element of the collection has some other distinguishing feature (other than its key), and if the maximum number of duplicates is n dup max , then searching for a specific element is O(n dup max . If duplicates are the exception rather than the rule, then n dup max is much smaller than n and a direct address table will provide good performance. But if

38. John The Ripper Password Cracker A portable password cracker with builtin efficient implementations of multiple password hashing algorithms found on various Unix flavors. Additionally supports Kerberos AFS and Windows NT LanMan hashes, plus more with contributed patches. Officially supported are most Unix-like systems, Win32, DOS. http://www.openwall.com/john/

Openwall Project /home Owl JtR ... mirrors bringing security into open environments John the Ripper password cracker John the Ripper is a fast password cracker, currently available for many flavors of Unix (11 are officially supported, not counting different architectures), DOS, Win32, BeOS, and OpenVMS. Its primary purpose is to detect weak Unix passwords. Besides several crypt(3) password hash types most commonly found on various Unix flavors, supported out of the box are Kerberos AFS and Windows NT/2000/XP LM hashes, plus several more with contributed patches. PR.openwall.net: Password Recovery Resources on the Net Stable: John the Ripper 1.6 (Unix - sources, 486 KB) and its signature John the Ripper 1.6 (DOS - binaries, 693 KB) and its signature John the Ripper 1.6 (Win32 - binaries, 763 KB) and its signature Development: John the Ripper 1.6.37 (sources only, 136 KB) and its signature The current development version offers significant performance improvements over the 1.6 release, but no documentation and charset files are provided, and more testing is needed. Please provide your feedback. These files are also available via FTP locally and from the mirrors . You are encouraged to use the mirrors, but be sure to verify the

39. Data Structures And Algorithms: Hash Functions 8.3.3 hashing Functions. Choosing a good hashing function, h(k), is essential forhashtable based searching. h(k) = floor((mk)/r). will provide uniform hashing. http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/hash_func.html

Data Structures and Algorithms 8.3.3 Hashing Functions Choosing a good hashing function, h(k) , is essential for hash-table based searching. h should distribute the elements of our collection as uniformly as possible to the "slots" of the hash table. The key criterion is that there should be a minimum number of collisions. If the probability that a key, k , occurs in our collection is P(k) , then if there are m slots in our hash table, a uniform hashing function h(k) , would ensure: Sometimes, this is easy to ensure. For example, if the keys are randomly distributed in (0, r ], then, h(k) = floor((mk)/r) will provide uniform hashing. Mapping keys to natural numbers Most hashing functions will first map the keys to some set of natural numbers, say (0,r]. There are many ways to do this, for example if the key is a string of ASCII characters, we can simply add the ASCII representations of the characters mod 255 to produce a number in (0,255) - or we could xor them, or we could add them in pairs mod 2 -1, or ... Having mapped the keys to a set of natural numbers, we then have a number of possibilities.

40. Homepage Of Søren Abildtrup My interests are computers, internet, fixing my car and hashing. http://www.checkmark.dk/sa/

You have reached the homepage of Søren Abildtrup On my site your may find various information about me, my pets, my PC and what I do in my spare time. Also links to some of the programs I use and homepages of interest. Furthermore I have a section about the genealogy of the Abildtrup family. My work is quite a big part of my life. Have a look at http://www.klima-design.com/gb/ to see what I do for a living. If you are viewing this text, your browser doesn't support frames. To have full use of my site, update your current browser.

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 2     21-40 of 168    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20