開發支付相關功能時,經常需要一批「格式合法、能通過前端校驗」的假卡號來測試表單邏輯、批量導入或者單元測試。本文的代碼就是為這個場景準備的:按照真實卡號的號段規則和 Luhn 校驗位算法生成測試數據。
請注意:生成的號碼僅供本地開發與測試使用,不具備任何金融功能,請勿用於非法用途,後果自負。
var visaPrefixList = new Array(
"4539", "4556", "4916", "4532", "4929", "40240071", "4485", "4716", "4"
);
var mastercardPrefixList = new Array("51", "52", "53", "54", "55");
var amexPrefixList = new Array("34", "37");
var discoverPrefixList = new Array("6011");
var dinersPrefixList = new Array("300", "301", "302", "303", "36", "38");
var enRoutePrefixList = new Array("2014", "2149");
var jcbPrefixList = new Array("35");
var voyagerPrefixList = new Array("8699");
function strrev(str) {
if (!str) return '';
var revstr = '';
for (var i = str.length - 1; i >= 0; i--) revstr += str.charAt(i);
return revstr;
}
/**
* prefix 為卡號前綴(字符串),length 為目標總長度(通常 13 或 16)
*/
function completed_number(prefix, length) {
var ccnumber = prefix;
// 隨機填充中間位,留一位給校驗位
while (ccnumber.length < (length - 1)) {
ccnumber += Math.floor(Math.random() * 10);
}
// 反轉後便於從右往左按奇偶位處理
var reversedCCnumberString = strrev(ccnumber);
var reversedCCnumber = new Array();
for (var i = 0; i < reversedCCnumberString.length; i++) {
reversedCCnumber[i] = parseInt(reversedCCnumberString.charAt(i));
}
// 累加校驗和
var sum = 0;
var pos = 0;
while (pos < length - 1) {
var odd = reversedCCnumber[pos] * 2;
if (odd > 9) { odd -= 9; }
sum += odd;
if (pos != (length - 2)) {
sum += reversedCCnumber[pos + 1];
}
pos += 2;
}
// 反推校驗位
var checkdigit = ((Math.floor(sum / 10) + 1) * 10 - sum) % 10;
ccnumber += checkdigit;
return ccnumber;
}
function credit_card_number(prefixList, length, howMany) {
var result = new Array();
for (var i = 0; i < howMany; i++) {
var randomArrayIndex = Math.floor(Math.random() * prefixList.length);
var ccnumber = prefixList[randomArrayIndex];
result.push(completed_number(ccnumber, length));
}
return result;
}
把上面的代碼保存為 gencc.js,然後:
<html>
<head>
<script src="gencc.js" type="text/javascript"></script>
</head>
<body>
<h3>VISA:</h3>
<script>
var visa = credit_card_number(visaPrefixList, 16, 3);
document.write(visa);
</script>
<h3>Amex:</h3>
<script>
var amex = credit_card_number(amexPrefixList, 15, 3);
document.write(amex);
</script>
</body>
</html>
理解這段代碼的關鍵是校驗位的反推過程:先假設最後一位為 0 算出所有其他位的加權和,再算出「補到最近的 10 的倍數」所需的差值,這個差值就是校驗位。它和校驗算法互為逆運算,兩段代碼放在一起看會更容易理解 Luhn 的數學結構。