LR 12 中 web_js_run API 非常坑，只能调用一个 JS 文件；更坑的是，不能通用 一个JS调用另外一个JS；（可能有，但在网上找了N个国家，都没有找到！如有，还请朋友告之，谢谢。）

现大部分的前端登录都有使用到RSA加密，以保障用户在登录的时候，账号密码不直接以明文方式传输，经过加密的账号密码即使被截取，也难以破解出真实的账号密码；
RSA 相关信息请自行搜索了解或下载， RSA加密算法在网上有N多开源的现成库可用（前、后端库）；

经RSA加密的登录流程大致为：

1、前端在登录时会向服务端请求 RSA 四个关键值： PublicKey ， Exponent ，rKey ， Modulus；
2、前端使用获取到的 Exponent , Modulus （ 通过 RSA 库在前端执行）计算出私钥，然后使用获得的公钥以及私钥 对 用户的账号密码 进行加密，并生成加密后的字符串；
3、最后前端将完成加密的字符串发送给服务端，服务端解密成功后，返回登录成功的状态；
以下将以RSA加密登录为例，演示在Loadrunner 中的如何实现；

 Action()

 {

     //char cliEncrypt[1000]; //用于保存需要加密的拼接好的字符串

     int rc=0;

     lr_save_string("19000000026","mobileNumberSet");//参数化的正确姿势 lr_save_string(lr_eval_string("{user_mobile}"),"mobileNumberSet");

     lr_save_string("123456","pwdSet");

     lr_save_string("","imgVerifyCodeSet");

     web_reg_save_param("SerJsonData", "LB=", "RB=", "Search=Body", LAST);

     web_submit_data("encryptKey.action",

         "Action=http://192.168.1.16/surperman/login/encryptKey.action",

         "Method=GET",

         "RecContentType=text/html",

         "Referer=",

         "Snapshot=t19.inf",

         "Mode=HTML",

         ITEMDATA,

         LAST);

     lr_output_message("# 获取密钥响应内容体：\n%s", lr_eval_string("{SerJsonData}"));

     web_js_run(

         "Code=getPublicKey(LR.getParam('SerJsonData'));",

         "ResultParam=getDataPublicKey",

         SOURCES,

         "File=getkey.js",ENDITEM,

         LAST);

     web_js_run(

         "Code=getExponent(LR.getParam('SerJsonData'));",

         "ResultParam=getDataExponent",

         SOURCES,

         "File=getkey.js",ENDITEM,

         LAST);

     web_js_run(

         "Code=getrKey(LR.getParam('SerJsonData'));",

         "ResultParam=getDatarKey",

         SOURCES,

         "File=getkey.js",ENDITEM,

         LAST);

     web_js_run(

         "Code=getModulus(LR.getParam('SerJsonData'));",

         "ResultParam=getDataModulus",

         SOURCES,

         "File=getkey.js",ENDITEM,

         LAST);

     lr_output_message("# getDataPublicKey 的值为：\n%s", lr_eval_string("{getDataPublicKey}"));

     lr_output_message("# getDataExponent 的值为：\n%s", lr_eval_string("{getDataExponent}"));

     lr_output_message("# getDatarKey 的值为：\n%s", lr_eval_string("{getDatarKey}"));

     lr_output_message("# getDataModulus 的值为：\n%s", lr_eval_string("{getDataModulus}"));

 /*

     lr_output_message("# mobileNumberSet 的值为：\n%s", lr_eval_string("{mobileNumberSet}"));

     lr_output_message("# pwdSet 的值为：\n%s", lr_eval_string("{pwdSet}"));

     lr_output_message("# imgVerifyCodeSet 的值为：\n%s", lr_eval_string("{imgVerifyCodeSet}"));

 */

     //拼接 输入的手机号、密码等 需要加密字符串

     //sprintf(cliEncrypt,"mobileNumber=%s&pwd=%s&imgVerifyCode=%s",lr_eval_string("{mobileNumberSet}"),lr_eval_string("{pwdSet}"),lr_eval_string("{imgVerifyCodeSet}"));

     //将拼接好的字符串赋值给参数 parCliEncrypt

     //lr_save_string(cliEncrypt,"parCliEncrypt");

     //lr_output_message(lr_eval_string("{parCliEncrypt}"));

        web_js_run(

         "Code=createEncrypt();",

         "ResultParam=NewkeyEncrypt",

         SOURCES,

         "File=loginEncryptStr.js",

         ENDITEM,

         LAST);

     lr_output_message("# NewkeyEncrypt 的值为：\n%s", lr_eval_string("{NewkeyEncrypt}"));

     /*输入账号密码后，点击登录*/

     web_reg_save_param("newTokenJson", "LB=", "RB=", "Search=Body", LAST);

     rc=web_custom_request("userPwdLogin.action",

         "URL=http://192.168.1.16/surperman/login/userPwdLogin.action",

         "Method=POST",

         "Resource=0",

         "RecContentType=text/html",

         "Referer=",

         "Snapshot=t21.inf",

         "Mode=HTML",

         "Body=encrypt={NewkeyEncrypt}&rKey={getDatarKey}",

         LAST);

     // 返回的字符串需要做编码转换处理，否则中文会显示为乱码

     lr_convert_string_encoding(lr_eval_string("{newTokenJson}"),"utf-8",NULL,"newTokenJsonUTF");

     lr_output_message("# newTokenJson 的值为：\n%s", lr_eval_string("{newTokenJson}"));

     lr_output_message("# newTokenJsonUTF 的值为：\n%s\nJS执行结果：%d", lr_eval_string("{newTokenJsonUTF}"), rc);

     return 0;

 }

LR 中 web_js_run 所调用的 getkey.js 长这样：

 function getPublicKey(stringData)

 {

     var data = JSON.parse(stringData);

     return data.publicKey;

 } 

 function getExponent(stringData)

 {

     var data = JSON.parse(stringData);

     return data.exponent;

 } 

 function getrKey(stringData)

 {

     var data = JSON.parse(stringData);

     return data.rKey;

 } 

 function getModulus(stringData)

 {

     var data = JSON.parse(stringData);

     return data.modulus;

 }

LR 中 web_js_run 所调用的 loginEncryptStr.js 长这样（RSA 库前端开源部分代码可以直接跳过）：

 // RSA 库前端开源部分 - 开始

 var RSAUtils = {};

 var biRadixBase = 2;

 var biRadixBits = 16;

 var bitsPerDigit = biRadixBits;

 var biRadix = 1 << 16; // = 2^16 = 65536

 var biHalfRadix = biRadix >>> 1;

 var biRadixSquared = biRadix * biRadix;

 var maxDigitVal = biRadix - 1;

 var maxInteger = 9999999999999998;

 //maxDigits:

 //Change this to accommodate your largest number size. Use setMaxDigits()

 //to change it!

 //

 //In general, if you're working with numbers of size N bits, you'll need 2*N

 //bits of storage. Each digit holds 16 bits. So, a 1024-bit key will need

 //

 //1024 * 2 / 16 = 128 digits of storage.

 //

 var maxDigits;

 var ZERO_ARRAY;

 var bigZero,

 bigOne;

 var BigInt = window.BigInt = function (flag) {

     if (typeof flag == "boolean" && flag == true) {

         this.digits = null;

     } else {

         this.digits = ZERO_ARRAY.slice(0);

     }

     this.isNeg = false;

 };

 RSAUtils.setMaxDigits = function (value) {

     maxDigits = value;

     ZERO_ARRAY = new Array(maxDigits);

     for (var iza = 0; iza < ZERO_ARRAY.length; iza++)

         ZERO_ARRAY[iza] = 0;

     bigZero = new BigInt();

     bigOne = new BigInt();

     bigOne.digits[0] = 1;

 };

 RSAUtils.setMaxDigits(20);

 //The maximum number of digits in base 10 you can convert to an

 //integer without JavaScript throwing up on you.

 var dpl10 = 15;

 RSAUtils.biFromNumber = function (i) {

     var result = new BigInt();

     result.isNeg = i < 0;

     i = Math.abs(i);

     var j = 0;

     while (i > 0) {

         result.digits[j++] = i & maxDigitVal;

         i = Math.floor(i / biRadix);

     }

     return result;

 };

 //lr10 = 10 ^ dpl10

 var lr10 = RSAUtils.biFromNumber(1000000000000000);

 RSAUtils.biFromDecimal = function (s) {

     var isNeg = s.charAt(0) == '-';

     var i = isNeg ? 1 : 0;

     var result;

     // Skip leading zeros.

     while (i < s.length && s.charAt(i) == '0')

         ++i;

     if (i == s.length) {

         result = new BigInt();

     } else {

         var digitCount = s.length - i;

         var fgl = digitCount % dpl10;

         if (fgl == 0)

             fgl = dpl10;

         result = RSAUtils.biFromNumber(Number(s.substr(i, fgl)));

         i += fgl;

         while (i < s.length) {

             result = RSAUtils.biAdd(RSAUtils.biMultiply(result, lr10),

                     RSAUtils.biFromNumber(Number(s.substr(i, dpl10))));

             i += dpl10;

         }

         result.isNeg = isNeg;

     }

     return result;

 };

 RSAUtils.biCopy = function (bi) {

     var result = new BigInt(true);

     result.digits = bi.digits.slice(0);

     result.isNeg = bi.isNeg;

     return result;

 };

 RSAUtils.reverseStr = function (s) {

     var result = "";

     for (var i = s.length - 1; i > -1; --i) {

         result += s.charAt(i);

     }

     return result;

 };

 var hexatrigesimalToChar = [

     '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',

     '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'

 ];

 RSAUtils.biToString = function (x, radix) { // 2 <= radix <= 36

     var b = new BigInt();

     b.digits[0] = radix;

     var qr = RSAUtils.biDivideModulo(x, b);

     var result = hexatrigesimalToChar[qr[1].digits[0]];

     while (RSAUtils.biCompare(qr[0], bigZero) == 1) {

         qr = RSAUtils.biDivideModulo(qr[0], b);

         digit = qr[1].digits[0];

         result += hexatrigesimalToChar[qr[1].digits[0]];

     }

     return (x.isNeg ? "-" : "") + RSAUtils.reverseStr(result);

 };

 RSAUtils.biToDecimal = function (x) {

     var b = new BigInt();

     b.digits[0] = 10;

     var qr = RSAUtils.biDivideModulo(x, b);

     var result = String(qr[1].digits[0]);

     while (RSAUtils.biCompare(qr[0], bigZero) == 1) {

         qr = RSAUtils.biDivideModulo(qr[0], b);

         result += String(qr[1].digits[0]);

     }

     return (x.isNeg ? "-" : "") + RSAUtils.reverseStr(result);

 };

 var hexToChar = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9',

     'a', 'b', 'c', 'd', 'e', 'f'];

 RSAUtils.digitToHex = function (n) {

     var mask = 0xf;

     var result = "";

     for (i = 0; i < 4; ++i) {

         result += hexToChar[n & mask];

         n >>>= 4;

     }

     return RSAUtils.reverseStr(result);

 };

 RSAUtils.biToHex = function (x) {

     var result = "";

     var n = RSAUtils.biHighIndex(x);

     for (var i = RSAUtils.biHighIndex(x); i > -1; --i) {

         result += RSAUtils.digitToHex(x.digits[i]);

     }

     return result;

 };

 RSAUtils.charToHex = function (c) {

     var ZERO = 48;

     var NINE = ZERO + 9;

     var littleA = 97;

     var littleZ = littleA + 25;

     var bigA = 65;

     var bigZ = 65 + 25;

     var result;

     if (c >= ZERO && c <= NINE) {

         result = c - ZERO;

     } else if (c >= bigA && c <= bigZ) {

         result = 10 + c - bigA;

     } else if (c >= littleA && c <= littleZ) {

         result = 10 + c - littleA;

     } else {

         result = 0;

     }

     return result;

 };

 RSAUtils.hexToDigit = function (s) {

     var result = 0;

     var sl = Math.min(s.length, 4);

     for (var i = 0; i < sl; ++i) {

         result <<= 4;

         result |= RSAUtils.charToHex(s.charCodeAt(i));

     }

     return result;

 };

 RSAUtils.biFromHex = function (s) {

     var result = new BigInt();

     var sl = s.length;

     for (var i = sl, j = 0; i > 0; i -= 4, ++j) {

         result.digits[j] = RSAUtils.hexToDigit(s.substr(Math.max(i - 4, 0), Math.min(i, 4)));

     }

     return result;

 };

 RSAUtils.biFromString = function (s, radix) {

     var isNeg = s.charAt(0) == '-';

     var istop = isNeg ? 1 : 0;

     var result = new BigInt();

     var place = new BigInt();

     place.digits[0] = 1; // radix^0

     for (var i = s.length - 1; i >= istop; i--) {

         var c = s.charCodeAt(i);

         var digit = RSAUtils.charToHex(c);

         var biDigit = RSAUtils.biMultiplyDigit(place, digit);

         result = RSAUtils.biAdd(result, biDigit);

         place = RSAUtils.biMultiplyDigit(place, radix);

     }

     result.isNeg = isNeg;

     return result;

 };

 RSAUtils.biDump = function (b) {

     return (b.isNeg ? "-" : "") + b.digits.join(" ");

 };

 RSAUtils.biAdd = function (x, y) {

     var result;

     if (x.isNeg != y.isNeg) {

         y.isNeg = !y.isNeg;

         result = RSAUtils.biSubtract(x, y);

         y.isNeg = !y.isNeg;

     } else {

         result = new BigInt();

         var c = 0;

         var n;

         for (var i = 0; i < x.digits.length; ++i) {

             n = x.digits[i] + y.digits[i] + c;

             result.digits[i] = n % biRadix;

             c = Number(n >= biRadix);

         }

         result.isNeg = x.isNeg;

     }

     return result;

 };

 RSAUtils.biSubtract = function (x, y) {

     var result;

     if (x.isNeg != y.isNeg) {

         y.isNeg = !y.isNeg;

         result = RSAUtils.biAdd(x, y);

         y.isNeg = !y.isNeg;

     } else {

         result = new BigInt();

         var n,

         c;

         c = 0;

         for (var i = 0; i < x.digits.length; ++i) {

             n = x.digits[i] - y.digits[i] + c;

             result.digits[i] = n % biRadix;

             // Stupid non-conforming modulus operation.

             if (result.digits[i] < 0)

                 result.digits[i] += biRadix;

             c = 0 - Number(n < 0);

         }

         // Fix up the negative sign, if any.

         if (c == -1) {

             c = 0;

             for (var i = 0; i < x.digits.length; ++i) {

                 n = 0 - result.digits[i] + c;

                 result.digits[i] = n % biRadix;

                 // Stupid non-conforming modulus operation.

                 if (result.digits[i] < 0)

                     result.digits[i] += biRadix;

                 c = 0 - Number(n < 0);

             }

             // Result is opposite sign of arguments.

             result.isNeg = !x.isNeg;

         } else {

             // Result is same sign.

             result.isNeg = x.isNeg;

         }

     }

     return result;

 };

 RSAUtils.biHighIndex = function (x) {

     var result = x.digits.length - 1;

     while (result > 0 && x.digits[result] == 0)

         --result;

     return result;

 };

 RSAUtils.biNumBits = function (x) {

     var n = RSAUtils.biHighIndex(x);

     var d = x.digits[n];

     var m = (n + 1) * bitsPerDigit;

     var result;

     for (result = m; result > m - bitsPerDigit; --result) {

         if ((d & 0x8000) != 0)

             break;

         d <<= 1;

     }

     return result;

 };

 RSAUtils.biMultiply = function (x, y) {

     var result = new BigInt();

     var c;

     var n = RSAUtils.biHighIndex(x);

     var t = RSAUtils.biHighIndex(y);

     var u,

     uv,

     k;

     for (var i = 0; i <= t; ++i) {

         c = 0;

         k = i;

         for (j = 0; j <= n; ++j, ++k) {

             uv = result.digits[k] + x.digits[j] * y.digits[i] + c;

             result.digits[k] = uv & maxDigitVal;

             c = uv >>> biRadixBits;

             //c = Math.floor(uv / biRadix);

         }

         result.digits[i + n + 1] = c;

     }

     // Someone give me a logical xor, please.

     result.isNeg = x.isNeg != y.isNeg;

     return result;

 };

 RSAUtils.biMultiplyDigit = function (x, y) {

     var n,

     c,

     uv;

     result = new BigInt();

     n = RSAUtils.biHighIndex(x);

     c = 0;

     for (var j = 0; j <= n; ++j) {

         uv = result.digits[j] + x.digits[j] * y + c;

         result.digits[j] = uv & maxDigitVal;

         c = uv >>> biRadixBits;

         //c = Math.floor(uv / biRadix);

     }

     result.digits[1 + n] = c;

     return result;

 };

 RSAUtils.arrayCopy = function (src, srcStart, dest, destStart, n) {

     var m = Math.min(srcStart + n, src.length);

     for (var i = srcStart, j = destStart; i < m; ++i, ++j) {

         dest[j] = src[i];

     }

 };

 var highBitMasks = [0x0000, 0x8000, 0xC000, 0xE000, 0xF000, 0xF800,

     0xFC00, 0xFE00, 0xFF00, 0xFF80, 0xFFC0, 0xFFE0,

     0xFFF0, 0xFFF8, 0xFFFC, 0xFFFE, 0xFFFF];

 RSAUtils.biShiftLeft = function (x, n) {

     var digitCount = Math.floor(n / bitsPerDigit);

     var result = new BigInt();

     RSAUtils.arrayCopy(x.digits, 0, result.digits, digitCount,

         result.digits.length - digitCount);

     var bits = n % bitsPerDigit;

     var rightBits = bitsPerDigit - bits;

     for (var i = result.digits.length - 1, i1 = i - 1; i > 0; --i, --i1) {

         result.digits[i] = ((result.digits[i] << bits) & maxDigitVal) |

         ((result.digits[i1] & highBitMasks[bits]) >>>

             (rightBits));

     }

     result.digits[0] = ((result.digits[i] << bits) & maxDigitVal);

     result.isNeg = x.isNeg;

     return result;

 };

 var lowBitMasks = [0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F,

     0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF,

     0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF];

 RSAUtils.biShiftRight = function (x, n) {

     var digitCount = Math.floor(n / bitsPerDigit);

     var result = new BigInt();

     RSAUtils.arrayCopy(x.digits, digitCount, result.digits, 0,

         x.digits.length - digitCount);

     var bits = n % bitsPerDigit;

     var leftBits = bitsPerDigit - bits;

     for (var i = 0, i1 = i + 1; i < result.digits.length - 1; ++i, ++i1) {

         result.digits[i] = (result.digits[i] >>> bits) |

         ((result.digits[i1] & lowBitMasks[bits]) << leftBits);

     }

     result.digits[result.digits.length - 1] >>>= bits;

     result.isNeg = x.isNeg;

     return result;

 };

 RSAUtils.biMultiplyByRadixPower = function (x, n) {

     var result = new BigInt();

     RSAUtils.arrayCopy(x.digits, 0, result.digits, n, result.digits.length - n);

     return result;

 };

 RSAUtils.biDivideByRadixPower = function (x, n) {

     var result = new BigInt();

     RSAUtils.arrayCopy(x.digits, n, result.digits, 0, result.digits.length - n);

     return result;

 };

 RSAUtils.biModuloByRadixPower = function (x, n) {

     var result = new BigInt();

     RSAUtils.arrayCopy(x.digits, 0, result.digits, 0, n);

     return result;

 };

 RSAUtils.biCompare = function (x, y) {

     if (x.isNeg != y.isNeg) {

         return 1 - 2 * Number(x.isNeg);

     }

     for (var i = x.digits.length - 1; i >= 0; --i) {

         if (x.digits[i] != y.digits[i]) {

             if (x.isNeg) {

                 return 1 - 2 * Number(x.digits[i] > y.digits[i]);

             } else {

                 return 1 - 2 * Number(x.digits[i] < y.digits[i]);

             }

         }

     }

     return 0;

 };

 RSAUtils.biDivideModulo = function (x, y) {

     var nb = RSAUtils.biNumBits(x);

     var tb = RSAUtils.biNumBits(y);

     var origYIsNeg = y.isNeg;

     var q,

     r;

     if (nb < tb) {

         // |x| < |y|

         if (x.isNeg) {

             q = RSAUtils.biCopy(bigOne);

             q.isNeg = !y.isNeg;

             x.isNeg = false;

             y.isNeg = false;

             r = biSubtract(y, x);

             // Restore signs, 'cause they're references.

             x.isNeg = true;

             y.isNeg = origYIsNeg;

         } else {

             q = new BigInt();

             r = RSAUtils.biCopy(x);

         }

         return [q, r];

     }

     q = new BigInt();

     r = x;

     // Normalize Y.

     var t = Math.ceil(tb / bitsPerDigit) - 1;

     var lambda = 0;

     while (y.digits[t] < biHalfRadix) {

         y = RSAUtils.biShiftLeft(y, 1);

         ++lambda;

         ++tb;

         t = Math.ceil(tb / bitsPerDigit) - 1;

     }

     // Shift r over to keep the quotient constant. We'll shift the

     // remainder back at the end.

     r = RSAUtils.biShiftLeft(r, lambda);

     nb += lambda; // Update the bit count for x.

     var n = Math.ceil(nb / bitsPerDigit) - 1;

     var b = RSAUtils.biMultiplyByRadixPower(y, n - t);

     while (RSAUtils.biCompare(r, b) != -1) {

         ++q.digits[n - t];

         r = RSAUtils.biSubtract(r, b);

     }

     for (var i = n; i > t; --i) {

         var ri = (i >= r.digits.length) ? 0 : r.digits[i];

         var ri1 = (i - 1 >= r.digits.length) ? 0 : r.digits[i - 1];

         var ri2 = (i - 2 >= r.digits.length) ? 0 : r.digits[i - 2];

         var yt = (t >= y.digits.length) ? 0 : y.digits[t];

         var yt1 = (t - 1 >= y.digits.length) ? 0 : y.digits[t - 1];

         if (ri == yt) {

             q.digits[i - t - 1] = maxDigitVal;

         } else {

             q.digits[i - t - 1] = Math.floor((ri * biRadix + ri1) / yt);

         }

         var c1 = q.digits[i - t - 1] * ((yt * biRadix) + yt1);

         var c2 = (ri * biRadixSquared) + ((ri1 * biRadix) + ri2);

         while (c1 > c2) {

             --q.digits[i - t - 1];

             c1 = q.digits[i - t - 1] * ((yt * biRadix) | yt1);

             c2 = (ri * biRadix * biRadix) + ((ri1 * biRadix) + ri2);

         }

         b = RSAUtils.biMultiplyByRadixPower(y, i - t - 1);

         r = RSAUtils.biSubtract(r, RSAUtils.biMultiplyDigit(b, q.digits[i - t - 1]));

         if (r.isNeg) {

             r = RSAUtils.biAdd(r, b);

             --q.digits[i - t - 1];

         }

     }

     r = RSAUtils.biShiftRight(r, lambda);

     // Fiddle with the signs and stuff to make sure that 0 <= r < y.

     q.isNeg = x.isNeg != origYIsNeg;

     if (x.isNeg) {

         if (origYIsNeg) {

             q = RSAUtils.biAdd(q, bigOne);

         } else {

             q = RSAUtils.biSubtract(q, bigOne);

         }

         y = RSAUtils.biShiftRight(y, lambda);

         r = RSAUtils.biSubtract(y, r);

     }

     // Check for the unbelievably stupid degenerate case of r == -0.

     if (r.digits[0] == 0 && RSAUtils.biHighIndex(r) == 0)

         r.isNeg = false;

     return [q, r];

 };

 RSAUtils.biDivide = function (x, y) {

     return RSAUtils.biDivideModulo(x, y)[0];

 };

 RSAUtils.biModulo = function (x, y) {

     return RSAUtils.biDivideModulo(x, y)[1];

 };

 RSAUtils.biMultiplyMod = function (x, y, m) {

     return RSAUtils.biModulo(RSAUtils.biMultiply(x, y), m);

 };

 RSAUtils.biPow = function (x, y) {

     var result = bigOne;

     var a = x;

     while (true) {

         if ((y & 1) != 0)

             result = RSAUtils.biMultiply(result, a);

         y >>= 1;

         if (y == 0)

             break;

         a = RSAUtils.biMultiply(a, a);

     }

     return result;

 };

 RSAUtils.biPowMod = function (x, y, m) {

     var result = bigOne;

     var a = x;

     var k = y;

     while (true) {

         if ((k.digits[0] & 1) != 0)

             result = RSAUtils.biMultiplyMod(result, a, m);

         k = RSAUtils.biShiftRight(k, 1);

         if (k.digits[0] == 0 && RSAUtils.biHighIndex(k) == 0)

             break;

         a = RSAUtils.biMultiplyMod(a, a, m);

     }

     return result;

 };

 window.BarrettMu = function (m) {

     this.modulus = RSAUtils.biCopy(m);

     this.k = RSAUtils.biHighIndex(this.modulus) + 1;

     var b2k = new BigInt();

     b2k.digits[2 * this.k] = 1; // b2k = b^(2k)

     this.mu = RSAUtils.biDivide(b2k, this.modulus);

     this.bkplus1 = new BigInt();

     this.bkplus1.digits[this.k + 1] = 1; // bkplus1 = b^(k+1)

     this.modulo = BarrettMu_modulo;

     this.multiplyMod = BarrettMu_multiplyMod;

     this.powMod = BarrettMu_powMod;

 };

 function BarrettMu_modulo(x) {

     var $dmath = RSAUtils;

     var q1 = $dmath.biDivideByRadixPower(x, this.k - 1);

     var q2 = $dmath.biMultiply(q1, this.mu);

     var q3 = $dmath.biDivideByRadixPower(q2, this.k + 1);

     var r1 = $dmath.biModuloByRadixPower(x, this.k + 1);

     var r2term = $dmath.biMultiply(q3, this.modulus);

     var r2 = $dmath.biModuloByRadixPower(r2term, this.k + 1);

     var r = $dmath.biSubtract(r1, r2);

     if (r.isNeg) {

         r = $dmath.biAdd(r, this.bkplus1);

     }

     var rgtem = $dmath.biCompare(r, this.modulus) >= 0;

     while (rgtem) {

         r = $dmath.biSubtract(r, this.modulus);

         rgtem = $dmath.biCompare(r, this.modulus) >= 0;

     }

     return r;

 }

 function BarrettMu_multiplyMod(x, y) {

     /*

     x = this.modulo(x);

     y = this.modulo(y);

      */

     var xy = RSAUtils.biMultiply(x, y);

     return this.modulo(xy);

 }

 function BarrettMu_powMod(x, y) {

     var result = new BigInt();

     result.digits[0] = 1;

     var a = x;

     var k = y;

     while (true) {

         if ((k.digits[0] & 1) != 0)

             result = this.multiplyMod(result, a);

         k = RSAUtils.biShiftRight(k, 1);

         if (k.digits[0] == 0 && RSAUtils.biHighIndex(k) == 0)

             break;

         a = this.multiplyMod(a, a);

     }

     return result;

 }

 var RSAKeyPair = function (encryptionExponent, decryptionExponent, modulus) {

     alert(1);

     var $dmath = RSAUtils;

     this.e = $dmath.biFromHex(encryptionExponent);

     this.d = $dmath.biFromHex(decryptionExponent);

     this.m = $dmath.biFromHex(modulus);

     // We can do two bytes per digit, so

     // chunkSize = 2 * (number of digits in modulus - 1).

     // Since biHighIndex returns the high index, not the number of digits, 1 has

     // already been subtracted.

     this.chunkSize = 2 * $dmath.biHighIndex(this.m);

     this.radix = 16;

     this.barrett = new window.BarrettMu(this.m);

 };

 RSAUtils.getKeyPair = function (encryptionExponent, decryptionExponent, modulus) {

     return new RSAKeyPair(encryptionExponent, decryptionExponent, modulus);

 };

 if (typeof window.twoDigit === 'undefined') {

     window.twoDigit = function (n) {

         return (n < 10 ? "0" : "") + String(n);

     };

 }

 // Altered by Rob Saunders (rob@robsaunders.net). New routine pads the

 // string after it has been converted to an array. This fixes an

 // incompatibility with Flash MX's ActionScript.

 RSAUtils.encryptedString = function (key, s) {

     var a = [];

     var sl = s.length;

     var i = 0;

     while (i < sl) {

         a[i] = s.charCodeAt(i);

         i++;

     }

     while (a.length % key.chunkSize != 0) {

         a[i++] = 0;

     }

     var al = a.length;

     var result = "";

     var j,

     k,

     block;

     for (i = 0; i < al; i += key.chunkSize) {

         block = new BigInt();

         j = 0;

         for (k = i; k < i + key.chunkSize; ++j) {

             block.digits[j] = a[k++];

             block.digits[j] += a[k++] << 8;

         }

         var crypt = key.barrett.powMod(block, key.e);

         var text = key.radix == 16 ? RSAUtils.biToHex(crypt) : RSAUtils.biToString(crypt, key.radix);

         result += text + " ";

     }

     return result.substring(0, result.length - 1); // Remove last space.

 };

 RSAUtils.decryptedString = function (key, s) {

     var blocks = s.split(" ");

     var result = "";

     var i,

     j,

     block;

     for (i = 0; i < blocks.length; ++i) {

         var bi;

         if (key.radix == 16) {

             bi = RSAUtils.biFromHex(blocks[i]);

         } else {

             bi = RSAUtils.biFromString(blocks[i], key.radix);

         }

         block = key.barrett.powMod(bi, key.d);

         for (j = 0; j <= RSAUtils.biHighIndex(block); ++j) {

             result += String.fromCharCode(block.digits[j] & 255,

                 block.digits[j] >> 8);

         }

     }

     // Remove trailing null, if any.

     if (result.charCodeAt(result.length - 1) == 0) {

         result = result.substring(0, result.length - 1);

     }

     return result;

 };

 RSAUtils.setMaxDigits(130);

 // RSA 库前端开源部分 - 结束

 // 以下为LR调用RSA加密实现的关键代码

 function createEncrypt() {

     //LR.loadLibrary('rsaiutil.js');

     //mobileNumberSet;//输入的手机号

     //pwdSet;//输入的密码

     //imgVerifyCodeSet;//输入的图形验证码

     // 通过 LR.getParam('mobileNumberSet') 可以在 JS 脚本中直接获取 LR 脚本的参数

     var cliPublicKey = new RSAUtils.getKeyPair(LR.getParam('getDataExponent'), "", LR.getParam('getDataModulus'));

     var encrypt = "mobileNumber=" + LR.getParam('mobileNumberSet') + "&pwd=" + LR.getParam('pwdSet') + "&imgVerifyCode=" + LR.getParam('imgVerifyCodeSet');//

     encrypt = encrypt.split("").reverse().join("");//将需要加密的字符串反序排列

     encrypt = RSAUtils.encryptedString(cliPublicKey, encrypt); //获得加密后的字符串

     return encrypt;

 }

运行 Action 的结果：

 虚拟用户脚本已于 : 2018/2/24 Saturday PM 4:05:06 启动

 正在开始操作 vuser_init。

 LoadRunner 12.53.0 (Windows 7) 的 Web Turbo 回放；内部版本 1203 (二月 24 2018 19:13:20)      [MsgId: MMSG-26983]

 运行模式: HTML      [MsgId: MMSG-26993]

 回放用户代理: Mozilla/5.0 (compatible; MSIE 10.0; Windows NT 6.1; Trident/6.0)      [MsgId: MMSG-26988]

 运行时设置文件: "C:\Users\VuGen\Scripts\WebHttpHtml6\\default.cfg"      [MsgId: MMSG-27141]

 正在结束操作 vuser_init。

 正在运行 Vuser...

 正在开始迭代 1。

 每个服务器的最大并发连接数: 6      [MsgId: MMSG-26989]

 正在开始操作 Action。

 Action.c(24): web_reg_save_param 已启动      [MsgId: MMSG-26355]

 Action.c(24): 注册 web_reg_save_param 成功      [MsgId: MMSG-26390]

 Action.c(26): web_submit_data("encryptKey.action") 已启动      [MsgId: MMSG-26355]

 Action.c(26): web_submit_data("encryptKey.action") 已成功，613 个正文字节，155 个标头字节      [MsgId: MMSG-26386]

 Action.c(36): # 获取密钥响应内容体：

 {"publicKey":"MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDBEZM4rLUDmybC9qFGLUwTFNsAbUFxyb\/SDTPr\nfVVgrkg1PL4yTOFyHgJe5oMcZyR0hqdz8fGpkesiN20dWwUem67tAszHgIHcVuswwyT2nV7pUNMj\nz53v5QWHsZ6\/oW1LXVnGYwvjVATHc1p2VOuATGw28XDEukWyGcKzTtcwzwIDAQAB\n","error_msg":"ok","error_code":0,"exponent":"010001","rKey":"5406701c505548beb3c1043bbcee5229","modulus":"00c1119338acb5039b26c2f6a1462d4c1314db006d4171c9bfd20d33eb7d5560ae48353cbe324ce1721e025ee6831c67247486a773f1f1a991eb22376d1d5b051e9baeed02ccc78081dc56eb30c324f69d5ee950d323cf9defe50587b19ebfa16d4b5d59c6630be35404c7735a7654eb804c6c36f170c4ba45b219c2b34ed730cf"}

 Action.c(38): web_js_run 已启动      [MsgId: MMSG-26355]

 Action.c(38): web_js_run 已成功      [MsgId: MMSG-26392]

 Action.c(45): web_js_run 已启动      [MsgId: MMSG-26355]

 Action.c(45): web_js_run 已成功      [MsgId: MMSG-26392]

 Action.c(52): web_js_run 已启动      [MsgId: MMSG-26355]

 Action.c(52): web_js_run 已成功      [MsgId: MMSG-26392]

 Action.c(59): web_js_run 已启动      [MsgId: MMSG-26355]

 Action.c(59): web_js_run 已成功      [MsgId: MMSG-26392]

 Action.c(66): # getDataPublicKey 的值为：

 MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDBEZM4rLUDmybC9qFGLUwTFNsAbUFxyb/SDTPr\nfVVgrkg1PL4yTOFyHgJe5oMcZyR0hqdz8fGpkesiN20dWwUem67tAszHgIHcVuswwyT2nV7pUNMj\nz53v5QWHsZ6/oW1LXVnGYwvjVATHc1p2VOuATGw28XDEukWyGcKzTtcwzwIDAQAB\n

 Action.c(67): # getDataExponent 的值为：

 010001

 Action.c(68): # getDatarKey 的值为：

 5406701c505548beb3c1043bbcee5229

 Action.c(69): # getDataModulus 的值为：

 00c1119338acb5039b26c2f6a1462d4c1314db006d4171c9bfd20d33eb7d5560ae48353cbe324ce1721e025ee6831c67247486a773f1f1a991eb22376d1d5b051e9baeed02ccc78081dc56eb30c324f69d5ee950d323cf9defe50587b19ebfa16d4b5d59c6630be35404c7735a7654eb804c6c36f170c4ba45b219c2b34ed730cf

 Action.c(109): web_js_run 已启动      [MsgId: MMSG-26355]

 Alert from JS (len=1): 1

 Action.c(109): web_js_run 已成功      [MsgId: MMSG-26392]

 Action.c(117): # NewkeyEncrypt 的值为：

 4ea861aa44b8d90b08677e525ebd2607a992b87108308329fb01afd518bf4104344cb26e149ec43416a8181ad4cfc7e358e9ca2a2eab0a9072e5d86182e91f524376a3414b268244c62a2e149ac905679f66dd455ea386537136660508a3af71b479df9dc7beaf21ef5f2e70edfad8e88c64af35415e68258599c4b09791e43e

 Action.c(121): web_reg_save_param 已启动      [MsgId: MMSG-26355]

 Action.c(121): 注册 web_reg_save_param 成功      [MsgId: MMSG-26390]

 Action.c(123): web_custom_request("userPwdLogin.action") 已启动      [MsgId: MMSG-26355]

 Action.c(123): web_custom_request("userPwdLogin.action") 已成功，490 个正文字节，155 个标头字节      [MsgId: MMSG-26386]

 Action.c(137): # newTokenJson 的值为：

 {"portraitUrl":"http:\/\/test.666.com\/pt\/com\/img\/default-doctor-portrait.jpg","userGuideStat":null,"error_msg":"鐧诲綍鎴愬姛","nickname":"鍖昏€?6","alias":"dev473002","token":"cbc70505fccd4866aa88f3404a4ab8d1","error_code":0,"tag":"dev鍖荤敓","user_id":473002,"portraitUuid":"","type":"鍖荤敓","statistics":{"dtOnlinePrescOrdersPaid":0,"userId":473002,"role":"dt","dtOnlinePrescOrders":170,"lastLoginTime":"201802","registerTime":"2017-05-16 10:47:51","dtQualified":true}}

 Action.c(138): # newTokenJsonUTF 的值为：

 {"portraitUrl":"http:\/\/test.666.com\/pt\/com\/img\/default-doctor-portrait.jpg","userGuideStat":null,"error_msg":"登录成功","nickname":"医者26","alias":"dev473002","token":"cbc70505fccd4866aa88f3404a4ab8d1","error_code":0,"tag":"dev侵权者","user_id":473002,"portraitUuid":"","type":"侵权者","statistics":{"dtOnlinePrescOrdersPaid":0,"userId":473002,"role":"dt","dtOnlinePrescOrders":170,"lastLoginTime":"201802","registerTime":"2017-05-16 10:47:51","dtQualified":true}}

 JS执行结果：0

 正在结束操作 Action。

 正在结束迭代 1。

 正在结束 Vuser...

 正在开始操作 vuser_end。

 正在结束操作 vuser_end。

 Vuser 已终止。

另：开源的 RSA库 在未修改时，是独立的一个 JS 文件；未修改前是长这样：

 /*

  * RSA, a suite of routines for performing RSA public-key computations in JavaScript.

  * Copyright 1998-2005 David Shapiro.

  * Dave Shapiro

  * dave@ohdave.com

  * changed by Fuchun, 2010-05-06

  * fcrpg2005@gmail.com

  */

 (function ($w) {

     if (typeof $w.RSAUtils === 'undefined')

         var RSAUtils = $w.RSAUtils = {};

     var biRadixBase = 2;

     var biRadixBits = 16;

     var bitsPerDigit = biRadixBits;

     var biRadix = 1 << 16; // = 2^16 = 65536

     var biHalfRadix = biRadix >>> 1;

     var biRadixSquared = biRadix * biRadix;

     var maxDigitVal = biRadix - 1;

     var maxInteger = 9999999999999998;

     //maxDigits:

     //Change this to accommodate your largest number size. Use setMaxDigits()

     //to change it!

     //

     //In general, if you're working with numbers of size N bits, you'll need 2*N

     //bits of storage. Each digit holds 16 bits. So, a 1024-bit key will need

     //

     //1024 * 2 / 16 = 128 digits of storage.

     //

     var maxDigits;

     var ZERO_ARRAY;

     var bigZero,

     bigOne;

     var BigInt = $w.BigInt = function (flag) {

         if (typeof flag == "boolean" && flag == true) {

             this.digits = null;

         } else {

             this.digits = ZERO_ARRAY.slice(0);

         }

         this.isNeg = false;

     };

     RSAUtils.setMaxDigits = function (value) {

         maxDigits = value;

         ZERO_ARRAY = new Array(maxDigits);

         for (var iza = 0; iza < ZERO_ARRAY.length; iza++)

             ZERO_ARRAY[iza] = 0;

         bigZero = new BigInt();

         bigOne = new BigInt();

         bigOne.digits[0] = 1;

     };

     RSAUtils.setMaxDigits(20);

     //The maximum number of digits in base 10 you can convert to an

     //integer without JavaScript throwing up on you.

     var dpl10 = 15;

     RSAUtils.biFromNumber = function (i) {

         var result = new BigInt();

         result.isNeg = i < 0;

         i = Math.abs(i);

         var j = 0;

         while (i > 0) {

             result.digits[j++] = i & maxDigitVal;

             i = Math.floor(i / biRadix);

         }

         return result;

     };

     //lr10 = 10 ^ dpl10

     var lr10 = RSAUtils.biFromNumber(1000000000000000);

     RSAUtils.biFromDecimal = function (s) {

         var isNeg = s.charAt(0) == '-';

         var i = isNeg ? 1 : 0;

         var result;

         // Skip leading zeros.

         while (i < s.length && s.charAt(i) == '0')

             ++i;

         if (i == s.length) {

             result = new BigInt();

         } else {

             var digitCount = s.length - i;

             var fgl = digitCount % dpl10;

             if (fgl == 0)

                 fgl = dpl10;

             result = RSAUtils.biFromNumber(Number(s.substr(i, fgl)));

             i += fgl;

             while (i < s.length) {

                 result = RSAUtils.biAdd(RSAUtils.biMultiply(result, lr10),

                         RSAUtils.biFromNumber(Number(s.substr(i, dpl10))));

                 i += dpl10;

             }

             result.isNeg = isNeg;

         }

         return result;

     };

     RSAUtils.biCopy = function (bi) {

         var result = new BigInt(true);

         result.digits = bi.digits.slice(0);

         result.isNeg = bi.isNeg;

         return result;

     };

     RSAUtils.reverseStr = function (s) {

         var result = "";

         for (var i = s.length - 1; i > -1; --i) {

             result += s.charAt(i);

         }

         return result;

     };

     var hexatrigesimalToChar = [

         '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',

         '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'

     ];

     RSAUtils.biToString = function (x, radix) { // 2 <= radix <= 36

         var b = new BigInt();

         b.digits[0] = radix;

         var qr = RSAUtils.biDivideModulo(x, b);

         var result = hexatrigesimalToChar[qr[1].digits[0]];

         while (RSAUtils.biCompare(qr[0], bigZero) == 1) {

             qr = RSAUtils.biDivideModulo(qr[0], b);

             digit = qr[1].digits[0];

             result += hexatrigesimalToChar[qr[1].digits[0]];

         }

         return (x.isNeg ? "-" : "") + RSAUtils.reverseStr(result);

     };

     RSAUtils.biToDecimal = function (x) {

         var b = new BigInt();

         b.digits[0] = 10;

         var qr = RSAUtils.biDivideModulo(x, b);

         var result = String(qr[1].digits[0]);

         while (RSAUtils.biCompare(qr[0], bigZero) == 1) {

             qr = RSAUtils.biDivideModulo(qr[0], b);

             result += String(qr[1].digits[0]);

         }

         return (x.isNeg ? "-" : "") + RSAUtils.reverseStr(result);

     };

     var hexToChar = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9',

         'a', 'b', 'c', 'd', 'e', 'f'];

     RSAUtils.digitToHex = function (n) {

         var mask = 0xf;

         var result = "";

         for (i = 0; i < 4; ++i) {

             result += hexToChar[n & mask];

             n >>>= 4;

         }

         return RSAUtils.reverseStr(result);

     };

     RSAUtils.biToHex = function (x) {

         var result = "";

         var n = RSAUtils.biHighIndex(x);

         for (var i = RSAUtils.biHighIndex(x); i > -1; --i) {

             result += RSAUtils.digitToHex(x.digits[i]);

         }

         return result;

     };

     RSAUtils.charToHex = function (c) {

         var ZERO = 48;

         var NINE = ZERO + 9;

         var littleA = 97;

         var littleZ = littleA + 25;

         var bigA = 65;

         var bigZ = 65 + 25;

         var result;

         if (c >= ZERO && c <= NINE) {

             result = c - ZERO;

         } else if (c >= bigA && c <= bigZ) {

             result = 10 + c - bigA;

         } else if (c >= littleA && c <= littleZ) {

             result = 10 + c - littleA;

         } else {

             result = 0;

         }

         return result;

     };

     RSAUtils.hexToDigit = function (s) {

         var result = 0;

         var sl = Math.min(s.length, 4);

         for (var i = 0; i < sl; ++i) {

             result <<= 4;

             result |= RSAUtils.charToHex(s.charCodeAt(i));

         }

         return result;

     };

     RSAUtils.biFromHex = function (s) {

         var result = new BigInt();

         var sl = s.length;

         for (var i = sl, j = 0; i > 0; i -= 4, ++j) {

             result.digits[j] = RSAUtils.hexToDigit(s.substr(Math.max(i - 4, 0), Math.min(i, 4)));

         }

         return result;

     };

     RSAUtils.biFromString = function (s, radix) {

         var isNeg = s.charAt(0) == '-';

         var istop = isNeg ? 1 : 0;

         var result = new BigInt();

         var place = new BigInt();

         place.digits[0] = 1; // radix^0

         for (var i = s.length - 1; i >= istop; i--) {

             var c = s.charCodeAt(i);

             var digit = RSAUtils.charToHex(c);

             var biDigit = RSAUtils.biMultiplyDigit(place, digit);

             result = RSAUtils.biAdd(result, biDigit);

             place = RSAUtils.biMultiplyDigit(place, radix);

         }

         result.isNeg = isNeg;

         return result;

     };

     RSAUtils.biDump = function (b) {

         return (b.isNeg ? "-" : "") + b.digits.join(" ");

     };

     RSAUtils.biAdd = function (x, y) {

         var result;

         if (x.isNeg != y.isNeg) {

             y.isNeg = !y.isNeg;

             result = RSAUtils.biSubtract(x, y);

             y.isNeg = !y.isNeg;

         } else {

             result = new BigInt();

             var c = 0;

             var n;

             for (var i = 0; i < x.digits.length; ++i) {

                 n = x.digits[i] + y.digits[i] + c;

                 result.digits[i] = n % biRadix;

                 c = Number(n >= biRadix);

             }

             result.isNeg = x.isNeg;

         }

         return result;

     };

     RSAUtils.biSubtract = function (x, y) {

         var result;

         if (x.isNeg != y.isNeg) {

             y.isNeg = !y.isNeg;

             result = RSAUtils.biAdd(x, y);

             y.isNeg = !y.isNeg;

         } else {

             result = new BigInt();

             var n,

             c;

             c = 0;

             for (var i = 0; i < x.digits.length; ++i) {

                 n = x.digits[i] - y.digits[i] + c;

                 result.digits[i] = n % biRadix;

                 // Stupid non-conforming modulus operation.

                 if (result.digits[i] < 0)

                     result.digits[i] += biRadix;

                 c = 0 - Number(n < 0);

             }

             // Fix up the negative sign, if any.

             if (c == -1) {

                 c = 0;

                 for (var i = 0; i < x.digits.length; ++i) {

                     n = 0 - result.digits[i] + c;

                     result.digits[i] = n % biRadix;

                     // Stupid non-conforming modulus operation.

                     if (result.digits[i] < 0)

                         result.digits[i] += biRadix;

                     c = 0 - Number(n < 0);

                 }

                 // Result is opposite sign of arguments.

                 result.isNeg = !x.isNeg;

             } else {

                 // Result is same sign.

                 result.isNeg = x.isNeg;

             }

         }

         return result;

     };

     RSAUtils.biHighIndex = function (x) {

         var result = x.digits.length - 1;

         while (result > 0 && x.digits[result] == 0)

             --result;

         return result;

     };

     RSAUtils.biNumBits = function (x) {

         var n = RSAUtils.biHighIndex(x);

         var d = x.digits[n];

         var m = (n + 1) * bitsPerDigit;

         var result;

         for (result = m; result > m - bitsPerDigit; --result) {

             if ((d & 0x8000) != 0)

                 break;

             d <<= 1;

         }

         return result;

     };

     RSAUtils.biMultiply = function (x, y) {

         var result = new BigInt();

         var c;

         var n = RSAUtils.biHighIndex(x);

         var t = RSAUtils.biHighIndex(y);

         var u,

         uv,

         k;

         for (var i = 0; i <= t; ++i) {

             c = 0;

             k = i;

             for (j = 0; j <= n; ++j, ++k) {

                 uv = result.digits[k] + x.digits[j] * y.digits[i] + c;

                 result.digits[k] = uv & maxDigitVal;

                 c = uv >>> biRadixBits;

                 //c = Math.floor(uv / biRadix);

             }

             result.digits[i + n + 1] = c;

         }

         // Someone give me a logical xor, please.

         result.isNeg = x.isNeg != y.isNeg;

         return result;

     };

     RSAUtils.biMultiplyDigit = function (x, y) {

         var n,

         c,

         uv;

         result = new BigInt();

         n = RSAUtils.biHighIndex(x);

         c = 0;

         for (var j = 0; j <= n; ++j) {

             uv = result.digits[j] + x.digits[j] * y + c;

             result.digits[j] = uv & maxDigitVal;

             c = uv >>> biRadixBits;

             //c = Math.floor(uv / biRadix);

         }

         result.digits[1 + n] = c;

         return result;

     };

     RSAUtils.arrayCopy = function (src, srcStart, dest, destStart, n) {

         var m = Math.min(srcStart + n, src.length);

         for (var i = srcStart, j = destStart; i < m; ++i, ++j) {

             dest[j] = src[i];

         }

     };

     var highBitMasks = [0x0000, 0x8000, 0xC000, 0xE000, 0xF000, 0xF800,

         0xFC00, 0xFE00, 0xFF00, 0xFF80, 0xFFC0, 0xFFE0,

         0xFFF0, 0xFFF8, 0xFFFC, 0xFFFE, 0xFFFF];

     RSAUtils.biShiftLeft = function (x, n) {

         var digitCount = Math.floor(n / bitsPerDigit);

         var result = new BigInt();

         RSAUtils.arrayCopy(x.digits, 0, result.digits, digitCount,

             result.digits.length - digitCount);

         var bits = n % bitsPerDigit;

         var rightBits = bitsPerDigit - bits;

         for (var i = result.digits.length - 1, i1 = i - 1; i > 0; --i, --i1) {

             result.digits[i] = ((result.digits[i] << bits) & maxDigitVal) |

             ((result.digits[i1] & highBitMasks[bits]) >>>

                 (rightBits));

         }

         result.digits[0] = ((result.digits[i] << bits) & maxDigitVal);

         result.isNeg = x.isNeg;

         return result;

     };

     var lowBitMasks = [0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F,

         0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF,

         0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF];

     RSAUtils.biShiftRight = function (x, n) {

         var digitCount = Math.floor(n / bitsPerDigit);

         var result = new BigInt();

         RSAUtils.arrayCopy(x.digits, digitCount, result.digits, 0,

             x.digits.length - digitCount);

         var bits = n % bitsPerDigit;

         var leftBits = bitsPerDigit - bits;

         for (var i = 0, i1 = i + 1; i < result.digits.length - 1; ++i, ++i1) {

             result.digits[i] = (result.digits[i] >>> bits) |

             ((result.digits[i1] & lowBitMasks[bits]) << leftBits);

         }

         result.digits[result.digits.length - 1] >>>= bits;

         result.isNeg = x.isNeg;

         return result;

     };

     RSAUtils.biMultiplyByRadixPower = function (x, n) {

         var result = new BigInt();

         RSAUtils.arrayCopy(x.digits, 0, result.digits, n, result.digits.length - n);

         return result;

     };

     RSAUtils.biDivideByRadixPower = function (x, n) {

         var result = new BigInt();

         RSAUtils.arrayCopy(x.digits, n, result.digits, 0, result.digits.length - n);

         return result;

     };

     RSAUtils.biModuloByRadixPower = function (x, n) {

         var result = new BigInt();

         RSAUtils.arrayCopy(x.digits, 0, result.digits, 0, n);

         return result;

     };

     RSAUtils.biCompare = function (x, y) {

         if (x.isNeg != y.isNeg) {

             return 1 - 2 * Number(x.isNeg);

         }

         for (var i = x.digits.length - 1; i >= 0; --i) {

             if (x.digits[i] != y.digits[i]) {

                 if (x.isNeg) {

                     return 1 - 2 * Number(x.digits[i] > y.digits[i]);

                 } else {

                     return 1 - 2 * Number(x.digits[i] < y.digits[i]);

                 }

             }

         }

         return 0;

     };

     RSAUtils.biDivideModulo = function (x, y) {

         var nb = RSAUtils.biNumBits(x);

         var tb = RSAUtils.biNumBits(y);

         var origYIsNeg = y.isNeg;

         var q,

         r;

         if (nb < tb) {

             // |x| < |y|

             if (x.isNeg) {

                 q = RSAUtils.biCopy(bigOne);

                 q.isNeg = !y.isNeg;

                 x.isNeg = false;

                 y.isNeg = false;

                 r = biSubtract(y, x);

                 // Restore signs, 'cause they're references.

                 x.isNeg = true;

                 y.isNeg = origYIsNeg;

             } else {

                 q = new BigInt();

                 r = RSAUtils.biCopy(x);

             }

             return [q, r];

         }

         q = new BigInt();

         r = x;

         // Normalize Y.

         var t = Math.ceil(tb / bitsPerDigit) - 1;

         var lambda = 0;

         while (y.digits[t] < biHalfRadix) {

             y = RSAUtils.biShiftLeft(y, 1);

             ++lambda;

             ++tb;

             t = Math.ceil(tb / bitsPerDigit) - 1;

         }

         // Shift r over to keep the quotient constant. We'll shift the

         // remainder back at the end.

         r = RSAUtils.biShiftLeft(r, lambda);

         nb += lambda; // Update the bit count for x.

         var n = Math.ceil(nb / bitsPerDigit) - 1;

         var b = RSAUtils.biMultiplyByRadixPower(y, n - t);

         while (RSAUtils.biCompare(r, b) != -1) {

             ++q.digits[n - t];

             r = RSAUtils.biSubtract(r, b);

         }

         for (var i = n; i > t; --i) {

             var ri = (i >= r.digits.length) ? 0 : r.digits[i];

             var ri1 = (i - 1 >= r.digits.length) ? 0 : r.digits[i - 1];

             var ri2 = (i - 2 >= r.digits.length) ? 0 : r.digits[i - 2];

             var yt = (t >= y.digits.length) ? 0 : y.digits[t];

             var yt1 = (t - 1 >= y.digits.length) ? 0 : y.digits[t - 1];

             if (ri == yt) {

                 q.digits[i - t - 1] = maxDigitVal;

             } else {

                 q.digits[i - t - 1] = Math.floor((ri * biRadix + ri1) / yt);

             }

             var c1 = q.digits[i - t - 1] * ((yt * biRadix) + yt1);

             var c2 = (ri * biRadixSquared) + ((ri1 * biRadix) + ri2);

             while (c1 > c2) {

                 --q.digits[i - t - 1];

                 c1 = q.digits[i - t - 1] * ((yt * biRadix) | yt1);

                 c2 = (ri * biRadix * biRadix) + ((ri1 * biRadix) + ri2);

             }

             b = RSAUtils.biMultiplyByRadixPower(y, i - t - 1);

             r = RSAUtils.biSubtract(r, RSAUtils.biMultiplyDigit(b, q.digits[i - t - 1]));

             if (r.isNeg) {

                 r = RSAUtils.biAdd(r, b);

                 --q.digits[i - t - 1];

             }

         }

         r = RSAUtils.biShiftRight(r, lambda);

         // Fiddle with the signs and stuff to make sure that 0 <= r < y.

         q.isNeg = x.isNeg != origYIsNeg;

         if (x.isNeg) {

             if (origYIsNeg) {

                 q = RSAUtils.biAdd(q, bigOne);

             } else {

                 q = RSAUtils.biSubtract(q, bigOne);

             }

             y = RSAUtils.biShiftRight(y, lambda);

             r = RSAUtils.biSubtract(y, r);

         }

         // Check for the unbelievably stupid degenerate case of r == -0.

         if (r.digits[0] == 0 && RSAUtils.biHighIndex(r) == 0)

             r.isNeg = false;

         return [q, r];

     };

     RSAUtils.biDivide = function (x, y) {

         return RSAUtils.biDivideModulo(x, y)[0];

     };

     RSAUtils.biModulo = function (x, y) {

         return RSAUtils.biDivideModulo(x, y)[1];

     };

     RSAUtils.biMultiplyMod = function (x, y, m) {

         return RSAUtils.biModulo(RSAUtils.biMultiply(x, y), m);

     };

     RSAUtils.biPow = function (x, y) {

         var result = bigOne;

         var a = x;

         while (true) {

             if ((y & 1) != 0)

                 result = RSAUtils.biMultiply(result, a);

             y >>= 1;

             if (y == 0)

                 break;

             a = RSAUtils.biMultiply(a, a);

         }

         return result;

     };

     RSAUtils.biPowMod = function (x, y, m) {

         var result = bigOne;

         var a = x;

         var k = y;

         while (true) {

             if ((k.digits[0] & 1) != 0)

                 result = RSAUtils.biMultiplyMod(result, a, m);

             k = RSAUtils.biShiftRight(k, 1);

             if (k.digits[0] == 0 && RSAUtils.biHighIndex(k) == 0)

                 break;

             a = RSAUtils.biMultiplyMod(a, a, m);

         }

         return result;

     };

     $w.BarrettMu = function (m) {

         this.modulus = RSAUtils.biCopy(m);

         this.k = RSAUtils.biHighIndex(this.modulus) + 1;

         var b2k = new BigInt();

         b2k.digits[2 * this.k] = 1; // b2k = b^(2k)

         this.mu = RSAUtils.biDivide(b2k, this.modulus);

         this.bkplus1 = new BigInt();

         this.bkplus1.digits[this.k + 1] = 1; // bkplus1 = b^(k+1)

         this.modulo = BarrettMu_modulo;

         this.multiplyMod = BarrettMu_multiplyMod;

         this.powMod = BarrettMu_powMod;

     };

     function BarrettMu_modulo(x) {

         var $dmath = RSAUtils;

         var q1 = $dmath.biDivideByRadixPower(x, this.k - 1);

         var q2 = $dmath.biMultiply(q1, this.mu);

         var q3 = $dmath.biDivideByRadixPower(q2, this.k + 1);

         var r1 = $dmath.biModuloByRadixPower(x, this.k + 1);

         var r2term = $dmath.biMultiply(q3, this.modulus);

         var r2 = $dmath.biModuloByRadixPower(r2term, this.k + 1);

         var r = $dmath.biSubtract(r1, r2);

         if (r.isNeg) {

             r = $dmath.biAdd(r, this.bkplus1);

         }

         var rgtem = $dmath.biCompare(r, this.modulus) >= 0;

         while (rgtem) {

             r = $dmath.biSubtract(r, this.modulus);

             rgtem = $dmath.biCompare(r, this.modulus) >= 0;

         }

         return r;

     }

     function BarrettMu_multiplyMod(x, y) {

         /*

         x = this.modulo(x);

         y = this.modulo(y);

          */

         var xy = RSAUtils.biMultiply(x, y);

         return this.modulo(xy);

     }

     function BarrettMu_powMod(x, y) {

         var result = new BigInt();

         result.digits[0] = 1;

         var a = x;

         var k = y;

         while (true) {

             if ((k.digits[0] & 1) != 0)

                 result = this.multiplyMod(result, a);

             k = RSAUtils.biShiftRight(k, 1);

             if (k.digits[0] == 0 && RSAUtils.biHighIndex(k) == 0)

                 break;

             a = this.multiplyMod(a, a);

         }

         return result;

     }

     var RSAKeyPair = function (encryptionExponent, decryptionExponent, modulus) {

         var $dmath = RSAUtils;

         this.e = $dmath.biFromHex(encryptionExponent);

         this.d = $dmath.biFromHex(decryptionExponent);

         this.m = $dmath.biFromHex(modulus);

         // We can do two bytes per digit, so

         // chunkSize = 2 * (number of digits in modulus - 1).

         // Since biHighIndex returns the high index, not the number of digits, 1 has

         // already been subtracted.

         this.chunkSize = 2 * $dmath.biHighIndex(this.m);

         this.radix = 16;

         this.barrett = new $w.BarrettMu(this.m);

     };

     RSAUtils.getKeyPair = function (encryptionExponent, decryptionExponent, modulus) {

         return new RSAKeyPair(encryptionExponent, decryptionExponent, modulus);

     };

     if (typeof $w.twoDigit === 'undefined') {

         $w.twoDigit = function (n) {

             return (n < 10 ? "0" : "") + String(n);

         };

     }

     // Altered by Rob Saunders (rob@robsaunders.net). New routine pads the

     // string after it has been converted to an array. This fixes an

     // incompatibility with Flash MX's ActionScript.

     RSAUtils.encryptedString = function (key, s) {

         var a = [];

         var sl = s.length;

         var i = 0;

         while (i < sl) {

             a[i] = s.charCodeAt(i);

             i++;

         }

         while (a.length % key.chunkSize != 0) {

             a[i++] = 0;

         }

         var al = a.length;

         var result = "";

         var j,

         k,

         block;

         for (i = 0; i < al; i += key.chunkSize) {

             block = new BigInt();

             j = 0;

             for (k = i; k < i + key.chunkSize; ++j) {

                 block.digits[j] = a[k++];

                 block.digits[j] += a[k++] << 8;

             }

             var crypt = key.barrett.powMod(block, key.e);

             var text = key.radix == 16 ? RSAUtils.biToHex(crypt) : RSAUtils.biToString(crypt, key.radix);

             result += text + " ";

         }

         return result.substring(0, result.length - 1); // Remove last space.

     };

     RSAUtils.decryptedString = function (key, s) {

         var blocks = s.split(" ");

         var result = "";

         var i,

         j,

         block;

         for (i = 0; i < blocks.length; ++i) {

             var bi;

             if (key.radix == 16) {

                 bi = RSAUtils.biFromHex(blocks[i]);

             } else {

                 bi = RSAUtils.biFromString(blocks[i], key.radix);

             }

             block = key.barrett.powMod(bi, key.d);

             for (j = 0; j <= RSAUtils.biHighIndex(block); ++j) {

                 result += String.fromCharCode(block.digits[j] & 255,

                     block.digits[j] >> 8);

             }

         }

         // Remove trailing null, if any.

         if (result.charCodeAt(result.length - 1) == 0) {

             result = result.substring(0, result.length - 1);

         }

         return result;

     };

     RSAUtils.setMaxDigits(130);

 })(window);

LoadRunner 12 模拟 RSA加密 登录的实现（JS）的更多相关文章

  1. React Native + Nodejs 使用RSA加密登录

    想用rn做个RSA(非对称加密)登录 基本流程就是在服务端生成RSA后,将“公钥”发到客户端,然后客户端用“公钥”加密信息发送到服务端,服务务端用私钥解密. 过程不复杂,问题在于,nodejs和rn都 ...

  2. 使用Python 模拟RSA 加密与解密

    一.关于 RSA具体原理请移步其他文章,本文主要使用Python 来模拟RSA 算法的实现过程 二.简要分析 在RSA算法中,存在以下几个参数: 1.大素数p.q 2.n = p *q 3.Phi_n ...

  3. app与后台的token、sessionId、RSA加密登录认证与安全解决方案

    一.登录机制 粗略地分析, 登录机制主要分为登录验证.登录保持.登出三个部分.登录验证是指客户端提供用户名和密码,向服务器提出登录请求,服务器判断客户端是否可以登录并向客户端确认. 登录认保持是指客户 ...

  4. RSA加密登录

    1.首先下载前端JS加密框架:jsencrypt 2.后台添加解密帮助类:RSACrypto(参考文章最后) 3.在登录页面先引入jquery.min.js,在引入jsencrypt.min.js 4 ...

  5. Js参数RSA加密传输，jsencrypt.js的使用

    注意几点: 1.参数传递的+号处理,在传输时会把+变成空格,不处理后端就报错了. 1.前段代码 <!DOCTYPE html> <html> <head> < ...

  6. Jmeter_前端RSA加密下的登陆模拟_引用js文件实现

    版权声明:本文为博主原创文章,未经博主允许不得转载. 在一次项目实战中,前端登录使用了RSA加密,使用LoadRunner压测的第一步,就是模拟用户登录,可惜loadRunner11并不能录制前端的加 ...

  7. Jmeter_前端RSA加密下的登陆模拟_引用js文件实现(转)

    在一次项目实战中,前端登录使用了RSA加密,使用LoadRunner压测的第一步,就是模拟用户登录,可惜loadRunner11并不能录制前端的加密过程,并且安装的LR是基于C语言版,网络上关于RSA ...

  8. vue实现rsa加密，数字签名,md5加密等

    一.使用jsencrypt进行rsa加密 原文链接:Js参数RSA加密传输,jsencrypt.js的使用 - CSDN博客 *(原文处有一个地方不对,不需要转换+,rsa已经做过base64转码了) ...

  9. vue使用JSEncrypt实现rsa加密及挂载方法

    挂载全局方法 使用jsencrypt进行rsa加密 原文链接:Js参数RSA加密传输,jsencrypt.js的使用 - CSDN博客* https://blog.csdn.net/p31201115 ...

随机推荐

  1. 自动分割nginx服务的日志文件

    nginx服务每天都会产生大量的日志信息,时间一长导致日志文件容量很大,会影响系统性能.通过以下shell代码,配合crontab定时执行可实现nginx日志定时分割的功能. #!/bin/bash ...

  2. iOS UITableViewCell UITableVIewController 纯代码开发

    iOS UITableViewCell UITableVIewController 纯代码开发 <原创> .纯代码 自定义UITableViewCell 直接上代码 ////// #imp ...

  3. vue双向绑定补充说明方法

    本文总结自: https://segmentfault.com/a/1190000006599500,将每一个流程提炼出来做一个简单的说明,以免自己被繁杂的逻辑弄昏头脑~ observer: 遍历数据 ...

  4. poj 1144 Network 【求一个网络的割点的个数 矩阵建图+模板应用】

    题目地址:http://poj.org/problem?id=1144 题目:输入一个n,代表有n个节点(如果n==0就结束程序运行). 在当下n的这一组数据,可能会有若干行数据,每行先输入一个节点a ...

  5. mysql 触发器（trigger） 总结

    触发器(trigger):监视某种情况,并触发某种操作. 触发器创建语法四要素:1.监视地点(table) 2.监视事件(insert/update/delete) 3.触发时间(after/befo ...

  6. wampserver2 配置ssl 经过验证 可用

    本文原地址 http://blog.csdn.net/taosst/article/details/2182966 http://forum.wampserver.com/read.php?2,329 ...

  7. jquery 实现动态表单设计

    只是实现了前台页面的动态表单的设计,并未实现后台绑定数据到数据库等功能.技术使用到的为jquery和bootstrap.俗话说有图有真相,先说下具体效果如下: 点击添加一个面板容器: 容器添加成功: ...

  8. 十九 Django框架，发送邮件

    全局配置settings.py EMAIL_BACKEND = 'django.core.mail.backends.smtp.EmailBackend' #发送邮件引擎 EMAIL_USE_TLS ...

  9. POJ 1270 Following Orders（拓扑排序）

    题意: 给两行字符串,第一行为一组变量,第二行时一组约束(每个约束包含两个变量,x y 表示 x <y).输出满足约束的所有字符串序列. 思路:拓扑排序 + 深度优先搜索(DFS算法) 课本代码 ...

  10. Hibernate学习---第十一节：Hibernate之数据抓取策略&批量抓取

    1.hibernate 也可以通过标准的 SQL 进行查询 (1).将SQL查询写在 java 代码中 /** * 查询所有 */ @Test public void testQuery(){ // ...