Compare commits

..

1 commit

Author SHA1 Message Date
df7688aaea Update keygen.js 2026-02-25 17:19:21 +00:00

View file

@ -19,7 +19,7 @@ const license = {
issued_on: '2025-07-20 00:00:00', issued_on: '2025-07-20 00:00:00',
owner: 'auth', owner: 'auth',
product_id: 'IDAPRO', product_id: 'IDAPRO',
product_version: '9.2', product_version: '9.3',
add_ons: [], add_ons: [],
features: [], features: [],
} }
@ -28,11 +28,13 @@ const license = {
}; };
function addons(license) { function addons(license) {
var addons = [ //update as needed var addons = [ //update as needed, doesnt include cloud addons
'LUMINA', 'TEAMS', 'LUMINA', 'TEAMS',
'HEXX86', 'HEXX64', 'HEXARM', 'HEXARM64', 'HEXX86', 'HEXX64', 'HEXARM', 'HEXARM64',
'HEXMIPS', 'HEXMIPS64', 'HEXPPC', 'HEXPPC64', 'HEXMIPS', 'HEXMIPS64', 'HEXPPC', 'HEXPPC64',
'HEXRV', 'HEXRV64', 'HEXARC', 'HEXARC64' 'HEXRV', 'HEXRV64', 'HEXARC', 'HEXARC64',
'HEXV850'
]; ];
addons.forEach((addon, i) => { addons.forEach((addon, i) => {
@ -67,20 +69,20 @@ function encrypt(message) {
let modulusBuf = 0n; let modulusBuf = 0n;
for (let i = cModulus.length - 1; i >= 0; i--) for (let i = cModulus.length - 1; i >= 0; i--)
modulusBuf = (modulusBuf << 8n) + BigInt(cModulus[i]); modulusBuf = (modulusBuf << 8n) + BigInt(cModulus[i]);
let keyBuf = 0n; let keyBuf = 0n;
for (let i = privateKey.length - 1; i >= 0; i--) for (let i = privateKey.length - 1; i >= 0; i--)
keyBuf = (keyBuf << 8n) + BigInt(privateKey[i]); keyBuf = (keyBuf << 8n) + BigInt(privateKey[i]);
var reversed = Buffer.from(message).reverse(); var reversed = Buffer.from(message).reverse();
let msgBuf = 0n; let msgBuf = 0n;
for (let i = reversed.length - 1; i >= 0; i--) for (let i = reversed.length - 1; i >= 0; i--)
msgBuf = (msgBuf << 8n) + BigInt(reversed[i]); msgBuf = (msgBuf << 8n) + BigInt(reversed[i]);
let base = msgBuf % modulusBuf, exponent = keyBuf, modulus = modulusBuf, encryptedBigInt = 1n; let base = msgBuf % modulusBuf, exponent = keyBuf, modulus = modulusBuf, encryptedBigInt = 1n;
while (exponent > 0n) { while (exponent > 0n) {
if (exponent % 2n === 1n) if (exponent % 2n === 1n)
encryptedBigInt = (encryptedBigInt * base) % modulus; encryptedBigInt = (encryptedBigInt * base) % modulus;
exponent >>= 1n; base = (base * base) % modulus; exponent >>= 1n; base = (base * base) % modulus;
} }