关于某某大学校园网认证系统的一些工作
由于我们学校的校园网认证是弹出页面的那种，每次输密码都会很蛋疼，于是大一的时候我写过一个宏，每次打开认证界面按一下设定好的键就可以自动填上账号密码了，用了将近三年，效果一直不错。
但最近我发现了一个新的问题，我懒得连浏览器都不想自己打开了。
于是我用selenium又写了一个小工具。Selenium也是一个用于Web应用程序测试的工具。Selenium测试直接运行在浏览器中，就像真正的用户在操作一样。支持的浏览器包括IE、Mozilla Firefox、Mozilla Suite等。
from selenium import webdriver
from selenium.webdriver.support.wait import WebDriverWait
from selenium.webdriver.support import expected_conditions as EC
from selenium.common.exceptions import NoSuchElementException
from selenium.webdriver.common.by import By
def submit():
browser = webdriver.Firefox()
browser.get("http://61.137.86.87:8080/portalNat444/index.jsp")
browser.maximize_window()
submit_account = WebDriverWait(browser,timeout=10).until(EC.presence_of_element_located((By.ID,'account')),message=u'元素加载超时!')
submit_account.send_keys("--YOUR_ACCOUNT--")
submit_password = WebDriverWait(browser,timeout=10).until(EC.presence_of_element_located((By.ID,'userPassword')),message=u'元素加载超时!')
submit_password.send_keys("--YOUR_PASSWORD--")
browser.find_element_by_id("login_button").click()
browser.quit()
print ("登录成功！")
except NoSuchElementException as e:
print ("登录失败：")
print (e.message)
if __name__ == "__main__":
其实这段代码已经可以很好地满足我的需要了。
不过因为这两天在学习PyQt4，所以一顺手就写了一个界面，方便使用。
import sys
from PyQt4 import QtGui ,Qt ,QtCore
from selenium import webdriver
from selenium.webdriver.support.wait import WebDriverWait
from selenium.webdriver.support import expected_conditions as EC
from selenium.common.exceptions import NoSuchElementException
from selenium.webdriver.common.by import By
class Window( QtGui.QWidget ):
def __init__( self ):
super( Window, self ).__init__()
self.setWindowTitle( "Auto Submit tool" )
self.setFixedSize(150, 50)
gridlayout = QtGui.QGridLayout()
button1 = QtGui.QPushButton( "Come on!" )
self.connect( button1, QtCore.SIGNAL( 'clicked()' ), self.submit )
gridlayout.addWidget( button1, 0, 0)
self.setLayout( gridlayout )
def OnButton1(self):
def submit(self):
browser = webdriver.Firefox()
browser.get("http://61.137.86.87:8080/portalNat444/index.jsp")
browser.maximize_window()
submit_account = WebDriverWait(browser,timeout=10).until(EC.presence_of_element_located((By.ID,'account')),message=u'元素加载超时!')
submit_account.send_keys("--YOUR_ACCOUNT--")
submit_password = WebDriverWait(browser,timeout=10).until(EC.presence_of_element_located((By.ID,'userPassword')),message=u'元素加载超时!')
submit_password.send_keys("--YOUR_PASSWORD--")
browser.find_element_by_id("login_button").click()
browser.quit()
message = "Successful"
QtGui.QMessageBox.about( self, 'State', message )
print ("登录成功！")
except NoSuchElementException as e:
message = "Login Failed:" + e.message
print ("登录失败：")
print (e.message)
app = QtGui.QApplication( sys.argv )
win = Window()
win.show()
app.exec_()
之后我们惯例应该生成exe的，不过这个东西貌似受众并不广泛，需要的就自己去生成一下喽,记得加上selenium库~
python setup.py py2exe -p selenium
另外，我在找DOM的id的时候发现了一些羞羞的东西（啊啊啊，我真的只是去看一下id的啊！）
1.index.js：
var publickey = RSAUtils.getKeyPair("10001","","a8a02b821d52d3d0cabda83cc190ab5cb5b9b922a4c8ba6b251ecde119e1eacff46fa3bf3b43ef68cebb5b1359fef6f35f32b748dc109fd3d09fb73efe6a96ccf6a48bc40056a6cac327d309b93b1d61d6f6e8f4a42fcc4a2e053445");
var logFlag = false;
$(document).ready(function(){
$('#DialogNote').dialog({
modal:true,
title:'XX大学上网注意事项',
iconCls:'icon-help',
handler:function()
$('#DialogNote').dialog('close');
$.get('gonggao/usingNote.txt',function(data){$('#Notes').html(data)});
$('body').bind('contextmenu', function() {
return false;
$("#login_button").click(function(){
if(true == logFlag)
alert("正在提交服务器,请稍后！");
if(("" == $("#account").val())||(""==$("#userPassword").val()))
alert("账号或密码不能空");
if(($("#account").val().length&32)||($("#userPassword").val().length&32))
alert("账号或密码超长");
if((""==$("#userIntranetAddress").val())||("null"==$("#userIntranetAddress").val()))
alert('无法获取您的网络地址,请输入任意其它网站从网关处导航至本认证页面');
if((""==$("#brasAddress").val())||("null"==$("#brasAddress").val()))
alert('无法获取您接入点设备地址，请输入任意其它网站从网关处导航至本认证页面');
logFlag = true ;
$("#account").attr("readonly",true);
$("#userPassword").attr("readonly",true);
url:'AccessServices/login',
'accountID':$("#account").val()+'@zndx.inter',
'password':RSAUtils.encryptedString(publickey, encodeURIComponent($("#userPassword").val())),
'brasAddress':$("#brasAddress").val(),
'userIntranetAddress':$("#userIntranetAddress").val()
type:'post',
dataType:'json',
contentType:'application/x-www-form-charset=utf-8',
cache:false,
success:function(data){
logFlag = false ;
$("#account").attr("readonly",false);
$("#userPassword").attr("readonly",false);
switch (data.resultCode){
window.location="main2.jsp";
if(data.resultDescribe == null || data.resultDescribe =="")
alert('其他原因认证拒绝');
alert(data.resultDescribe);
alert('用户连接已经存在');
alert('接入服器务繁忙，稍后重试');
alert('未知错误');
alert('认证响应超时');
alert('捕获用户网络地址错误');
alert('服务器网络连接异常');
alert('认证服务脚本执行异常');
case '10':
alert('校验码错误');
case '11':
alert('您的密码相对简单，帐号存在被盗风险，请及时修改成强度高的密码');
window.location="main2.jsp";
case '12':
alert('无法获取您的网络地址,请输入任意其它网站从网关处导航至本认证页面');
case '13':
alert('无法获取您接入点设备地址，请输入任意其它网站从网关处导航至本认证页面');
case '14':
alert('无法获取您套餐信息');
case '16':
alert('请输入任意其它网站导航至本认证页面,并按正常PORTAL正常流程认证');
case '17':
alert('连接已失效，请输入任意其它网站从网关处导航至本认证页面');
alert('未知错误');
error:function(xhr){
logFlag = false ;
$("#account").attr("readonly",false);
$("#userPassword").attr("readonly",false);
alert('网络异常,服务脚本执行异常');
function reloadValidateCode(){
var timeStr = "?time=" + (new Date()).getTime();
var url = "./CodeServlet"+timeS
document.getElementById("validateCodeImg").src =
function resetVal()
$("#account").val('');
$("#userPassword").val('');
return false;
function i18n(type)
if('1'==type)
$("span[id=userid_span]").html("帐 号:");
$("span[id=password_span]").html("密 码:");
$("span[id=validateCode_span]").html("验证码:");
else if('2'==type)
$("span[id=userid_span]").html("Userid:");
$("span[id=password_span]").html("Password:");
$("span[id=validateCode_span]").html("ValidateCode:");
2.security.js：
(function($w) {
if(typeof $w.RSAUtils === 'undefined')
var RSAUtils = $w.RSAUtils = {};
var biRadixBase = 2;
var biRadixBits = 16;
var bitsPerDigit = biRadixB
var biRadix = 1 && 16;
var biHalfRadix = biRadix &&& 1;
var biRadixSquared = biRadix * biR
var maxDigitVal = biRadix - 1;
var maxInteger = 9998;
var ZERO_ARRAY;
var bigZero, bigO
var BigInt = $w.BigInt = function(flag) {
if (typeof flag == "boolean" && flag == true) {
this.digits = null;
this.digits = ZERO_ARRAY.slice(0);
this.isNeg = false;
RSAUtils.setMaxDigits = function(value) {
maxDigits =
ZERO_ARRAY = new Array(maxDigits);
for (var iza = 0; iza & ZERO_ARRAY. iza++) ZERO_ARRAY[iza] = 0;
bigZero = new BigInt();
bigOne = new BigInt();
bigOne.digits[0] = 1;
RSAUtils.setMaxDigits(20);
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 & maxDigitV
i = Math.floor(i / biRadix);
var lr10 = RSAUtils.biFromNumber(0000);
RSAUtils.biFromDecimal = function(s) {
var isNeg = s.charAt(0) == '-';
var i = isNeg ? 1 : 0;
while (i & s.length && s.charAt(i) == '0') ++i;
if (i == s.length) {
result = new BigInt();
var digitCount = s.length -
var fgl = digitCount % dpl10;
if (fgl == 0) fgl = dpl10;
result = RSAUtils.biFromNumber(Number(s.substr(i, fgl)));
while (i & s.length) {
result = RSAUtils.biAdd(RSAUtils.biMultiply(result, lr10),
RSAUtils.biFromNumber(Number(s.substr(i, dpl10))));
i += dpl10;
result.isNeg = isN
RSAUtils.biCopy = function(bi) {
var result = new BigInt(true);
result.digits = bi.digits.slice(0);
result.isNeg = bi.isN
RSAUtils.reverseStr = function(s) {
var result = "";
for (var i = s.length - 1; i & -1; --i) {
result += s.charAt(i);
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) {
var b = new BigInt();
b.digits[0] =
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];
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]);
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;
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;
result = 0;
RSAUtils.hexToDigit = function(s) {
var result = 0;
var sl = Math.min(s.length, 4);
for (var i = 0; i & ++i) {
result &&= 4;
result |= RSAUtils.charToHex(s.charCodeAt(i));
RSAUtils.biFromHex = function(s) {
var result = new BigInt();
var sl = s.
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)));
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;
for (var i = s.length - 1; i &= 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 = isN
RSAUtils.biDump = function(b) {
return (b.isNeg ? "-" : "") + b.digits.join(" ");
RSAUtils.biAdd = function(x, y) {
if (x.isNeg != y.isNeg) {
y.isNeg = !y.isN
result = RSAUtils.biSubtract(x, y);
y.isNeg = !y.isN
result = new BigInt();
var c = 0;
for (var i = 0; i & x.digits. ++i) {
n = x.digits[i] + y.digits[i] +
result.digits[i] = n % biR
c = Number(n &= biRadix);
result.isNeg = x.isN
RSAUtils.biSubtract = function(x, y) {
if (x.isNeg != y.isNeg) {
y.isNeg = !y.isN
result = RSAUtils.biAdd(x, y);
y.isNeg = !y.isN
result = new BigInt();
for (var i = 0; i & x.digits. ++i) {
n = x.digits[i] - y.digits[i] +
result.digits[i] = n % biR
if (result.digits[i] & 0) result.digits[i] += biR
c = 0 - Number(n & 0);
if (c == -1) {
for (var i = 0; i & x.digits. ++i) {
n = 0 - result.digits[i] +
result.digits[i] = n % biR
if (result.digits[i] & 0) result.digits[i] += biR
c = 0 - Number(n & 0);
result.isNeg = !x.isN
result.isNeg = x.isN
RSAUtils.biHighIndex = function(x) {
var result = x.digits.length - 1;
while (result & 0 && x.digits[result] == 0) --
RSAUtils.biNumBits = function(x) {
var n = RSAUtils.biHighIndex(x);
var d = x.digits[n];
var m = (n + 1) * bitsPerD
for (result = result & m - bitsPerD --result) {
if ((d & 0x8000) != 0) break;
RSAUtils.biMultiply = function(x, y) {
var result = new BigInt();
var n = RSAUtils.biHighIndex(x);
var t = RSAUtils.biHighIndex(y);
var u, uv,
for (var i = 0; i &= ++i) {
for (j = 0; j &= ++j, ++k) {
uv = result.digits[k] + x.digits[j] * y.digits[i] +
result.digits[k] = uv & maxDigitV
c = uv &&& biRadixB
result.digits[i + n + 1] =
result.isNeg = x.isNeg != y.isN
RSAUtils.biMultiplyDigit = function(x, y) {
result = new BigInt();
n = RSAUtils.biHighIndex(x);
for (var j = 0; j &= ++j) {
uv = result.digits[j] + x.digits[j] * y +
result.digits[j] = uv & maxDigitV
c = uv &&& biRadixB
result.digits[1 + n] =
RSAUtils.arrayCopy = function(src, srcStart, dest, destStart, n) {
var m = Math.min(srcStart + n, src.length);
for (var i = srcStart, j = destS i & ++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 % bitsPerD
var rightBits = bitsPerDigit -
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.isN
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 % bitsPerD
var leftBits = bitsPerDigit -
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] &&&=
result.isNeg = x.isN
RSAUtils.biMultiplyByRadixPower = function(x, n) {
var result = new BigInt();
RSAUtils.arrayCopy(x.digits, 0, result.digits, n, result.digits.length - n);
RSAUtils.biDivideByRadixPower = function(x, n) {
var result = new BigInt();
RSAUtils.arrayCopy(x.digits, n, result.digits, 0, result.digits.length - n);
RSAUtils.biModuloByRadixPower = function(x, n) {
var result = new BigInt();
RSAUtils.arrayCopy(x.digits, 0, result.digits, 0, n);
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]);
return 1 - 2 * Number(x.digits[i] & y.digits[i]);
RSAUtils.biDivideModulo = function(x, y) {
var nb = RSAUtils.biNumBits(x);
var tb = RSAUtils.biNumBits(y);
var origYIsNeg = y.isN
if (nb & tb) {
if (x.isNeg) {
q = RSAUtils.biCopy(bigOne);
q.isNeg = !y.isN
x.isNeg = false;
y.isNeg = false;
r = biSubtract(y, x);
x.isNeg = true;
y.isNeg = origYIsN
q = new BigInt();
r = RSAUtils.biCopy(x);
return [q, r];
q = new BigInt();
var t = Math.ceil(tb / bitsPerDigit) - 1;
var lambda = 0;
while (y.digits[t] & biHalfRadix) {
y = RSAUtils.biShiftLeft(y, 1);
t = Math.ceil(tb / bitsPerDigit) - 1;
r = RSAUtils.biShiftLeft(r, lambda);
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 = i & --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] = maxDigitV
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);
q.isNeg = x.isNeg != origYIsN
if (x.isNeg) {
if (origYIsNeg) {
q = RSAUtils.biAdd(q, bigOne);
q = RSAUtils.biSubtract(q, bigOne);
y = RSAUtils.biShiftRight(y, lambda);
r = RSAUtils.biSubtract(y, r);
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 = bigO
while (true) {
if ((y & 1) != 0) result = RSAUtils.biMultiply(result, a);
if (y == 0) break;
a = RSAUtils.biMultiply(a, a);
RSAUtils.biPowMod = function(x, y, m) {
var result = bigO
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);
$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;
this.mu = RSAUtils.biDivide(b2k, this.modulus);
this.bkplus1 = new BigInt();
this.bkplus1.digits[this.k + 1] = 1;
this.modulo = BarrettMu_
this.multiplyMod = BarrettMu_multiplyM
this.powMod = BarrettMu_powM
function BarrettMu_modulo(x) {
var $dmath = RSAU
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;
function BarrettMu_multiplyMod(x, y) {
var xy = RSAUtils.biMultiply(x, y);
return this.modulo(xy);
function BarrettMu_powMod(x, y) {
var result = new BigInt();
result.digits[0] = 1;
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);
var RSAKeyPair = function(encryptionExponent, decryptionExponent, modulus) {
var $dmath = RSAU
this.e = $dmath.biFromHex(encryptionExponent);
this.d = $dmath.biFromHex(decryptionExponent);
this.m = $dmath.biFromHex(modulus);
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);
RSAUtils.encryptedString = function(key, s) {
var a = [];
var sl = s.
var i = 0;
while (i & sl) {
a[i] = s.charCodeAt(i);
while (a.length % key.chunkSize != 0) {
a[i++] = 0;
var al = a.
var result = "";
for (i = 0; i & i += key.chunkSize) {
block = new BigInt();
for (k = k & i + key.chunkS ++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);
RSAUtils.decryptedString = function(key, s) {
var blocks = s.split(" ");
var result = "";
for (i = 0; i & blocks. ++i) {
if (key.radix == 16) {
bi = RSAUtils.biFromHex(blocks[i]);
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);
if (result.charCodeAt(result.length - 1) == 0) {
result = result.substring(0, result.length - 1);
RSAUtils.setMaxDigits(130);
})(window);
然后该怎么玩懂的人都懂哈，为了不被老湿请去喝茶，就写到这里吧。
没有更多推荐了，
加入CSDN，享受更精准的内容推荐，与500万程序员共同成长！