精易论坛

 找回密码
 注册

QQ登录

只需一步,快速开始

用微信号发送消息登录论坛

新人指南 邀请好友注册 - 我关注人的新帖 教你赚取精币 - 每日签到


求职/招聘- 论坛接单- 资源出售

论坛版规 总版规 - 建议/投诉 - 应聘版主 - 精华帖总集 积分说明 - 禁言标准 - 有奖举报

2019年好项目,每月多挣好多钱收抖音火山王者引流:1513888885长期 包养全网交友粉大户┏ E3 E5 X58超强双路服务器 ┓找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
2019年好项目,每月多挣好多钱收抖音火山王者引流:1513888885长期 包养全网交友粉大户┃单进程单IP每个模拟器IP不同┃找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
全国PPTP秒换IP 动态IP仅35元/月诺宾混拨动态vps/PPTP多地区换IP长期 包养全网交友粉大户┗ 模拟器24开,稳 定 不 卡 。┛找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
出兼职,网赚,交友粉,扫码进群出微信qq交友粉网赚粉精准粉兼职长期 包养全网交友粉大户█IP精灵█最强大的动态IP加速器找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
大量收微信扫码进群男粉2820301656出Q群粉联系QQ:492544249各种【活粉变现点这里】客服①███出售质量精准粉███找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
┏集团收购:一手短信、邮箱群fa┓╔ 大量现金实力收真实粉 ╗各种【活粉变现点这里】客服①高价收购网赚精准粉找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
┃集团收购:一手短信、邮箱群fa┃ 日消耗X6一辆,无限收粉各种【活粉变现点这里】客服②高价收购网赚精准粉找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
┃集团收购:,一手精准群发用户┃ 收粉丶卖粉丶大型①群各种【活粉变现点这里】客服②高价收购网赚精准粉找软件作者合作/收购引流软件
 ★实力收购一切粉QQ3388788888★
┃集团收购:,一手精准群发用户┃收粉丶卖粉丶大型①群各种【活粉变现点这里】客服③高价收购网赚精准粉实力团队大量收粉入群找管理★实力收购一切粉QQ3388788888★
┗集团收购:-爬取QQ达人会员号┛收粉丶卖粉丶大型①群各种【活粉变现点这里】客服③高价收购网赚精准粉实力团队大量收粉入群找管理
 ★实力收购一切粉QQ3388788888★
长期大量收一手精准网赚粉收粉丶卖粉丶大型①群██大量收婚恋宝妈 快手 火山██出高质量粉,日产多、实力来谈实力团队大量收粉入群找管理出售长短效HTTP-S5私密IP-高质量
长期收各种精准网赚资源收粉丶卖粉丶大型①群██ 稳定收交友粉,找我换钱 ██精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理出售长短效HTTP-S5私密IP-高质量
长期收各种小视频网赚资源收粉丶卖粉丶大型①群██收婚恋粉宝妈粉,找我换钱██精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理长期出QQ群QQ号微信精准粉网挣粉
长期收各种引流精准网赚粉收粉丶卖粉丶大型①群██收快手火山虎牙,找我换钱██精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理出网赚粉/精准粉/独家引流软件
大量收粉真实粉商长期合作收粉丶卖粉丶大型①群██长期大量收粉量大量小都吃██精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理█实力公司收网赚兼职粉█
加华缘社群支持免费担保收粉丶卖粉丶大型①群██ 婚恋/抖音/宝妈/空间/快手██精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理寻求实力团队
欢迎粉商渠道客户进QQ群收粉丶卖粉丶大型①群███有量有质量,找我换钱███精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理高效率合作,
长期收各种粉真实长期合作收粉丶卖粉丶大型①群███实力大型公司收媒体量███精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理欢迎来扰!!
真实网赚量点击进华缘社群收粉丶卖粉丶大型①群███大量资金,来一手代理███精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理无限收任何量
华缘社Q群号码364884407╚ 全网实力最高单价收粉 ╝ ███有量就有钱,速度来撩███精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道█长期大量收购各种活粉█┃  全网大量收  ┃精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道█ 长期收购各种引流软件 █┃ 各种App交友粉 ┃精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道大量收代加QQ各种单双向群┃   网赚粉   ┃精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道现加/拉群/现货单双向群通吃┃   游戏粉   ┃精准粉-产量高-时速快-质量好实力团队大量收粉入群找管理拒绝骗子
公司实力收引流软件渠道怕你没量,别怕我没钱┃   婚恋粉   ┃出高质量粉,日产多、实力来谈实力团队大量收粉入群找管理拒绝骗子
公司实力收引流软件渠道★★★★短★信★群★Fa★★★★┃  各种活人粉  ┃『实力收扫码进群量』实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道短★-招中介-找中介-寻中介-★短┃   短视频粉  ┃『你量真,我需求大』实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道信★兼职-网赚-量足大量接单★信┃ 全网最高单价收购 ┃『 你不乱,我不断 』实力团队大量收粉入群找管理无限收任何量
公司实力收引流软件渠道群★移动-电信爆卡100%到达★群寻求 媒体量合作 有资源的撩我
『 →qq:12587210←』
寻引流高手合作/1万粉以下勿扰无限收任何量
公司实力收引流软件渠道Fa★实力机房价高质高不扣量★Fa寻求 媒体量合作 有资源的撩我
『欢迎实力粉商来撩』
寻引流高手合作/1万粉以下勿扰无限收任何量
公司实力收引流软件渠道无限收QQ网吧关注公众号QQ222561寻求 媒体量合作 有资源的撩我长期收网赚粉 QQ8904040寻引流高手合作/1万粉以下勿扰收男粉微信扫码进群QQ1324888881
公司实力收引流软件渠道无限收精准网赚粉联系QQ267804寻求 媒体量合作 有资源的撩我实力团队收粉 QQ8904040寻引流高手合作/1万粉以下勿扰收男粉微信扫码进群QQ1324888881
公司实力收引流软件渠道收网赚粉 兼职粉 宝妈粉 9703796寻求 媒体量合作 有资源的撩我长期收网赚粉 QQ8904040寻引流高手合作/1万粉以下勿扰大量收男粉扫码进群QQ1324888881
公司实力收引流软件渠道收网赚粉 兼职粉 宝妈粉 9703796寻求 媒体量合作 有资源的撩我实力团队收网赚粉入群找管理寻引流高手合作/1万粉以下勿扰收男粉微信扫码进群QQ1324888881
公司实力收引流软件渠道收网赚粉 兼职粉 宝妈粉 9703796寻求 媒体量合作 有资源的撩我实力团队收网赚粉入群找管理寻引流高手合作/1万粉以下勿扰收男粉微信扫码进群QQ1324888881
———群fa资源/邮件群fa代发改成长期收购微信男活跃粉寻求 媒体量合作 有资源的撩我出QQ群微信QQ号交友粉网赚粉兼职粉寻引流高手合作/1万粉以下勿扰收Q粉微信扫码进群qq:2591360085
出精准网赚粉 兼职粉实力团队收粉,收购引流软件█拨号VPS服务器4元/天免费测试██微信朋友圈投放网赚广告█寻引流高手合作/1万粉以下勿扰短信实力卡发量,无视内容
每天稳定出正常话术邮箱交友粉出售精准网赚粉、兼职粉集团超高价收量QQ: 2019306666群fa短信 95达到率寻引流高手合作/1万粉以下勿扰我要租广告位
查看: 240|回复: 1
收起左侧

[易求助] JS代码 浏览器运行可以,系统运行出错

[复制链接]

签到天数:3 天

结帖率:43% (3/7)
发表于 2018-8-11 13:28:37 | 显示全部楼层 |阅读模式
5精币
就是这一段  系统运行就出错 !! 就是为啥了。。。请问下小哥哥,小姐姐们


  
function BarrettMu (i)
{
this.modulus = biCopy (i), this.k = biHighIndex (this.modulus) + 1;
var t = new BigInt;
t.digits[2 * this.k] = 1, this.mu = biDivide (t, this.modulus), this.bkplus1 = new BigInt, this.bkplus1.digits[this.k + 1] = 1,
this.modulo = BarrettMu_modulo, this.multiplyMod = BarrettMu_multiplyMod, this.powMod = BarrettMu_powMod
}
function BarrettMu_modulo (i)
{
var t = biDivideByRadixPower (i, this.k - 1) , r = biMultiply (t, this.mu) , e = biDivideByRadixPower (r,
this.k + 1) , n = biModuloByRadixPower (i, this.k + 1) , g = biMultiply (e, this.modulus) , s = biModuloByRadixPower (g,
this.k + 1) , d = biSubtract (n, s);
d.isNeg && (d = biAdd (d, this.bkplus1));
for (var o = biCompare (d, this.modulus) >= 0; o; ) {
d = biSubtract (d, this.modulus), o = biCompare (d, this.modulus) >= 0;
}
return d
}
function BarrettMu_multiplyMod (i, t)
{
var r = biMultiply (i, t);
return this.modulo (r)
}
function BarrettMu_powMod (i, t)
{
var r = new BigInt;
r.digits[0] = 1;
for (var e = i, n = t; ; )
{
if (0 != (1 & n.digits[0]) && (r = this.multiplyMod (r, e)), n = biShiftRight (n, 1), 0 == n.digits[0] && 0 == biHighIndex (n)) {
break;
}
e = this.multiplyMod (e, e)
}
return r
}
function setMaxDigits (i)
{
maxDigits = i, ZERO_ARRAY = new Array (maxDigits);
for (var t = 0; t < ZERO_ARRAY.length; t++) {
ZERO_ARRAY[t] = 0;
}
bigZero = new BigInt, bigOne = new BigInt, bigOne.digits[0] = 1
}
function BigInt (i)
{
"boolean" == typeof i && 1 == i ? this.digits = null : this.digits = ZERO_ARRAY.slice (0), this.isNeg = !1
}
function biFromDecimal (i)
{
for (var t, r = "-" == i.charAt (0), e = r ? 1 : 0; e < i.length && "0" == i.charAt (e); ) {
++e;
}
if (e == i.length) {
t = new BigInt;
}
else
{
var n = i.length - e , g = n % dpl10;
for (0 == g && (g = dpl10), t = biFromNumber (Number (i.substr (e, g))), e += g; e < i.length; ) {
t = biAdd (biMultiply (t, lr10), biFromNumber (Number (i.substr (e, dpl10)))), e += dpl10;
}
t.isNeg = r
}
return t
}
function biCopy (i)
{
var t = new BigInt ( (!0));
return t.digits = i.digits.slice (0), t.isNeg = i.isNeg, t
}
function biFromNumber (i)
{
var t = new BigInt;
t.isNeg = i < 0, i = Math.abs (i);
for (var r = 0; i > 0; ) {
t.digits[r++] = i & maxDigitVal, i >>= biRadixBits;
}
return t
}
function reverseStr (i)
{
for (var t = "", r = i.length - 1; r > - 1; --r) {
t += i.charAt (r);
}
return t
}
function biToString (i, t)
{
var r = new BigInt;
r.digits[0] = t;
for (var e = biDivideModulo (i, r), n = hexatrigesimalToChar[e[1].digits[0]]; 1 == biCompare (e[0],
bigZero);
) e = biDivideModulo (e[0], r), digit = e[1].digits[0], n += hexatrigesimalToChar[e[1].digits[0]];
return (i.isNeg ? "-" : "") + reverseStr (n)
}
function biToDecimal (i)
{
var t = new BigInt;
t.digits[0] = 10;
for (var r = biDivideModulo (i, t), e = String (r[1].digits[0]); 1 == biCompare (r[0], bigZero); ) {
r = biDivideModulo (r[0], t), e += String (r[1].digits[0]);
}
return (i.isNeg ? "-" : "") + reverseStr (e)
}
function digitToHex (t)
{
var r = 15 , e = "";
for (i = 0; i < 4; ++i) {
e += hexToChar[t & r], t >>>= 4;
}
return reverseStr (e)
}
function biToHex (i)
{
for (var t = "", r = (biHighIndex (i), biHighIndex (i)); r > - 1; --r) {
t += digitToHex (i.digits[r]);
}
return t
}
function charToHex (i)
{
var t, r = 48, e = r + 9, n = 97, g = n + 25, s = 65, d = 90;
return t = i >= r && i <= e ? i - r : i >= s && i <= d ? 10 + i - s : i >= n && i <= g ? 10 + i - n : 0
}
function hexToDigit (i)
{
for (var t = 0, r = Math.min (i.length, 4), e = 0; e < r; ++e) {
t <<= 4, t |= charToHex (i.charCodeAt (e));
}
return t
}
function biFromHex (i)
{
for (var t = new BigInt, r = i.length, e = r, n = 0; e > 0; e -= 4, ++n) {
t.digits[n] = hexToDigit (i.substr (Math.max (e - 4, 0), Math.min (e, 4)));
}
return t
}
function biFromString (i, t)
{
var r = "-" == i.charAt (0) , e = r ? 1 : 0 , n = new BigInt , g = new BigInt;
g.digits[0] = 1;
for (var s = i.length - 1; s >= e; s--)
{
var d = i.charCodeAt (s) , o = charToHex (d) , a = biMultiplyDigit (g, o);
n = biAdd (n, a), g = biMultiplyDigit (g, t)
}
return n.isNeg = r, n
}
function biToBytes (i)
{
for (var t = "", r = biHighIndex (i); r > - 1; --r) {
t += digitToBytes (i.digits[r]);
}
return t
}
function digitToBytes (i)
{
var t = String.fromCharCode (255 & i);
i >>>= 8;
var r = String.fromCharCode (255 & i);
return r + t
}
function biDump (i)
{
return (i.isNeg ? "-" : "") + i.digits.join (" ")
}
function biAdd (i, t)
{
var r;
if (i.isNeg != t.isNeg) {
t.isNeg = !t.isNeg, r = biSubtract (i, t), t.isNeg = !t.isNeg;
}
else
{
r = new BigInt;
for (var e, n = 0, g = 0; g < i.digits.length; ++g) {
e = i.digits[g] + t.digits[g] + n, r.digits[g] = 65535 & e, n = Number (e >= biRadix);
}
r.isNeg = i.isNeg
}
return r
}
function biSubtract (i, t)
{
var r;
if (i.isNeg != t.isNeg) {
t.isNeg = !t.isNeg, r = biAdd (i, t), t.isNeg = !t.isNeg;
}
else
{
r = new BigInt;
var e, n;
n = 0;
for (var g = 0; g < i.digits.length; ++g)
{
e = i.digits[g] - t.digits[g] + n, r.digits[g] = 65535 & e, r.digits[g] < 0 && (r.digits[g] += biRadix),
n = 0 - Number (e < 0);
}
if (n == - 1)
{
n = 0;
for (var g = 0; g < i.digits.length; ++g)
{
e = 0 - r.digits[g] + n, r.digits[g] = 65535 & e, r.digits[g] < 0 && (r.digits[g] += biRadix),
n = 0 - Number (e < 0);
}
r.isNeg = !i.isNeg
}
else {
r.isNeg = i.isNeg ;
}
}
return r
}
function biHighIndex (i)
{
for (var t = i.digits.length - 1; t > 0 && 0 == i.digits[t]; ) {
--t;
}
return t
}
function biNumBits (i)
{
var t, r = biHighIndex (i), e = i.digits[r], n = (r + 1) * bitsPerDigit;
for (t = n; t > n - bitsPerDigit && 0 == (32768 & e); --t) {
e <<= 1;
}
return t
}
function biMultiply (i, t)
{
for (var r, e, n, g = new BigInt, s = biHighIndex (i), d = biHighIndex (t), o = 0; o <= d; ++o)
{
for (r = 0, n = o, j = 0; j <= s; ++j, ++n)
{
e = g.digits[n] + i.digits[j] * t.digits[o] + r, g.digits[n] = e & maxDigitVal, r = e >>> biRadixBits;
}
g.digits[o + s + 1] = r
}
return g.isNeg = i.isNeg != t.isNeg, g
}
function biMultiplyDigit (i, t)
{
var r, e, n;
result = new BigInt, r = biHighIndex (i), e = 0;
for (var g = 0; g <= r; ++g)
{
n = result.digits[g] + i.digits[g] * t + e, result.digits[g] = n & maxDigitVal, e = n >>> biRadixBits;
}
return result.digits[1 + r] = e, result
}
function arrayCopy (i, t, r, e, n)
{
for (var g = Math.min (t + n, i.length), s = t, d = e; s < g; ++s, ++d) {
r[d] = i[s];
}
}
function biShiftLeft (i, t)
{
var r = Math.floor (t  / bitsPerDigit) , e = new BigInt;
arrayCopy (i.digits, 0, e.digits, r, e.digits.length - r);
for (var n = t % bitsPerDigit, g = bitsPerDigit - n, s = e.digits.length - 1, d = s - 1; s > 0; --s,
--d) e.digits[s] = e.digits[s] << n & maxDigitVal | (e.digits[d] & highBitMasks[n]) >>> g;
return e.digits[0] = e.digits[s] << n & maxDigitVal, e.isNeg = i.isNeg, e
}
function biShiftRight (i, t)
{
var r = Math.floor (t  / bitsPerDigit) , e = new BigInt;
arrayCopy (i.digits, r, e.digits, 0, i.digits.length - r);
for (var n = t % bitsPerDigit, g = bitsPerDigit - n, s = 0, d = s + 1; s < e.digits.length - 1; ++s,
++d) e.digits[s] = e.digits[s] >>> n | (e.digits[d] & lowBitMasks[n]) << g;
return e.digits[e.digits.length - 1] >>>= n, e.isNeg = i.isNeg, e
}
function biMultiplyByRadixPower (i, t)
{
var r = new BigInt;
return arrayCopy (i.digits, 0, r.digits, t, r.digits.length - t), r
}
function biDivideByRadixPower (i, t)
{
var r = new BigInt;
return arrayCopy (i.digits, t, r.digits, 0, r.digits.length - t), r
}
function biModuloByRadixPower (i, t)
{
var r = new BigInt;
return arrayCopy (i.digits, 0, r.digits, 0, t), r
}
function biCompare (i, t)
{
if (i.isNeg != t.isNeg) {
return 1 - 2 * Number (i.isNeg);
}
for (var r = i.digits.length - 1; r >= 0; --r)
{
if (i.digits[r] != t.digits[r])
{
return i.isNeg ? 1 - 2 * Number (i.digits[r] > t.digits[r]) : 1 - 2 * Number (i.digits[r] < t.digits[r]);
}
return 0;
}
}
function biDivideModulo (i, t)
{
var r, e, n = biNumBits (i), g = biNumBits (t), s = t.isNeg;
if (n < g)
{
return i.isNeg ? (r = biCopy (bigOne), r.isNeg = !t.isNeg, i.isNeg = !1, t.isNeg = !1, e = biSubtract (t,
i), i.isNeg = !0, t.isNeg = s) : (r = new BigInt, e = biCopy (i)), new Array (r, e);
}
r = new BigInt, e = i;
for (var d = Math.ceil (g  / bitsPerDigit) - 1, o = 0; t.digits[d] < biHalfRadix; ) {
t = biShiftLeft (t, 1), ++o, ++g, d = Math.ceil (g  / bitsPerDigit) - 1;
}
e = biShiftLeft (e, o), n += o;
for (var a = Math.ceil (n  / bitsPerDigit) - 1, u = biMultiplyByRadixPower (t, a - d); biCompare (e,
u) != - 1;
) ++r.digits[a - d], e = biSubtract (e, u);
for (var b = a; b > d; --b)
{
var l = b >= e.digits.length ? 0 : e.digits[b] , h = b - 1 >= e.digits.length ? 0 : e.digits[b - 1] ,
f = b - 2 >= e.digits.length ? 0 : e.digits[b - 2] , c = d >= t.digits.length ? 0 : t.digits[d] ,
m = d - 1 >= t.digits.length ? 0 : t.digits[d - 1];
l == c ? r.digits[b - d - 1] = maxDigitVal : r.digits[b - d - 1] = Math.floor ( (l * biRadix + h)  / c);
for (var x = r.digits[b - d - 1] * (c * biRadix + m), v = l * biRadixSquared + (h * biRadix + f); x > v; )
{
--r.digits[b - d - 1], x = r.digits[b - d - 1] * (c * biRadix | m), v = l * biRadix * biRadix + (h * biRadix + f);
}
u = biMultiplyByRadixPower (t, b - d - 1), e = biSubtract (e, biMultiplyDigit (u, r.digits[b - d - 1])),
e.isNeg && (e = biAdd (e, u), --r.digits[b - d - 1])
}
return e = biShiftRight (e, o), r.isNeg = i.isNeg != s, i.isNeg && (r = s ? biAdd (r, bigOne) : biSubtract (r,
bigOne), t = biShiftRight (t, o), e = biSubtract (t, e)), 0 == e.digits[0] && 0 == biHighIndex (e) && (e.isNeg = !1),
new Array (r, e)
}
function biDivide (i, t)
{
return biDivideModulo (i, t)[0]
}
function biModulo (i, t)
{
return biDivideModulo (i, t)[1]
}
function biMultiplyMod (i, t, r)
{
return biModulo (biMultiply (i, t), r)
}
function biPow (i, t)
{
for (var r = bigOne, e = i; ; ) {
if (0 != (1 & t) && (r = biMultiply (r, e)), t >>= 1, 0 == t) {
break;
}
e = biMultiply (e, e)
}
return r
}
function biPowMod (i, t, r)
{
for (var e = bigOne, n = i, g = t; ; )
{
if (0 != (1 & g.digits[0]) && (e = biMultiplyMod (e, n, r)), g = biShiftRight (g, 1), 0 == g.digits[0] && 0 == biHighIndex (g)) {
break;
}
n = biMultiplyMod (n, n, r)
}
return e
}
function RSAKeyPair (i, t, r, e)
{
this.e = biFromHex (i), this.d = biFromHex (t), this.m = biFromHex (r), "number" != typeof e ? this.chunkSize = 2 * biHighIndex (this.m) : this.chunkSize = e  / 8,
this.radix = 16, this.barrett = new BarrettMu (this.m)
}
function encryptedString (i, t, r, e)
{
var n, g, s, d, o, a, u, b, l, h, f = new Array, c = t.length, m = "";
for (d = "string" == typeof r ? r == RSAAPP.NoPadding ? 1 : r == RSAAPP.PKCS1Padding ? 2 : 0 : 0,
o = "string" == typeof e && e == RSAAPP.RawEncoding ? 1 : 0, 1 == d ? c > i.chunkSize && (c = i.chunkSize) : 2 == d && c > i.chunkSize - 11 && (c = i.chunkSize - 11),
n = 0, g = 2 == d ? c - 1 : i.chunkSize - 1;
n < c;
) d ? f[g] = t.charCodeAt (n) : f[n] = t.charCodeAt (n), n++, g--;
for (1 == d && (n = 0), g = i.chunkSize - c % i.chunkSize; g > 0; )
{
if (2 == d) {
for (a = Math.floor (256 * Math.random ()); !a; ) {
a = Math.floor (256 * Math.random ());
}
f[n] = a
}
else {
f[n] = 0;
}
n++, g--
}
for (2 == d && (f[c] = 0, f[i.chunkSize - 2] = 2, f[i.chunkSize - 1] = 0), u = f.length, n = 0; n < u; n += i.chunkSize)
{
for (b = new BigInt, g = 0, s = n; s < n + i.chunkSize; ++g) {
b.digits[g] = f[s++], b.digits[g] += f[s++] << 8;
}
l = i.barrett.powMod (b, i.e), h = 1 == o ? biToBytes (l) : 16 == i.radix ? biToHex (l) : biToString (l,
i.radix), m += h
}
return m
}
function decryptedString (i, t)
{
var r, e, n, g, s = t.split (" "), d = "";
for (e = 0; e < s.length; ++e)
{
for (g = 16 == i.radix ? biFromHex (s[e]) : biFromString (s[e], i.radix), r = i.barrett.powMod (g,
i.d), n = 0;
n <= biHighIndex (r);
++n) d += String.fromCharCode (255 & r.digits[n], r.digits[n] >> 8);
}
return 0 == d.charCodeAt (d.length - 1) && (d = d.substring (0, d.length - 1)), d
}
var biRadixBase = 2, biRadixBits = 16, bitsPerDigit = biRadixBits, biRadix = 65536, biHalfRadix = biRadix >>> 1,
biRadixSquared = biRadix * biRadix, maxDigitVal = biRadix - 1, maxInteger = 9999999999999998, maxDigits,
ZERO_ARRAY, bigZero, bigOne;
setMaxDigits (20);
var dpl10 = 15 , lr10 = biFromNumber (1e15) , hexatrigesimalToChar = new Array ("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") , hexToChar = new Array ("0", "1", "2", "3", "4", "5",
"6", "7", "8", "9", "a", "b", "c", "d", "e", "f") , highBitMasks = new Array (0, 32768, 49152, 57344, 61440,
63488, 64512, 65024, 65280, 65408, 65472, 65504, 65520, 65528, 65532, 65534, 65535) , lowBitMasks = new Array (0,
1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535) , RSAAPP = {};
RSAAPP.NoPadding = "NoPadding", RSAAPP.PKCS1Padding = "PKCS1Padding", RSAAPP.RawEncoding = "RawEncoding",
RSAAPP.NumericEncoding = "NumericEncoding";
var Base64 =
{
enKey : ' ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/', deKey : new Array( - 1,
- 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1,
- 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1, - 1,
- 1, - 1, 62, - 1, - 1, - 1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, - 1, - 1, - 1, - 1, - 1,
- 1, - 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, - 1, - 1, - 1, - 1, - 1, - 1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41,
42, 43, 44, 45, 46, 47, 48, 49, 50, 51, - 1, - 1, - 1, - 1, - 1),
encode : function (src)
{
var str = new Array ();
var ch1, ch2, ch3;
var pos = 0;
while (pos + 3 <= src.length)
{
ch1 = src.charCodeAt (pos++);
ch2 = src.charCodeAt (pos++);
ch3 = src.charCodeAt (pos++);
str.push (this.enKey.charAt (ch1 >> 2), this.enKey.charAt ( ( (ch1 << 4) + (ch2 >> 4)) & 0x3f));
str.push (this.enKey.charAt ( ( (ch2 << 2) + (ch3 >> 6)) & 0x3f), this.enKey.charAt (ch3 & 0x3f));
}
if (pos < src.length)
{
ch1 = src.charCodeAt (pos++);
str.push (this.enKey.charAt (ch1 >> 2));
if (pos < src.length)
{
ch2 = src.charCodeAt (pos);
str.push (this.enKey.charAt ( ( (ch1 << 4) + (ch2 >> 4)) & 0x3f));
str.push (this.enKey.charAt (ch2 << 2 & 0x3f), ' =');
}
else {
str.push (this.enKey.charAt (ch1 << 4 & 0x3f), ' ==');
}
}
return str.join ( ' ');
},
decode : function (src)
{
var str = new Array ();
var ch1, ch2, ch3, ch4;
var pos = 0;
src = src.replace (/[^A-Za-z0-9\+\/]/g, ' ');
while (pos + 4 <= src.length)
{
ch1 = this.deKey[src.charCodeAt (pos++)];
ch2 = this.deKey[src.charCodeAt (pos++)];
ch3 = this.deKey[src.charCodeAt (pos++)];
ch4 = this.deKey[src.charCodeAt (pos++)];
str.push (String.fromCharCode ( (ch1 << 2 & 0xff) + (ch2 >> 4), (ch2 << 4 & 0xff) + (ch3 >> 2),
(ch3 << 6 & 0xff) + ch4));
}
if (pos + 1 < src.length)
{
ch1 = this.deKey[src.charCodeAt (pos++)];
ch2 = this.deKey[src.charCodeAt (pos++)];
if (pos < src.length)
{
ch3 = this.deKey[src.charCodeAt (pos)];
str.push (String.fromCharCode ( (ch1 << 2 & 0xff) + (ch2 >> 4), (ch2 << 4 & 0xff) + (ch3 >> 2)));
}
else {
str.push (String.fromCharCode ( (ch1 << 2 & 0xff) + (ch2 >> 4)));
}
}
return str.join ( ' ');
}
};
//Base64.encode (pass);
function test (c, pwd)
{
setMaxDigits (131);
c = new RSAKeyPair ("3", "10001", c, 1024);
return Base64.encode (encryptedString (c, pwd, RSAAPP.PKCS1Padding, RSAAPP.RawEncoding));
}


回答提醒:如果本帖被关闭无法回复,您有更好的答案帮助楼主解决,请发表至 源码区 可获得加分喔。
友情提醒:本版被采纳的主题可在 申请荣誉值 帖子申请荣誉值,获得 1点 荣誉值,荣誉值可兑换终身vip用户组哦。
快捷通道:申请荣誉值无答案申请取消悬赏投诉有答案未采纳为最佳

签到天数: 3 天

结帖率:43% (3/7)
 楼主| 发表于 2018-8-11 13:30:32 | 显示全部楼层
比如 我这样   test('BC371674B093E0BBA44A18B42FE8672D8E7378F8D30BE069D8DB39F2878C0B988404D9FB5FAA6AF4F769011E040FE3FE4018633D77F3D56C1D3A9953C338E6461949353CEE1FB6A2EF79F2AAECC6204E33BFCFF4F7574445A52719161786B41CC4D9887E5EEE275DAFAFDB7AE6C75C4B6AAFFE0841B831169BDFA424B61FC4CF','zhuhui1994')

您可以选择打赏方式支持他

打赏
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册

本版积分规则 致发广告者

关闭

精易论坛 - 有你更精彩上一条 /1 下一条

快速回复 收藏帖子 返回列表 按钮

sitemap|易语言源码|易语言教程|易语言论坛|诚聘英才|易语言模块|手机版|联系我们|精易论坛
拒绝任何人以任何形式在本论坛发表与中华人民共和国法律相抵触的言论,本站内容均为会员发表,并不代表精易立场!
揭阳精易科技有限公司申明:我公司所有的培训课程版权归精易所有,任何人以任何方式翻录、盗版、破解本站培训课程,我们必将通过法律途径解决!
公司简介:揭阳市揭东区精易科技有限公司致力于易语言教学培训/易语言学习交流社区的建设与软件开发,多年来为中小企业编写过许许多多各式软件,并把多年积累的开发经验逐步录制成视频课程供学员学习,让学员全面系统化学习易语言编程,少走弯路,减少对相关技术的研究与摸索时间,从而加快了学习进度!
防范网络诈骗,远离网络犯罪 违法和不良信息举报电话0663-3422125,QQ: 800073686,邮箱:800073686@b.qq.com
Powered by Discuz! X3.2 揭阳市揭东区精易科技有限公司 ( 粤ICP备12094385号-1) 粤公网安备 44522102000125

快速回复 返回顶部 返回列表