UNPKG

@hpke/chacha20poly1305

Version:

A Hybrid Public Key Encryption (HPKE) module extension for ChaCha20/Poly1305

218 lines (217 loc) 9.73 kB
/** * This file is based on noble-ciphers (https://github.com/paulmillr/noble-ciphers). * * noble-ciphers - MIT License (c) 2023 Paul Miller (paulmillr.com) * * The original file is located at: * https://github.com/paulmillr/noble-ciphers/blob/749cdf9cd07ebdd19e9b957d0f172f1045179695/src/chacha.ts */ (function (factory) { if (typeof module === "object" && typeof module.exports === "object") { var v = factory(require, exports); if (v !== undefined) module.exports = v; } else if (typeof define === "function" && define.amd) { define(["require", "exports", "./_arx.js", "./_poly1305.js", "./utils.js"], factory); } })(function (require, exports) { "use strict"; Object.defineProperty(exports, "__esModule", { value: true }); exports.chacha20poly1305 = exports._poly1305_aead = exports.chacha20 = void 0; /** * ChaCha stream cipher, released * in 2008. Developed after Salsa20, ChaCha aims to increase diffusion per round. * It was standardized in [RFC 8439](https://www.rfc-editor.org/rfc/rfc8439) and * is now used in TLS 1.3. * * [XChaCha20](https://datatracker.ietf.org/doc/html/draft-irtf-cfrg-xchacha) * extended-nonce variant is also provided. Similar to XSalsa, it's safe to use with * randomly-generated nonces. * * Check out [PDF](http://cr.yp.to/chacha/chacha-20080128.pdf) and * [wiki](https://en.wikipedia.org/wiki/Salsa20) and * [website](https://cr.yp.to/chacha.html). * * @module */ const _arx_js_1 = require("./_arx.js"); const _poly1305_js_1 = require("./_poly1305.js"); const utils_js_1 = require("./utils.js"); /** * ChaCha core function. It is implemented twice: * 1. Simple loop (chachaCore_small, hchacha_small) * 2. Unrolled loop (chachaCore, hchacha) - 4x faster, but larger & harder to read * The specific implementation is selected in `createCipher` below. */ function chachaCore(s, k, n, out, cnt, rounds = 20) { const y00 = s[0], y01 = s[1], y02 = s[2], y03 = s[3], // "expa" "nd 3" "2-by" "te k" y04 = k[0], y05 = k[1], y06 = k[2], y07 = k[3], // Key Key Key Key y08 = k[4], y09 = k[5], y10 = k[6], y11 = k[7], // Key Key Key Key y12 = cnt, y13 = n[0], y14 = n[1], y15 = n[2]; // Counter Counter Nonce Nonce // Save state to temporary variables let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15; for (let r = 0; r < rounds; r += 2) { x00 = (x00 + x04) | 0; x12 = (0, _arx_js_1.rotl)(x12 ^ x00, 16); x08 = (x08 + x12) | 0; x04 = (0, _arx_js_1.rotl)(x04 ^ x08, 12); x00 = (x00 + x04) | 0; x12 = (0, _arx_js_1.rotl)(x12 ^ x00, 8); x08 = (x08 + x12) | 0; x04 = (0, _arx_js_1.rotl)(x04 ^ x08, 7); x01 = (x01 + x05) | 0; x13 = (0, _arx_js_1.rotl)(x13 ^ x01, 16); x09 = (x09 + x13) | 0; x05 = (0, _arx_js_1.rotl)(x05 ^ x09, 12); x01 = (x01 + x05) | 0; x13 = (0, _arx_js_1.rotl)(x13 ^ x01, 8); x09 = (x09 + x13) | 0; x05 = (0, _arx_js_1.rotl)(x05 ^ x09, 7); x02 = (x02 + x06) | 0; x14 = (0, _arx_js_1.rotl)(x14 ^ x02, 16); x10 = (x10 + x14) | 0; x06 = (0, _arx_js_1.rotl)(x06 ^ x10, 12); x02 = (x02 + x06) | 0; x14 = (0, _arx_js_1.rotl)(x14 ^ x02, 8); x10 = (x10 + x14) | 0; x06 = (0, _arx_js_1.rotl)(x06 ^ x10, 7); x03 = (x03 + x07) | 0; x15 = (0, _arx_js_1.rotl)(x15 ^ x03, 16); x11 = (x11 + x15) | 0; x07 = (0, _arx_js_1.rotl)(x07 ^ x11, 12); x03 = (x03 + x07) | 0; x15 = (0, _arx_js_1.rotl)(x15 ^ x03, 8); x11 = (x11 + x15) | 0; x07 = (0, _arx_js_1.rotl)(x07 ^ x11, 7); x00 = (x00 + x05) | 0; x15 = (0, _arx_js_1.rotl)(x15 ^ x00, 16); x10 = (x10 + x15) | 0; x05 = (0, _arx_js_1.rotl)(x05 ^ x10, 12); x00 = (x00 + x05) | 0; x15 = (0, _arx_js_1.rotl)(x15 ^ x00, 8); x10 = (x10 + x15) | 0; x05 = (0, _arx_js_1.rotl)(x05 ^ x10, 7); x01 = (x01 + x06) | 0; x12 = (0, _arx_js_1.rotl)(x12 ^ x01, 16); x11 = (x11 + x12) | 0; x06 = (0, _arx_js_1.rotl)(x06 ^ x11, 12); x01 = (x01 + x06) | 0; x12 = (0, _arx_js_1.rotl)(x12 ^ x01, 8); x11 = (x11 + x12) | 0; x06 = (0, _arx_js_1.rotl)(x06 ^ x11, 7); x02 = (x02 + x07) | 0; x13 = (0, _arx_js_1.rotl)(x13 ^ x02, 16); x08 = (x08 + x13) | 0; x07 = (0, _arx_js_1.rotl)(x07 ^ x08, 12); x02 = (x02 + x07) | 0; x13 = (0, _arx_js_1.rotl)(x13 ^ x02, 8); x08 = (x08 + x13) | 0; x07 = (0, _arx_js_1.rotl)(x07 ^ x08, 7); x03 = (x03 + x04) | 0; x14 = (0, _arx_js_1.rotl)(x14 ^ x03, 16); x09 = (x09 + x14) | 0; x04 = (0, _arx_js_1.rotl)(x04 ^ x09, 12); x03 = (x03 + x04) | 0; x14 = (0, _arx_js_1.rotl)(x14 ^ x03, 8); x09 = (x09 + x14) | 0; x04 = (0, _arx_js_1.rotl)(x04 ^ x09, 7); } // Write output let oi = 0; out[oi++] = (y00 + x00) | 0; out[oi++] = (y01 + x01) | 0; out[oi++] = (y02 + x02) | 0; out[oi++] = (y03 + x03) | 0; out[oi++] = (y04 + x04) | 0; out[oi++] = (y05 + x05) | 0; out[oi++] = (y06 + x06) | 0; out[oi++] = (y07 + x07) | 0; out[oi++] = (y08 + x08) | 0; out[oi++] = (y09 + x09) | 0; out[oi++] = (y10 + x10) | 0; out[oi++] = (y11 + x11) | 0; out[oi++] = (y12 + x12) | 0; out[oi++] = (y13 + x13) | 0; out[oi++] = (y14 + x14) | 0; out[oi++] = (y15 + x15) | 0; } /** * ChaCha stream cipher. Conforms to RFC 8439 (IETF, TLS). 12-byte nonce, 4-byte counter. * With smaller nonce, it's not safe to make it random (CSPRNG), due to collision chance. */ exports.chacha20 = (0, _arx_js_1.createCipher)(chachaCore, { counterRight: false, counterLength: 4, allowShortKeys: false, }); const ZEROS16 = /* @__PURE__ */ new Uint8Array(16); // Pad to digest size with zeros const updatePadded = (h, msg) => { h.update(msg); const leftover = msg.length % 16; if (leftover) h.update(ZEROS16.subarray(leftover)); }; const ZEROS32 = /* @__PURE__ */ new Uint8Array(32); function computeTag(fn, key, nonce, ciphertext, AAD) { if (AAD !== undefined) (0, utils_js_1.abytes)(AAD, undefined, "AAD"); const authKey = fn(key, nonce, ZEROS32); const lengths = (0, utils_js_1.u64Lengths)(ciphertext.length, AAD ? AAD.length : 0, true); // Methods below can be replaced with // return poly1305_computeTag_small(authKey, lengths, ciphertext, AAD) const h = _poly1305_js_1.poly1305.create(authKey); if (AAD) updatePadded(h, AAD); updatePadded(h, ciphertext); h.update(lengths); const res = h.digest(); (0, utils_js_1.clean)(authKey, lengths); return res; } /** * AEAD algorithm from RFC 8439. * Salsa20 and chacha (RFC 8439) use poly1305 differently. * We could have composed them, but it's hard because of authKey: * In salsa20, authKey changes position in salsa stream. * In chacha, authKey can't be computed inside computeTag, it modifies the counter. */ const _poly1305_aead = (xorStream) => (key, nonce, AAD) => { const tagLength = 16; return { encrypt(plaintext, output) { const plength = plaintext.length; output = (0, utils_js_1.getOutput)(plength + tagLength, output, false); output.set(plaintext); const oPlain = output.subarray(0, -tagLength); // Actual encryption xorStream(key, nonce, oPlain, oPlain, 1); const tag = computeTag(xorStream, key, nonce, oPlain, AAD); output.set(tag, plength); // append tag (0, utils_js_1.clean)(tag); return output; }, decrypt(ciphertext, output) { output = (0, utils_js_1.getOutput)(ciphertext.length - tagLength, output, false); const data = ciphertext.subarray(0, -tagLength); const passedTag = ciphertext.subarray(-tagLength); const tag = computeTag(xorStream, key, nonce, data, AAD); if (!(0, utils_js_1.equalBytes)(passedTag, tag)) throw new Error("invalid tag"); output.set(ciphertext.subarray(0, -tagLength)); // Actual decryption xorStream(key, nonce, output, output, 1); // start stream with i=1 (0, utils_js_1.clean)(tag); return output; }, }; }; exports._poly1305_aead = _poly1305_aead; /** * ChaCha20-Poly1305 from RFC 8439. * * Unsafe to use random nonces under the same key, due to collision chance. * Prefer XChaCha instead. */ exports.chacha20poly1305 = (0, utils_js_1.wrapCipher)({ blockSize: 64, nonceLength: 12, tagLength: 16 }, (0, exports._poly1305_aead)(exports.chacha20)); });