
	Where results make sense

Topic: Luhn algorithm

Related Topics

Check digit

Credit card number

Tax File Number

CUSIP

Parity bit

Algorithm

Credit card

List of checksum algorithms

Checksum

Hash function

Cyclic redundancy check

Bank Identification Number

Hans Peter Luhn

Cksum

MD4

In the News (Fri 29 Aug 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	Luhn algorithm - Wikipedia, the free encyclopedia
		The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, was developed in the 1960s as a method of validating identification numbers.
		It was created in the 1960s by IBM scientist Hans Peter Luhn (1896–1964).
		The algorithm is in the public domain and is in wide use today.
	en.wikipedia.org /wiki/Luhn_algorithm (580 words)

	Luhn Algorithm : MerchantSite E-commerce guide
		Luhn Algorithm itself is a simple check and only verifies that the Credit Card number is of a valid format.
		Luhn algorithm checks are often made in online systems to verify that the number was correctly entered and as a first line security check.
		As the algorithm bares not relation to whether the card is stolen, whether the owner details are correct or whether funds are available it is not suitable to be used as the sole check on card details.
	www.merchantsite.co.uk /glossary/luhn_algorithm.php (137 words)

	Luhn Algorithm
		Parallel algorithms Made Easy The complexity of today's applications coupled with the widespread use of parallel computing has made the design luhn algorithm and analysis of parallel algorithms topics of growing interest.
		This innovative book provides the reader with knowledge of the important algorithms necessary for an in-depth understanding of distributed systems; at the same time it motivates the study of these algorithms by presenting a systems framework for their practical application.
		Structures the coverage of algorithms around the creation of a framework for implementing a replicated server-a prototype for implementing a fault-tolerant luhn algorithm and highly available distributed system.
	lepcoinc.com /luhnalgorithm.html (918 words)

	What is Luhn formula? - A Word Definition From the Webopedia Computer Dictionary (Site not responding. Last check: 2007-10-09)
		Based on ANSI X4.13, the LUHN formula (also known as the modulus 10 -- or mod 10 -- algorithm) is used to generate and/or validate and verify the accuracy of credit-card numbers.
		The LUHN formula was created in the late 1960s by a group of mathematicians.
		In fact, the LUHN formula is widely used to generate the check digits of many different primary account numbers.
	www.webopedia.com /TERM/L/Luhn_formula.html (351 words)

	Luhn
		The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, was developed...
		Luhn used it as a null hypothesis to...
		To calculate the Luhn algorithm for a number (passed in as a string of digits), convert it to an...
	www.fatefake.info /fakecreditcardnumbers/luhn (978 words)

	Hans Peter Luhn - Wikipedia, the free encyclopedia
		Hans Peter Luhn was born in Barmen, Germany on July 1, 1896.
		Luhn spent greater and greater amounts of time on the problems of information retrieval and storage faced by libraries and documentation centers, and pioneered the use of data processing equipment in resolving these problems.
		"Luhn was the first, or among the first, to work out many of the basic techniques now commonplace in information science." These techniques included full-text processing; hash codes; Key Word in Context indexing (KWIC); auto-indexing; automatic abstracting and the concept of selective dissemination of information (SDI).
	en.wikipedia.org /wiki/Hans_Peter_Luhn (445 words)

	Luhn algorithm
		It is not intended to be cryptographically secure hash function; it protects against random error, not malicious attack.
		The formula generates a check digit, which is usually appended to a partial account number to generate the full account number.
		It is usually the case that check digits are added to the end, although this requires a simple modification to the algorithm to determine an ending check digit given the rest of the account number.
	publicliterature.org /en/wikipedia/l/lu/luhn_algorithm.html (489 words)

	External Object Identifier Scheme
		Another checksum algorithm is the Luhn checksum algorithm, which computes a single check digit from a sequence of zero or more decimal digits.
		The algorithm for a sequence with an odd number of digits is as follows.
		Source notes: this algorithm is described (not surprisingly, given its relation to credit cards) in several hacker publications, e.g., Phrack, vol.
	www.alexandria.ucsb.edu /~gjanee/archive/2002/external-ids.html (736 words)

	Mission Data Blog » Blog Archive » Credit card type and luhn check in ruby
		I was looking at implementing a luhn and credit card type check the other day in java and I noticed that there seems to be a lack of code for doing this in ruby.
		The luhn algorithm is fairly simple, if you want to learn more about it check here.
		Before running the luhn check you may want to verify that you have a valid card type or at least one you want to accept.
	blogs.missiondata.com /?p=25 (517 words)

	Luhn Algorithm (Site not responding. Last check: 2007-10-09)
		The Luhn algorithm (also known as modulo-10) is used to check that a credit card number looks valid.
		The reason for this webpage is to provide source code for a Luhn algoritm in C and Java.
		This is because when I needed a Luhn implementation, all the ones I could find on the web were either broken or written in joke programming languages like Visual Basic.
	www.chriswareham.demon.co.uk /software/luhn.html (112 words)

	Anatomy of Credit Card Numbers
		The algorithm used to arrive at the proper check digit is called the Luhn algorithm, after IBM scientist Hans Peter Luhn (1896-1964), who was awarded US Patent 2950048 ("Computer for Verifying Numbers") for the technique in 1960.
		The most succint description of the Luhn algorithm I have found comes from the hacker publication phrack 47-8: "For a card with an even number of digits, double every odd numbered digit and subtract 9 if the product is greater than 9.
		By changing the check digit from 0 to 3, we arrive at the number 4408 0412 3456 7893, which does pass the Luhn check, since the sum of the digits in the bottom row would be 70, which is divisible by 10.
	www.merriampark.com /anatomycc.htm (1161 words)

	codewalkers.com - archives - PHP Help
		There's a big difference between the LUHN mod-10 algorithm (and checksum algorithms in general) and the error correction algorithm like the mod-11 one nawlej linked to.
		In most checksum algorithms, the goal is to catch simple mistakes; e.g., typing a single character incorrectly or switching two adjacent characters.
		ECC algorithms are more complicated though because not only catch when a mistake is made, but which bit (byte, etc.) is incorrect and how it is incorrect.
	codewalkers.com /archives/phpcoding/10780.html (369 words)

	GIGO: words unreadable aloud
		On Halloween, I posted a scary entry about the Luhn algorithm, and Joey deVilla, whose idea this was, mentioned my little programs.
		To calculate the Luhn algorithm for a number (passed in as a string of digits), convert it to an integer ("
		The main work of the whole algorithm is done in the next three lines.
	radio.weblogs.com /0100945/2002/11/02.html (768 words)

	web steps - take control of your site - trinity college notes - luhn formula
		It is a simple checksum formula used to validate a variety of account numbers, such as credit card numbers.
		If when we divide the grand total by ten the remainder is 0 the algorithm validates and we can assume that the credit card details have been entered correctly.
		Of course this does not mean that the credit card has been issued by a valid company or that this account has sufficient funds to cover the sale.
	www.websteps.ie /tcd/luhn_formula.html (375 words)

	Credit Card Check Digit Validation
		A check digit is a digit added to a number (either at the end or the beginning) that validates the authenticity of the number.
		A simple algorithm is applied to the other digits of the number which yields the check digit.
		By running the algorithm, and comparing the check digit you get from the algorithm with the check digit encoded with the credit card number, you can verify that you have correctly read all of the digits and that they make a valid combination.
	www.beachnet.com /~hstiles/cardtype.html (611 words)

	Lun Mod 10
		This rule or algorithm called the Luhn algorithm.
		Thus the above algorithm is called the Luhn modulus 10.
		We have a 90% reliability with the Luhn algorithm.
	www.vijaymukhi.com /security/cryptography/creditcards.htm (612 words)

	Danzisoft Technologies - Custom Software Development for Windows and Linux
		SINs are large and prone to entry errors, so governments and financial institutions use an algorithm called the Luhn Formula to check the validity of the number when it is entered.
		As always, when presented with an algorithm that I need to implement in an application, I try an example or two by hand (using a spreadsheet!) to see if I understand it.
		And finally, the luhn function must return a true or a false, so use '%', the MOD operator, to see what the ones digit of the sum is and return true if the digit is zero and false otherwise.
	www.danzisoft.ca /index.php?page=LUHN (1617 words)

	Illuminations: Check That Digit
		Students will be instructed as to the algorithm and then determine the validity of the number.
		The process used to determine the check digit is the Luhn algorithm (mod 10), named after IBM scientist Hans Peter Luhn.
		The Luhn algorithm is able to detect single data entry errors and most transpositions.
	illuminations.nctm.org /LessonDetail.aspx?id=L693 (2215 words)

	Luhn algorithm in Perl » javier arturo rodríguez » Blog Archive
		Here’s an implementation of the Luhn algorithm in perl.
		I’m using this algorithm to validate GSM IMEI numbers, but the Luhn algorithm is also behind credit card numbers.
		This entry was posted on Friday, December 23rd, 2005 at 6:54 and is filed under General, Code, Perl.
	javier.rodriguez.org.mx /index.php/2005/12/23/luhn-algorithm-in-perl (225 words)

	Using the Luhn Algorithm :: DotNetJohn
		The Luhn algorithm was developed in the 1960's as a way to validate unique numbers such as credit card number, social insurance numbers, insurance numbers and other number forms.
		The algorithm works by suming some form of the digits of the number working from right to left.
		It took me a minute or two to get my brain around it but once you understand the concept of the algorithm, it is really quite simple.
	www.dotnetjohn.com /articles/articleid97.aspx (717 words)

	Claredi - NPI Resources
		This validation routine uses the Luhn algorithm and takes into account the presence or absence of the 80840 prefix.
		Luhn formula for computing modulus 10 "double-add-double" check digit as it originally appeared in the Annex B to ISO Standard 7812-1.
		The Luhn Mod-10 Method implemented with lookup tables, but without accounting for the 80840 prefix.
	www.claredi.com /download/npi_resources.php (609 words)

	Luhn Check - MOD 10 Algorithm (via CobWeb/3.1 planetlab2.cs.unc.edu) (Site not responding. Last check: 2007-10-09)
		Welcome to the PHP Luhn Validator, designed to provide a PHP script to automatically validate numbers according to the Luhn (or MOD 10) algorithm.
		The luhn algorithm is primarily used for the validation of credit card numbers, not only does this provide a catcher for data-entry errors, it also doubles as a weak security tool.
		The Luhn algorithm is not exclusive to credit cards, it can also be used for social security numbers (US - maybe other countries) through to store cards; this Luhn Validation script is generic and does not discriminate between card types.
	www.intermedia-online.com.cob-web.org:8888 /luhn (197 words)

	Luhn algorithm in PHP » javier arturo rodríguez » Blog Archive
		Luhn algorithm in PHP » javier arturo rodríguez » Blog Archive
		As I mentioned before, the Luhn algorithm is used to validate some interesting numbers, most notably GSM IMEIs and credit card numbers.
		You might want to take a look to the Demo for the Luhn Algorithm in PHP to check out some numbers and see that it does work.
	javier.rodriguez.org.mx /index.php/2005/12/26/luhn-algorithm-in-php (237 words)

	isen the playa (Site not responding. Last check: 2007-10-09)
		The Luhn algorithm or Luhn formula, also known as the modular arithmetic 10 or mod 10 algorithm, was developed in the 1960s as a method of validating identification numbers.
		It is not intended to be a cryptography secure hash function, it protects against random error, not malicious attack.
		This account number must pass the following algorithm (and the check digit chosen and placed so that the full account number will): Starting with the second to last digit and moving left, double the value of all the alternating digits.
	isen7895.blogspot.com /2006/04/luhn-algorithmthe-luhn-algorithm-or.html (564 words)

	EE4253 LUHN-10 Secrets
		This simple but effective error detection method is commonly used by companies and organizations when issuing account and membership numbers.
		The algorithm is specified in the ISO-7812-1 standard defining a common format for credit cards.
		It can be argued that for all possible two digit values (00..99) there are 90 cases of two different digits side by side and that the algorithm will fail to detect swapped digits in two of these cases ('09' becomes '90', and '90' becomes '09').
	www.ee.unb.ca /tervo/ee4253/luhn.html (1190 words)

	ASPN : Algorithm::LUHN 0.13 (Site not responding. Last check: 2007-10-09)
		This module calculates the Modulus 10 Double Add Double checksum, also known as the LUHN Formula.
		You can find plenty of information about the algorithm by searching the web for "modulus 10 double add double".
		This function returns true if the final character of CHECKSUMMED_NUM is the correct checksum for the rest of the number and false if not.
	aspn.activestate.com /ASPN/CodeDoc/Algorithm-LUHN/LUHN.html (350 words)

	Black Market Press - Verify a Social Insurance Number (Canadian SSN) (Site not responding. Last check: 2007-10-09)
		This algorithm is known as the LUHN algorithm or the mod-10 algorithm.
		This algorithm can be arranged to generate as well as validate.
		It is the algorithm the government uses for: employer account numbers, trust numbers, Filer identification (your friendly HandR Block e-file rep ;)), and the first nine digits of the Business Number(BN).
	www.blackmarketpress.net /info/identity/SIN_validate_1.htm (378 words)

	What is LUHN formula? - a definition from Whatis.com - see also: modulus 10 (Site not responding. Last check: 2007-10-09)
		Originally created by a group of mathematicians in the 1960s, the LUHN formula is in the public domain, and anyone can use it.
		The LUHN formula applies some simple arithemetic to a credit card number to calculate a number that must agree with the check digit, the last number that appears on the credit card.
		The LUHN formula can be used by a business to make sure a credit card is valid before sending the number for debit authorization.
	searchsecurity.techtarget.com /sDefinition/0,,sid14_gci214514,00.html (413 words)

	[No title] (Site not responding. Last check: 2007-10-09)
		To calculate the Luhn algorithm for a number (passed in as a string of digits), convert it to an integer ("read"), and call the sub-luhner with that number and a 1 as the multiplier.
		So instead of mapping luhn directly onto the test_strs, we map an anonymous function: (\s -> (s ++ " -> " ++ show (luhn s))) onto them.
		The anonymous function takes a string s, and returns a string consisting of the input (parameter) s, an arrow, and then the string version of the True or False result of the luhn call.
	radio.weblogs.com /0100945/gems/Luhn_explain_lhs.txt (566 words)

	Adberg Consulting LLC - Macintosh Consulting
		The Luhn Calculation is a way to verify that a credit card number is potentially valid.
		Not all numbers can potentially be credit card numbers - the number must pass a few tests and an algorithm called Luhn's.
		This database checks the number for its potential - but it in no way guarantees that the number is a current or valid account, it only weeds out the numbers that can never be accounts from those that can.
	www.adbergllc.com /luhn.html (204 words)

Try your search on: Qwika (all wikis)