[JavaScript] 纯文本查看 复制代码
function sha256(message) {
// 初始化常量
const K = [
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
];
// 初始化哈希值
let H = [
0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
];
// 1. 预处理:填充消息
// 将消息转换为UTF-8编码的字节数组
const msgBytes = new TextEncoder().encode(message);
const bitLen = msgBytes.length * 8;
// 添加填充位:1 + 0...0 + 64位原始长度
const paddedLen = Math.ceil((bitLen + 65) / 512) * 512;
const totalBytes = paddedLen / 8;
const padded = new Uint8Array(totalBytes);
// 复制原始消息
padded.set(msgBytes, 0);
// 添加1位 (0x80)
padded[msgBytes.length] = 0x80;
// 添加64位长度(大端序)
const lenBytes = new DataView(new ArrayBuffer(8));
lenBytes.setBigUint64(0, BigInt(bitLen), false);
for (let i = 0; i < 8; i++) {
padded[totalBytes - 8 + i] = lenBytes.getUint8(i);
}
// 2. 处理每个512位块
for (let i = 0; i < totalBytes; i += 64) {
const chunk = padded.slice(i, i + 64);
// 创建消息调度数组W[0..63]
const W = new Array(64);
for (let t = 0; t < 16; t++) {
W[t] = (
(chunk[t*4] << 24) |
(chunk[t*4+1] << 16) |
(chunk[t*4+2] << 8) |
(chunk[t*4+3])
) >>> 0;
}
for (let t = 16; t < 64; t++) {
const s0 = rotr(W[t-15], 7) ^ rotr(W[t-15], 18) ^ (W[t-15] >>> 3);
const s1 = rotr(W[t-2], 17) ^ rotr(W[t-2], 19) ^ (W[t-2] >>> 10);
W[t] = (W[t-16] + s0 + W[t-7] + s1) >>> 0;
}
// 初始化工作变量
let [a, b, c, d, e, f, g, h] = H;
// 主循环
for (let t = 0; t < 64; t++) {
const S1 = rotr(e, 6) ^ rotr(e, 11) ^ rotr(e, 25);
const ch = (e & f) ^ (~e & g);
const temp1 = (h + S1 + ch + K[t] + W[t]) >>> 0;
const S0 = rotr(a, 2) ^ rotr(a, 13) ^ rotr(a, 22);
const maj = (a & b) ^ (a & c) ^ (b & c);
const temp2 = (S0 + maj) >>> 0;
h = g;
g = f;
f = e;
e = (d + temp1) >>> 0;
d = c;
c = b;
b = a;
a = (temp1 + temp2) >>> 0;
}
// 计算中间哈希值
H[0] = (H[0] + a) >>> 0;
H[1] = (H[1] + b) >>> 0;
H[2] = (H[2] + c) >>> 0;
H[3] = (H[3] + d) >>> 0;
H[4] = (H[4] + e) >>> 0;
H[5] = (H[5] + f) >>> 0;
H[6] = (H[6] + g) >>> 0;
H[7] = (H[7] + h) >>> 0;
}
// 3. 生成最终哈希值
const hashArray = H.map(h => [
(h >> 24) & 0xff,
(h >> 16) & 0xff,
(h >> 8) & 0xff,
h & 0xff
]).flat();
// 转换为十六进制字符串
return Array.from(hashArray)
.map(b => b.toString(16).padStart(2, '0'))
.join('');
}
// 辅助函数:循环右移
function rotr(x, n) {
return (x >>> n) | (x << (32 - n));
}
const challenge = "ab6d5e49b6dd31a54742084884df6c8e:1755307710"
let _0x51b559 = ''
let _0x4c59d9 = -1
do{
_0x4c59d9++;
const _0x1deb90 = challenge + '\x3a' + _0x4c59d9
_0x51b559 = sha256(_0x1deb90)
}while(!_0x51b559.startsWith('0000'));
console.log(_0x4c59d9)