서명을 계산하기 위한 코드 단계를 만들었습니다. Web Crypto API를 사용하면 HMAC-SHA256을 훨씬 쉽게 계산할 수 있지만, 이는 Promise를 사용하므로 eval 내부에서는 작동하지 않습니다. 그래서 AI에게 HMAC-SHA256을 계산하는 네이티브 JavaScript 메서드를 만들어 달라고 요청했고, 키 secret와 그 값인 시크릿을 변수로 추가하여 다음과 같은 코드 스크립트를 작성했습니다:
// Available variables:
// $input.item.json - current item's JSON data
// $input.all() - array of all input items
// $json - shortcut for $input.item.json
// $("NodeName").item - access the paired item from another node
// $vars.KEY - workflow variables
// $site_settings.NAME - site settings
// $execution - execution metadata (id, workflow_name, ...)
// $current_user - user running the workflow
// $helpers.absoluteUrl(path) - convert a relative path to an absolute URL
// console.log/warn/error - logging
function hmacSha256(message, key) {
function utf8Bytes(str) {
const bytes = [];
for (let i = 0; i < str.length; i++) {
let code = str.charCodeAt(i);
// Handle surrogate pairs
if (
code >= 0xd800 &&
code <= 0xdbff &&
i + 1 < str.length
) {
const next = str.charCodeAt(i + 1);
if (next >= 0xdc00 && next <= 0xdfff) {
code =
0x10000 +
((code - 0xd800) << 10) +
(next - 0xdc00);
i++;
}
}
if (code <= 0x7f) {
bytes.push(code);
} else if (code <= 0x7ff) {
bytes.push(
0xc0 | (code >> 6),
0x80 | (code & 0x3f)
);
} else if (code <= 0xffff) {
bytes.push(
0xe0 | (code >> 12),
0x80 | ((code >> 6) & 0x3f),
0x80 | (code & 0x3f)
);
} else {
bytes.push(
0xf0 | (code >> 18),
0x80 | ((code >> 12) & 0x3f),
0x80 | ((code >> 6) & 0x3f),
0x80 | (code & 0x3f)
);
}
}
return bytes;
}
function rotr(x, n) {
return (x >>> n) | (x << (32 - n));
}
function sha256(bytes) {
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
];
const H = [
0x6a09e667,
0xbb67ae85,
0x3c6ef372,
0xa54ff53a,
0x510e527f,
0x9b05688c,
0x1f83d9ab,
0x5be0cd19
];
const data = bytes.slice();
const bitLength = data.length * 8;
// SHA-256 padding
data.push(0x80);
while ((data.length % 64) !== 56) {
data.push(0);
}
// Append 64-bit big-endian message length.
// JS integers are safe here for normal workflow payload sizes.
const high = Math.floor(bitLength / 0x100000000);
const low = bitLength >>> 0;
data.push(
(high >>> 24) & 0xff,
(high >>> 16) & 0xff,
(high >>> 8) & 0xff,
high & 0xff,
(low >>> 24) & 0xff,
(low >>> 16) & 0xff,
(low >>> 8) & 0xff,
low & 0xff
);
const w = new Array(64);
for (let offset = 0; offset < data.length; offset += 64) {
for (let i = 0; i < 16; i++) {
const j = offset + i * 4;
w[i] =
((data[j] << 24) |
(data[j + 1] << 16) |
(data[j + 2] << 8) |
data[j + 3]) >>> 0;
}
for (let i = 16; i < 64; i++) {
const s0 =
rotr(w[i - 15], 7) ^
rotr(w[i - 15], 18) ^
(w[i - 15] >>> 3);
const s1 =
rotr(w[i - 2], 17) ^
rotr(w[i - 2], 19) ^
(w[i - 2] >>> 10);
w[i] =
(
w[i - 16] +
s0 +
w[i - 7] +
s1
) >>> 0;
}
let a = H[0];
let b = H[1];
let c = H[2];
let d = H[3];
let e = H[4];
let f = H[5];
let g = H[6];
let h = H[7];
for (let i = 0; i < 64; i++) {
const S1 =
rotr(e, 6) ^
rotr(e, 11) ^
rotr(e, 25);
const ch = (e & f) ^ (~e & g);
const temp1 =
(
h +
S1 +
ch +
K[i] +
w[i]
) >>> 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;
}
const result = [];
for (let i = 0; i < H.length; i++) {
result.push(
(H[i] >>> 24) & 0xff,
(H[i] >>> 16) & 0xff,
(H[i] >>> 8) & 0xff,
H[i] & 0xff
);
}
return result;
}
function bytesToHex(bytes) {
return bytes
.map(b => b.toString(16).padStart(2, "0"))
.join("");
}
const blockSize = 64;
let keyBytes = utf8Bytes(key);
const messageBytes = utf8Bytes(message);
// Keys longer than the SHA-256 block size are first hashed.
if (keyBytes.length > blockSize) {
keyBytes = sha256(keyBytes);
}
// Pad key to 64 bytes.
while (keyBytes.length < blockSize) {
keyBytes.push(0);
}
const innerPad = new Array(blockSize);
const outerPad = new Array(blockSize);
for (let i = 0; i < blockSize; i++) {
innerPad[i] = keyBytes[i] ^ 0x36;
outerPad[i] = keyBytes[i] ^ 0x5c;
}
const innerHash = sha256(
innerPad.concat(messageBytes)
);
const hmac = sha256(
outerPad.concat(innerHash)
);
return bytesToHex(hmac);
}
const payload = JSON.stringify({
"the-json-payload": "goes-here"
});
const signature = "sha256=" + hmacSha256( payload, $vars.secret);
return {
"payload": payload,
"signature": signature
};
그다음 키가 X-Discourse-Workflow-Signature이고 값이 {{ $("Code").item.json.signature }}인 헤더, 콘텐츠 타입 JSON, 그리고 요청 본문이 {{ $("Code").item.json.payload }}인 HTTP 요청 단계가 이어집니다.
그 결과 다음과 같은 HTTP 요청이 생성됩니다:
User-Agent: Faraday v2.14.4
Content-Length: 41
Accept: */*
Accept-Encoding: gzip;q=1.0,deflate;q=0.6,identity;q=0.3
Content-Type: application/json
X-Discourse-Workflow-Signature: sha256=9ad2820b545013bdd18d4e7e6139624b91f576498e528201fa7759ec58dd598c
{"the-json-payload": "goes-here"}
X-Discourse-Workflow-Secret은 secret 인자의 값을 사용한 HMAC-SHA256 서명입니다… 서명된 웹훅과 정확히 같은 방식이죠! 
아름답지는 않지만, 작동하는 것 같습니다.
업데이트: 웹훅 서명의 스타일에 맞게 서명 앞에 sha256= 접두사를 추가했습니다.
