<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Luhn formula</title>
	<atom:link href="http://www.darkcoding.net/credit-card/luhn-formula/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.darkcoding.net/credit-card/luhn-formula/</link>
	<description>Solvitas perambulum</description>
	<lastBuildDate>Thu, 29 Jul 2010 06:43:17 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.6</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: john</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-18466</link>
		<dc:creator>john</dc:creator>
		<pubDate>Sat, 24 Apr 2010 21:34:19 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-18466</guid>
		<description>when you reverse and take off the check digit. for a 16 digit for example, do you simply just disregard the fact that it was an odd number and then start by multiplying 14th digit and the 12 digit, and skipping the last even digit? and then comming back to it later for the even multiplications?</description>
		<content:encoded><![CDATA[<p>when you reverse and take off the check digit. for a 16 digit for example, do you simply just disregard the fact that it was an odd number and then start by multiplying 14th digit and the 12 digit, and skipping the last even digit? and then comming back to it later for the even multiplications?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: will</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-18436</link>
		<dc:creator>will</dc:creator>
		<pubDate>Sat, 27 Mar 2010 02:11:47 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-18436</guid>
		<description>nice, i used the formula for websites where they want you to put your credit card # in.(websites that dont charge but want your number) i personally thought what idiot would do that so i checked out your website and found this! Good Work.Is this as a hobby or does your job like need you to do this?  Well anyways kool and i&#039;ll probaly have to re-visit the site so i can tell my friends how to make there credit card numbers into fake ones.</description>
		<content:encoded><![CDATA[<p>nice, i used the formula for websites where they want you to put your credit card # in.(websites that dont charge but want your number) i personally thought what idiot would do that so i checked out your website and found this! Good Work.Is this as a hobby or does your job like need you to do this?  Well anyways kool and i&#8217;ll probaly have to re-visit the site so i can tell my friends how to make there credit card numbers into fake ones.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Free Credit Cards (kind of) &#124; Villager With Wheel</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-15667</link>
		<dc:creator>Free Credit Cards (kind of) &#124; Villager With Wheel</dc:creator>
		<pubDate>Sat, 19 Apr 2008 04:54:34 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-15667</guid>
		<description>[...] number&#8221; means reverse the whole credit card number. The Darkcoding site explanations right here and right here as well as the Wikipedia explanation here help clarify what is going on. The [...]</description>
		<content:encoded><![CDATA[<p>[...] number&#8221; means reverse the whole credit card number. The Darkcoding site explanations right here and right here as well as the Wikipedia explanation here help clarify what is going on. The [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rand Al'Thor</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-15257</link>
		<dc:creator>Rand Al'Thor</dc:creator>
		<pubDate>Sun, 20 Jan 2008 20:09:26 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-15257</guid>
		<description>though this is a bit freighting, its fun to see things like this everyday. its not everyday you get a funny bunch like this :) thanks John</description>
		<content:encoded><![CDATA[<p>though this is a bit freighting, its fun to see things like this everyday. its not everyday you get a funny bunch like this :) thanks John</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: James Brown</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-14092</link>
		<dc:creator>James Brown</dc:creator>
		<pubDate>Mon, 03 Sep 2007 21:45:50 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-14092</guid>
		<description>It would seem to me that step 7 of your algorithm is overly complicated.  Let me suggest three alternatives to make the algorithm simpler.

1. If you insist on calculating and comparing to the check digit removed in step 1, then this calculation seems simpler: 10 - (sum % 10).

2. An even easier solution is to add in the check digit removed in step 1 and confirm that the sum % 10 == 0.

3. One more simplification presents itself if you opt for solution 2 above.  Simply do not remove the check digit at all (skip step 1), change step 3 to double all the digits in EVEN positions, and change step 4 to add in the digits in ODD positions.  With these changes the new instructions become ...

# Reverse the number
# Multiply all the digits in even positions (The second digit, the fourth digit, etc) by 2.
# If any one is greater than 9 subtract 9 from it.
# Sum those numbers up
# Add the digits in odd positions (the first, third, etc) to the number you got in the previous step
# Confirm that the sum is an even multiple of 10.  You can do this in code with something like (sum % 10) == 0

- James</description>
		<content:encoded><![CDATA[<p>It would seem to me that step 7 of your algorithm is overly complicated.  Let me suggest three alternatives to make the algorithm simpler.</p>
<p>1. If you insist on calculating and comparing to the check digit removed in step 1, then this calculation seems simpler: 10 &#8211; (sum % 10).</p>
<p>2. An even easier solution is to add in the check digit removed in step 1 and confirm that the sum % 10 == 0.</p>
<p>3. One more simplification presents itself if you opt for solution 2 above.  Simply do not remove the check digit at all (skip step 1), change step 3 to double all the digits in EVEN positions, and change step 4 to add in the digits in ODD positions.  With these changes the new instructions become &#8230;</p>
<p># Reverse the number<br />
# Multiply all the digits in even positions (The second digit, the fourth digit, etc) by 2.<br />
# If any one is greater than 9 subtract 9 from it.<br />
# Sum those numbers up<br />
# Add the digits in odd positions (the first, third, etc) to the number you got in the previous step<br />
# Confirm that the sum is an even multiple of 10.  You can do this in code with something like (sum % 10) == 0</p>
<p>- James</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tamlyn Rhodes</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-11151</link>
		<dc:creator>Tamlyn Rhodes</dc:creator>
		<pubDate>Sat, 31 Mar 2007 11:52:03 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-11151</guid>
		<description>Thanks for this! I thought I&#039;d found a clever way to human-readably encrypt my credit card number in an email by multiplying it with a number that only me and the recipient knew. However it turns out that due to the luhn-induced redundancy it is trivial to retrieve the factors from the product. Drat!</description>
		<content:encoded><![CDATA[<p>Thanks for this! I thought I&#8217;d found a clever way to human-readably encrypt my credit card number in an email by multiplying it with a number that only me and the recipient knew. However it turns out that due to the luhn-induced redundancy it is trivial to retrieve the factors from the product. Drat!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anon</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-9449</link>
		<dc:creator>anon</dc:creator>
		<pubDate>Thu, 09 Nov 2006 20:29:39 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-9449</guid>
		<description>Thanks for the info, this helps me alot with the e-commerce site that I&#039;m making for my work right now. And it also gives me a laugh reading through the comments ;)</description>
		<content:encoded><![CDATA[<p>Thanks for the info, this helps me alot with the e-commerce site that I&#8217;m making for my work right now. And it also gives me a laugh reading through the comments ;)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: blessyn</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-5200</link>
		<dc:creator>blessyn</dc:creator>
		<pubDate>Fri, 11 Aug 2006 14:44:17 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-5200</guid>
		<description>am not good at maths pls</description>
		<content:encoded><![CDATA[<p>am not good at maths pls</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Banshee</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-2929</link>
		<dc:creator>John Banshee</dc:creator>
		<pubDate>Tue, 25 Apr 2006 20:28:47 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-2929</guid>
		<description>Hi,

Thanks for this - very useful when developing eCommerce and don&#039;t really wanna use my personal CC number he-he.

Regards

JB</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>Thanks for this &#8211; very useful when developing eCommerce and don&#8217;t really wanna use my personal CC number he-he.</p>
<p>Regards</p>
<p>JB</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: V_Man</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-2125</link>
		<dc:creator>V_Man</dc:creator>
		<pubDate>Fri, 03 Mar 2006 21:42:53 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-2125</guid>
		<description>Very interesting and educational site, nice to know a little bit of how this stuff works, good work,
please post more information as you find out.</description>
		<content:encoded><![CDATA[<p>Very interesting and educational site, nice to know a little bit of how this stuff works, good work,<br />
please post more information as you find out.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: me</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-1403</link>
		<dc:creator>me</dc:creator>
		<pubDate>Wed, 18 Jan 2006 13:23:10 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-1403</guid>
		<description>Howard Beale, I think the reversing has to do about credit cards with 13 digits for example...
If you drop the last digit and do not reverse, you will get the numbers witch were suposed to multiply by 2 (the odd positoion ones) not multiplyed and vice versa... Off course, there are many other ways to deal with this, reversing is just one of them ;)

PS: Sorry my english :-S</description>
		<content:encoded><![CDATA[<p>Howard Beale, I think the reversing has to do about credit cards with 13 digits for example&#8230;<br />
If you drop the last digit and do not reverse, you will get the numbers witch were suposed to multiply by 2 (the odd positoion ones) not multiplyed and vice versa&#8230; Off course, there are many other ways to deal with this, reversing is just one of them ;)</p>
<p>PS: Sorry my english :-S</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: MTN Thief</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-967</link>
		<dc:creator>MTN Thief</dc:creator>
		<pubDate>Thu, 22 Dec 2005 01:19:40 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-967</guid>
		<description>A differenct formular applies to Rcarge cards. That is my area of specialization. MTN have been on their knee only to know my whereabout and arrest me, maybe kill me. I will continue to destroy the company until they begin to do the right thing. Wanna join my syndicacy? Dangerous but lucrative...send me an email, eetracy2003@yahoo.com. Let me have your number and we can talk. But it must cost you something...SOMETHING...ready?...</description>
		<content:encoded><![CDATA[<p>A differenct formular applies to Rcarge cards. That is my area of specialization. MTN have been on their knee only to know my whereabout and arrest me, maybe kill me. I will continue to destroy the company until they begin to do the right thing. Wanna join my syndicacy? Dangerous but lucrative&#8230;send me an email, <a href="mailto:eetracy2003@yahoo.com">eetracy2003@yahoo.com</a>. Let me have your number and we can talk. But it must cost you something&#8230;SOMETHING&#8230;ready?&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Howard Beale</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-692</link>
		<dc:creator>Howard Beale</dc:creator>
		<pubDate>Sun, 04 Dec 2005 19:13:37 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-692</guid>
		<description>Actually, according to the information above and my own personal experimentation, you can save yourself some coding and processing time by NOT reversing the number when calculating the Luhn check digit. Mathematically, addition wouldn&#039;t matter if the number were reversed or not. The reversing of the digits is therefore a waste of time.

If the length of the numeric string which you&#039;re going to add the check digit to is odd in length then you would double-calculate the digits in the even positions. Likewise, if the string is even in length then you will double-calculate the digits in the odd positions.

I have some source code in Quick/Visual BASIC form on my website which demonstrates that fact. In fact it automatically calculates the correct digits based on the length of the input string and whether or not you want to generate or verify the Luhn check digit. Very simple MOD 2 stuff. ;-&gt;

Anyhow, LOVE the website and the redesign. I do miss the hysterical lameness of the classic posts by the lamers though (I&#039;m sure they&#039;ll be new ones by the terminally clueless).

Perpetually mad as hell at spammers and scammers...

--Howie</description>
		<content:encoded><![CDATA[<p>Actually, according to the information above and my own personal experimentation, you can save yourself some coding and processing time by NOT reversing the number when calculating the Luhn check digit. Mathematically, addition wouldn&#8217;t matter if the number were reversed or not. The reversing of the digits is therefore a waste of time.</p>
<p>If the length of the numeric string which you&#8217;re going to add the check digit to is odd in length then you would double-calculate the digits in the even positions. Likewise, if the string is even in length then you will double-calculate the digits in the odd positions.</p>
<p>I have some source code in Quick/Visual BASIC form on my website which demonstrates that fact. In fact it automatically calculates the correct digits based on the length of the input string and whether or not you want to generate or verify the Luhn check digit. Very simple MOD 2 stuff. ;-&gt;</p>
<p>Anyhow, LOVE the website and the redesign. I do miss the hysterical lameness of the classic posts by the lamers though (I&#8217;m sure they&#8217;ll be new ones by the terminally clueless).</p>
<p>Perpetually mad as hell at spammers and scammers&#8230;</p>
<p>&#8211;Howie</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ebuka</title>
		<link>http://www.darkcoding.net/credit-card/luhn-formula/comment-page-1/#comment-74</link>
		<dc:creator>Ebuka</dc:creator>
		<pubDate>Fri, 04 Nov 2005 16:04:00 +0000</pubDate>
		<guid isPermaLink="false">http://gkgk/index.php/credit-card/luhn-formula/#comment-74</guid>
		<description>Does Lunh&#039;s formula apply to all cards number (recharge cards)</description>
		<content:encoded><![CDATA[<p>Does Lunh&#8217;s formula apply to all cards number (recharge cards)</p>
]]></content:encoded>
	</item>
</channel>
</rss>
