当前位置： 文江博客话题详情

PHP怎么用模数和指数得到公钥进行RSA加密

发布于 2022-09-06 03:39:16 字数 2848 浏览 17 评论 0

已知16进制模数：C34E069415AC02FC4EA5F45779B7568506713E9210789D527BB89EE462662A1D0E94285E1A764F111D553ADD7C65673161E69298A8BE2212DF8016787E2F4859CD599516880D79EE5130FC5F8B7F69476938557CD3B8A79A612F1DDACCADAA5B6953ECC4716091E7C5E9F045B28004D33548EC89ED5C6B2C64D6C3697C5B9DD3
和指数：10001
请问用php怎么用16进制的模数和已知指数才能得到公钥进行RSA加密？？？

【问题详细描述：
是这样，由于业务需求，需要用php Curl进行站点模拟登录，而别人的站点，是对pwd密码进行了rsa加密传到后台的，如果我要curl模拟登录的话，必须也要把密码进行rsa加密模拟post提交上去。其中该站点登录页面的pwd加密是在前端js RSA加密的，其中看到有2个隐藏域，一个是16进制的字符串（可看出是模数），然后还有一个是类似于10001数字字符串（可看出是指数），他的js RSA加密算法如下：

<body>
    <!--RSA加密-->
    <script src="../../javascript/RSA/Barrett.js?versions=19" type="text/javascript"></script>
    <script src="../../javascript/RSA/RSA.js?versions=19" type="text/javascript"></script>
    <script src="../../javascript/RSA/BigInt.js?versions=19" type="text/javascript"></script>
    <!---->
    <div>
        <input type="hidden" name="Modulus" id="ModulusID" value="B1AEB985675327181ACBE9B4E74F3424F157AC81B88CE92988408C16EAB77190EA4EB740F255A2206049457B54158BA775B61CE0A97568E55B606138AA5FE5B8A123CD27E6E1BCA469051420817807EE69F73D6B87D474EFC5AA40CB9715FE7BD1E22DE542D90F7E021F39B5F377E021AB84B0068B9614250484A20A3900E8FB">
        <input type="hidden" name="Exponent" id="ExponentID" value="10001">

        <input name="pwd" type="password" id="pwd" placeholder="请输入密码" maxlength="19">
    </div>
    
    <script>
       $(function () {
        var uPwd = $("#pwd").val().trim(); //密码
       //rsa加密
        setMaxDigits(129);
        var key = new RSAKeyPair($("#ExponentID").val(), "", $("#ModulusID").val());
        var uPwd2 = encryptedString(key, $.trim(uPwd));//加密后密码传到后台登录
       //rsa加密 end
        var parameter = { uName: $("#uname").val(), uPwd: udPwd2};
       $.ajax({
            type: "POST",
            url: "login.do",
            dataType: 'json',
            data: parameter,
            cache: false,
            error: function () {
                alert("系统异常，请联系客服咨询！");
            },
            success: function (msg) {
                if (msg == "" || msg == null) {
                    alert("系统异常，请联系客服咨询！" + msg);
                    return;
                }
                if (msg.status == 0) {
                    alert("登录成功！");
                    window.location.reload();
                    return;
                }else {
                   alert('登录失败'.msg);
                    return;
                }

            }
        });
       });
    </script>
</body>

如上几段代码是前端给登录密码加密主要片段。其中js RSA加密是用的：ohdave.com/rsa/ 这网站的，因为现在要php curl模拟登录别的站，我的思路是先通过curl获取两个ModulusID和ExponentID这2个异常域的值，然后通过php跟如上js rsa加密一样给密码加密，然后post登录。现在问题是，我在php后端怎么才能像如上片段js RSA加密一样给密码RSA加密。求救
】

如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论， 你可以免费 注册 一个本站的账号。

评论（2）

み青杉依旧 2022-09-13 03:39:16

我最近也写过一个类似模拟登录的，由于你的html里面已经有Modulus和Exponent了，你可以直接利用rsa库对密码进行加密。我用的是nodejs自己封装的，PHP的应该也有。

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;

//1024 * 2 / 16 = 128 digits of storage.
//
var maxDigits;
var ZERO_ARRAY;
var bigZero, bigOne;

RSAUtils.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 RSAUtils.BigInt();
  bigOne = new RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.BigInt();
  var place = new RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.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 RSAUtils.BigInt();
  RSAUtils.arrayCopy(x.digits, 0, result.digits, n, result.digits.length - n);
  return result;
};

RSAUtils.biDivideByRadixPower = function(x, n) {
  var result = new RSAUtils.BigInt();
  RSAUtils.arrayCopy(x.digits, n, result.digits, 0, result.digits.length - n);
  return result;
};

RSAUtils.biModuloByRadixPower = function(x, n) {
  var result = new RSAUtils.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 RSAUtils.BigInt();
      r = RSAUtils.biCopy(x);
    }
    return [q, r];
  }

  q = new RSAUtils.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;
};


RSAUtils.BarrettMu = function(m) {
  this.modulus = RSAUtils.biCopy(m);
  this.k = RSAUtils.biHighIndex(this.modulus) + 1;
  var b2k = new RSAUtils.BigInt();
  b2k.digits[2 * this.k] = 1; // b2k = b^(2k)
  this.mu = RSAUtils.biDivide(b2k, this.modulus);
  this.bkplus1 = new RSAUtils.BigInt();
  this.bkplus1.digits[this.k + 1] = 1; // bkplus1 = b^(k+1)
  this.modulo = RSAUtils.BarrettMu_modulo;
  this.multiplyMod = RSAUtils.BarrettMu_multiplyMod;
  this.powMod = RSAUtils.BarrettMu_powMod;
};

RSAUtils.BarrettMu_modulo = function(x) {
  var q1 = RSAUtils.biDivideByRadixPower(x, this.k - 1);
  var q2 = RSAUtils.biMultiply(q1, this.mu);
  var q3 = RSAUtils.biDivideByRadixPower(q2, this.k + 1);
  var r1 = RSAUtils.biModuloByRadixPower(x, this.k + 1);
  var r2term = RSAUtils.biMultiply(q3, this.modulus);
  var r2 = RSAUtils.biModuloByRadixPower(r2term, this.k + 1);
  var r = RSAUtils.biSubtract(r1, r2);
  if (r.isNeg) {
    r = RSAUtils.biAdd(r, this.bkplus1);
  }
  var rgtem = RSAUtils.biCompare(r, this.modulus) >= 0;
  while (rgtem) {
    r = RSAUtils.biSubtract(r, this.modulus);
    rgtem = RSAUtils.biCompare(r, this.modulus) >= 0;
  }
  return r;
}

RSAUtils.BarrettMu_multiplyMod = function(x, y) {
  /*
    x = this.modulo(x);
    y = this.modulo(y);
    */
  var xy = RSAUtils.biMultiply(x, y);
  return this.modulo(xy);
}

RSAUtils.BarrettMu_powMod = function(x, y) {
  var result = new RSAUtils.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;
}

function RSAKeyPair(encryptionExponent, decryptionExponent, modulus) {
  this.e = RSAUtils.biFromHex(encryptionExponent);
  this.d = RSAUtils.biFromHex(decryptionExponent);
  this.m = RSAUtils.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 * RSAUtils.biHighIndex(this.m);
  this.radix = 16;
  this.barrett = new RSAUtils.BarrettMu(this.m);
};

RSAUtils.getKeyPair = function(encryptionExponent, decryptionExponent, modulus) {
  return new RSAKeyPair(encryptionExponent, decryptionExponent, modulus);
};

RSAUtils.twoDigit = function(n) {
  return (n < 10 ? "0" : "") + String(n);
};

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 RSAUtils.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);

module.exports = RSAUtils;

使用方式也：

var RSAUtils = require('./RSA')

// 获取RSA的公钥，计算加密后的用户名、密码
function step_2(result) {
  return new Promise((resolve, reject) => {
    console.log(`即将访问：${url_get_key}`)
    request.post({
      url: url_get_key
    }, (err, r, body) => {
      let publicKeyModulus, publicKeyExponent
      let obj = JSON.parse(body)
      publicKeyModulus = obj.publicKeyModulus
      publicKeyExponent = obj.publicKeyExponent
      let key = new RSAUtils.getKeyPair(publicKeyExponent, '', publicKeyModulus)
      let username_encrypted = RSAUtils.encryptedString(key, user_name.split('').reverse().join(''))
      let passwd_encrypted = RSAUtils.encryptedString(key, passwd.split('').reverse().join(''))
      result.publicKeyModulus = publicKeyModulus
      result.publicKeyExponent = publicKeyExponent
      result.username_encrypted = username_encrypted
      result.passwd_encrypted = passwd_encrypted
      resolve(result)
    })
  })
}
回复
不知所踪 2022-09-13 03:39:16

有人吗？帮帮忙，求救。help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、help me、

回复
~没有更多了~

关于作者

回首观望

暂无简介

0 文章
0 评论
22 人气
发私信

相关话题

更多

热门标签

操作系统 程序设计 IT运维 Linux系统管理 JavaScript 服务器应用 solaris C/C++ PHP Shell BSD Vue.js aix Oracle Python HTML 系统管理 HTML5 CSS 前端
更多

推荐作者

linfzu01

文章 0 评论 0

§对你不离不弃

文章 0 评论 0

可遇━不可求

文章 0 评论 0

枕梦

文章 0 评论 0

qq_3LFa8Q

文章 0 评论 0

JP

文章 0 评论 0

更多

友情链接

文江博客
    我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站，即表示您同意使用 Cookies 和您的相关数据。
    原文