@ohos-ports/react-native-quick-crypto 0.0.0-stage → 1.1.8-beta.0

package/deps/blake3/c/blake3_portable.c

@@ -0,0 +1,160 @@
+#include "blake3_impl.h"
+#include <string.h>
+
+INLINE uint32_t rotr32(uint32_t w, uint32_t c) {
+  return (w >> c) | (w << (32 - c));
+}
+
+INLINE void g(uint32_t *state, size_t a, size_t b, size_t c, size_t d,
+              uint32_t x, uint32_t y) {
+  state[a] = state[a] + state[b] + x;
+  state[d] = rotr32(state[d] ^ state[a], 16);
+  state[c] = state[c] + state[d];
+  state[b] = rotr32(state[b] ^ state[c], 12);
+  state[a] = state[a] + state[b] + y;
+  state[d] = rotr32(state[d] ^ state[a], 8);
+  state[c] = state[c] + state[d];
+  state[b] = rotr32(state[b] ^ state[c], 7);
+}
+
+INLINE void round_fn(uint32_t state[16], const uint32_t *msg, size_t round) {
+  // Select the message schedule based on the round.
+  const uint8_t *schedule = MSG_SCHEDULE[round];
+
+  // Mix the columns.
+  g(state, 0, 4, 8, 12, msg[schedule[0]], msg[schedule[1]]);
+  g(state, 1, 5, 9, 13, msg[schedule[2]], msg[schedule[3]]);
+  g(state, 2, 6, 10, 14, msg[schedule[4]], msg[schedule[5]]);
+  g(state, 3, 7, 11, 15, msg[schedule[6]], msg[schedule[7]]);
+
+  // Mix the rows.
+  g(state, 0, 5, 10, 15, msg[schedule[8]], msg[schedule[9]]);
+  g(state, 1, 6, 11, 12, msg[schedule[10]], msg[schedule[11]]);
+  g(state, 2, 7, 8, 13, msg[schedule[12]], msg[schedule[13]]);
+  g(state, 3, 4, 9, 14, msg[schedule[14]], msg[schedule[15]]);
+}
+
+INLINE void compress_pre(uint32_t state[16], const uint32_t cv[8],
+                         const uint8_t block[BLAKE3_BLOCK_LEN],
+                         uint8_t block_len, uint64_t counter, uint8_t flags) {
+  uint32_t block_words[16];
+  block_words[0] = load32(block + 4 * 0);
+  block_words[1] = load32(block + 4 * 1);
+  block_words[2] = load32(block + 4 * 2);
+  block_words[3] = load32(block + 4 * 3);
+  block_words[4] = load32(block + 4 * 4);
+  block_words[5] = load32(block + 4 * 5);
+  block_words[6] = load32(block + 4 * 6);
+  block_words[7] = load32(block + 4 * 7);
+  block_words[8] = load32(block + 4 * 8);
+  block_words[9] = load32(block + 4 * 9);
+  block_words[10] = load32(block + 4 * 10);
+  block_words[11] = load32(block + 4 * 11);
+  block_words[12] = load32(block + 4 * 12);
+  block_words[13] = load32(block + 4 * 13);
+  block_words[14] = load32(block + 4 * 14);
+  block_words[15] = load32(block + 4 * 15);
+
+  state[0] = cv[0];
+  state[1] = cv[1];
+  state[2] = cv[2];
+  state[3] = cv[3];
+  state[4] = cv[4];
+  state[5] = cv[5];
+  state[6] = cv[6];
+  state[7] = cv[7];
+  state[8] = IV[0];
+  state[9] = IV[1];
+  state[10] = IV[2];
+  state[11] = IV[3];
+  state[12] = counter_low(counter);
+  state[13] = counter_high(counter);
+  state[14] = (uint32_t)block_len;
+  state[15] = (uint32_t)flags;
+
+  round_fn(state, &block_words[0], 0);
+  round_fn(state, &block_words[0], 1);
+  round_fn(state, &block_words[0], 2);
+  round_fn(state, &block_words[0], 3);
+  round_fn(state, &block_words[0], 4);
+  round_fn(state, &block_words[0], 5);
+  round_fn(state, &block_words[0], 6);
+}
+
+void blake3_compress_in_place_portable(uint32_t cv[8],
+                                       const uint8_t block[BLAKE3_BLOCK_LEN],
+                                       uint8_t block_len, uint64_t counter,
+                                       uint8_t flags) {
+  uint32_t state[16];
+  compress_pre(state, cv, block, block_len, counter, flags);
+  cv[0] = state[0] ^ state[8];
+  cv[1] = state[1] ^ state[9];
+  cv[2] = state[2] ^ state[10];
+  cv[3] = state[3] ^ state[11];
+  cv[4] = state[4] ^ state[12];
+  cv[5] = state[5] ^ state[13];
+  cv[6] = state[6] ^ state[14];
+  cv[7] = state[7] ^ state[15];
+}
+
+void blake3_compress_xof_portable(const uint32_t cv[8],
+                                  const uint8_t block[BLAKE3_BLOCK_LEN],
+                                  uint8_t block_len, uint64_t counter,
+                                  uint8_t flags, uint8_t out[64]) {
+  uint32_t state[16];
+  compress_pre(state, cv, block, block_len, counter, flags);
+
+  store32(&out[0 * 4], state[0] ^ state[8]);
+  store32(&out[1 * 4], state[1] ^ state[9]);
+  store32(&out[2 * 4], state[2] ^ state[10]);
+  store32(&out[3 * 4], state[3] ^ state[11]);
+  store32(&out[4 * 4], state[4] ^ state[12]);
+  store32(&out[5 * 4], state[5] ^ state[13]);
+  store32(&out[6 * 4], state[6] ^ state[14]);
+  store32(&out[7 * 4], state[7] ^ state[15]);
+  store32(&out[8 * 4], state[8] ^ cv[0]);
+  store32(&out[9 * 4], state[9] ^ cv[1]);
+  store32(&out[10 * 4], state[10] ^ cv[2]);
+  store32(&out[11 * 4], state[11] ^ cv[3]);
+  store32(&out[12 * 4], state[12] ^ cv[4]);
+  store32(&out[13 * 4], state[13] ^ cv[5]);
+  store32(&out[14 * 4], state[14] ^ cv[6]);
+  store32(&out[15 * 4], state[15] ^ cv[7]);
+}
+
+INLINE void hash_one_portable(const uint8_t *input, size_t blocks,
+                              const uint32_t key[8], uint64_t counter,
+                              uint8_t flags, uint8_t flags_start,
+                              uint8_t flags_end, uint8_t out[BLAKE3_OUT_LEN]) {
+  uint32_t cv[8];
+  memcpy(cv, key, BLAKE3_KEY_LEN);
+  uint8_t block_flags = flags | flags_start;
+  while (blocks > 0) {
+    if (blocks == 1) {
+      block_flags |= flags_end;
+    }
+    blake3_compress_in_place_portable(cv, input, BLAKE3_BLOCK_LEN, counter,
+                                      block_flags);
+    input = &input[BLAKE3_BLOCK_LEN];
+    blocks -= 1;
+    block_flags = flags;
+  }
+  store_cv_words(out, cv);
+}
+
+void blake3_hash_many_portable(const uint8_t *const *inputs, size_t num_inputs,
+                               size_t blocks, const uint32_t key[8],
+                               uint64_t counter, bool increment_counter,
+                               uint8_t flags, uint8_t flags_start,
+                               uint8_t flags_end, uint8_t *out) {
+  while (num_inputs > 0) {
+    hash_one_portable(inputs[0], blocks, key, counter, flags, flags_start,
+                      flags_end, out);
+    if (increment_counter) {
+      counter += 1;
+    }
+    inputs += 1;
+    num_inputs -= 1;
+    out = &out[BLAKE3_OUT_LEN];
+  }
+}

package/deps/fastpbkdf2/fastpbkdf2.c

@@ -0,0 +1,356 @@
+/*
+ * fast-pbkdf2 - Optimal PBKDF2-HMAC calculation
+ * Written in 2015 by Joseph Birr-Pixton <jpixton@gmail.com>
+ *
+ * To the extent possible under law, the author(s) have dedicated all
+ * copyright and related and neighboring rights to this software to the
+ * public domain worldwide. This software is distributed without any
+ * warranty.
+ *
+ * You should have received a copy of the CC0 Public Domain Dedication
+ * along with this software. If not, see
+ * <http://creativecommons.org/publicdomain/zero/1.0/>.
+ */
+
+#include "fastpbkdf2.h"
+
+#include <assert.h>
+#include <string.h>
+#if defined(__GNUC__)
+  #if TARGET_OS_MACCATALYST
+    #include <machine/endian.h>  // Mac Catalyst
+  #else  
+    #include <endian.h>          // iOS
+  #endif
+#endif
+
+#include <openssl/sha.h>
+
+/* --- MSVC doesn't support C99 --- */
+#ifdef _MSC_VER
+#define restrict
+#define _Pragma __pragma
+#endif
+
+/* --- Common useful things --- */
+#define MIN(a, b) ((a) > (b)) ? (b) : (a)
+
+static inline void write32_be(uint32_t n, uint8_t out[4]) {
+#if defined(__GNUC__) && __GNUC__ >= 4 && __BYTE_ORDER == __LITTLE_ENDIAN
+  *(uint32_t *)(out) = __builtin_bswap32(n);
+#else
+  out[0] = (n >> 24) & 0xff;
+  out[1] = (n >> 16) & 0xff;
+  out[2] = (n >> 8) & 0xff;
+  out[3] = n & 0xff;
+#endif
+}
+
+static inline void write64_be(uint64_t n, uint8_t out[8]) {
+#if defined(__GNUC__) && __GNUC__ >= 4 && __BYTE_ORDER == __LITTLE_ENDIAN
+  *(uint64_t *)(out) = __builtin_bswap64(n);
+#else
+  write32_be((n >> 32) & 0xffffffff, out);
+  write32_be(n & 0xffffffff, out + 4);
+#endif
+}
+
+/* --- Optional OpenMP parallelisation of consecutive blocks --- */
+#ifdef WITH_OPENMP
+#define OPENMP_PARALLEL_FOR _Pragma("omp parallel for")
+#else
+#define OPENMP_PARALLEL_FOR
+#endif
+
+/* Prepare block (of blocksz bytes) to contain md padding denoting a msg-size
+ * message (in bytes).  block has a prefix of used bytes.
+ *
+ * Message length is expressed in 32 bits (so suitable for sha1, sha256,
+ * sha512). */
+static inline void md_pad(uint8_t *block, size_t blocksz, size_t used,
+                          size_t msg) {
+  memset(block + used, 0, blocksz - used - 4);
+  block[used] = 0x80;
+  block += blocksz - 4;
+  write32_be((uint32_t)(msg * 8), block);
+}
+
+/* Internal function/type names for hash-specific things. */
+#define HMAC_CTX(_name) HMAC_ ## _name ## _ctx
+#define HMAC_INIT(_name) HMAC_ ## _name ## _init
+#define HMAC_UPDATE(_name) HMAC_ ## _name ## _update
+#define HMAC_FINAL(_name) HMAC_ ## _name ## _final
+
+#define PBKDF2_F(_name) pbkdf2_f_ ## _name
+#define PBKDF2(_name) pbkdf2_ ## _name
+
+/* This macro expands to decls for the whole implementation for a given
+ * hash function.  Arguments are:
+ *
+ * _name like 'sha1', added to symbol names
+ * _blocksz block size, in bytes
+ * _hashsz digest output, in bytes
+ * _ctx hash context type
+ * _init hash context initialisation function
+ *    args: (_ctx *c)
+ * _update hash context update function
+ *    args: (_ctx *c, const void *data, size_t ndata)
+ * _final hash context finish function
+ *    args: (void *out, _ctx *c)
+ * _xform hash context raw block update function
+ *    args: (_ctx *c, const void *data)
+ * _xcpy hash context raw copy function (only need copy hash state)
+ *    args: (_ctx * restrict out, const _ctx *restrict in)
+ * _xtract hash context state extraction
+ *    args: args (_ctx *restrict c, uint8_t *restrict out)
+ * _xxor hash context xor function (only need xor hash state)
+ *    args: (_ctx *restrict out, const _ctx *restrict in)
+ *
+ * The resulting function is named PBKDF2(_name).
+ */
+#define DECL_PBKDF2(_name, _blocksz, _hashsz, _ctx, _init, _update, _xform,    \
+                    _final, _xcpy, _xtract, _xxor)                             \
+  typedef struct {                                                             \
+    _ctx inner;                                                                \
+    _ctx outer;                                                                \
+  } HMAC_CTX(_name);                                                           \
+                                                                               \
+  static inline void HMAC_INIT(_name)(HMAC_CTX(_name) * ctx,                   \
+                                      const uint8_t *key, size_t nkey) {       \
+    /* Prepare key: */                                                         \
+    uint8_t k[_blocksz];                                                       \
+                                                                               \
+    /* Shorten long keys. */                                                   \
+    if (nkey > _blocksz) {                                                     \
+      _init(&ctx->inner);                                                      \
+      _update(&ctx->inner, key, nkey);                                         \
+      _final(k, &ctx->inner);                                                  \
+                                                                               \
+      key = k;                                                                 \
+      nkey = _hashsz;                                                          \
+    }                                                                          \
+                                                                               \
+    /* Standard doesn't cover case where blocksz < hashsz. */                  \
+    assert(nkey <= _blocksz);                                                  \
+                                                                               \
+    /* Right zero-pad short keys. */                                           \
+    if (k != key) memcpy(k, key, nkey);                                        \
+    if (_blocksz > nkey) memset(k + nkey, 0, _blocksz - nkey);                 \
+                                                                               \
+    /* Start inner hash computation */                                         \
+    uint8_t blk_inner[_blocksz];                                               \
+    uint8_t blk_outer[_blocksz];                                               \
+                                                                               \
+    for (size_t i = 0; i < _blocksz; i++) {                                    \
+      blk_inner[i] = 0x36 ^ k[i];                                              \
+      blk_outer[i] = 0x5c ^ k[i];                                              \
+    }                                                                          \
+                                                                               \
+    _init(&ctx->inner);                                                        \
+    _update(&ctx->inner, blk_inner, sizeof blk_inner);                         \
+                                                                               \
+    /* And outer. */                                                           \
+    _init(&ctx->outer);                                                        \
+    _update(&ctx->outer, blk_outer, sizeof blk_outer);                         \
+  }                                                                            \
+                                                                               \
+  static inline void HMAC_UPDATE(_name)(HMAC_CTX(_name) * ctx,                 \
+                                        const void *data, size_t ndata) {      \
+    _update(&ctx->inner, data, ndata);                                         \
+  }                                                                            \
+                                                                               \
+  static inline void HMAC_FINAL(_name)(HMAC_CTX(_name) * ctx,                  \
+                                       uint8_t out[_hashsz]) {                 \
+    _final(out, &ctx->inner);                                                  \
+    _update(&ctx->outer, out, _hashsz);                                        \
+    _final(out, &ctx->outer);                                                  \
+  }                                                                            \
+                                                                               \
+  /* --- PBKDF2 --- */                                                         \
+  static inline void PBKDF2_F(_name)(                                          \
+    const HMAC_CTX(_name) * startctx, uint32_t counter, const uint8_t *salt, \
+    size_t nsalt, uint32_t iterations, uint8_t *out) {                       \
+    uint8_t countbuf[4];                                                       \
+    write32_be(counter, countbuf);                                             \
+                                                                               \
+    /* Prepare loop-invariant padding block. */                                \
+    uint8_t Ublock[_blocksz];                                                  \
+    md_pad(Ublock, _blocksz, _hashsz, _blocksz + _hashsz);                     \
+                                                                               \
+    /* First iteration: \
+     *   U_1 = PRF(P, S || INT_32_BE(i)) \
+     */                                                                        \
+    HMAC_CTX(_name) ctx = *startctx;                                           \
+    HMAC_UPDATE(_name)(&ctx, salt, nsalt);                                     \
+    HMAC_UPDATE(_name)(&ctx, countbuf, sizeof countbuf);                       \
+    HMAC_FINAL(_name)(&ctx, Ublock);                                           \
+    _ctx result = ctx.outer;                                                   \
+                                                                               \
+    /* Subsequent iterations: \
+     *   U_c = PRF(P, U_{c-1}) \
+     */                                                                        \
+    for (uint32_t i = 1; i < iterations; i++) {                                \
+      /* Complete inner hash with previous U */                                \
+      _xcpy(&ctx.inner, &startctx->inner);                                     \
+      _xform(&ctx.inner, Ublock);                                              \
+      _xtract(&ctx.inner, Ublock);                                             \
+      /* Complete outer hash with inner output */                              \
+      _xcpy(&ctx.outer, &startctx->outer);                                     \
+      _xform(&ctx.outer, Ublock);                                              \
+      _xtract(&ctx.outer, Ublock);                                             \
+      _xxor(&result, &ctx.outer);                                              \
+    }                                                                          \
+                                                                               \
+    /* Reform result into output buffer. */                                    \
+    _xtract(&result, out);                                                     \
+  }                                                                            \
+                                                                               \
+  static inline void PBKDF2(_name)(                                            \
+    const uint8_t *pw, size_t npw, const uint8_t *salt, size_t nsalt,        \
+    uint32_t iterations, uint8_t *out, size_t nout) {                        \
+    assert(iterations);                                                        \
+    assert(out &&nout);                                                        \
+                                                                               \
+    /* Starting point for inner loop. */                                       \
+    HMAC_CTX(_name) ctx;                                                       \
+    HMAC_INIT(_name)(&ctx, pw, npw);                                           \
+                                                                               \
+    /* How many blocks do we need? */                                          \
+    uint32_t blocks_needed = (uint32_t)(nout + _hashsz - 1) / _hashsz;         \
+                                                                               \
+    OPENMP_PARALLEL_FOR                                                        \
+    for (uint32_t counter = 1; counter <= blocks_needed; counter++) {          \
+      uint8_t block[_hashsz];                                                  \
+      PBKDF2_F(_name)(&ctx, counter, salt, nsalt, iterations, block);          \
+                                                                               \
+      size_t offset = (counter - 1) * _hashsz;                                 \
+      size_t taken = MIN(nout - offset, _hashsz);                              \
+      memcpy(out + offset, block, taken);                                      \
+    }                                                                          \
+  }
+
+static inline void sha1_extract(SHA_CTX *restrict ctx, uint8_t *restrict out) {
+  write32_be(ctx->h0, out);
+  write32_be(ctx->h1, out + 4);
+  write32_be(ctx->h2, out + 8);
+  write32_be(ctx->h3, out + 12);
+  write32_be(ctx->h4, out + 16);
+}
+
+static inline void sha1_cpy(SHA_CTX *restrict out, const SHA_CTX *restrict in) {
+  out->h0 = in->h0;
+  out->h1 = in->h1;
+  out->h2 = in->h2;
+  out->h3 = in->h3;
+  out->h4 = in->h4;
+}
+
+static inline void sha1_xor(SHA_CTX *restrict out, const SHA_CTX *restrict in) {
+  out->h0 ^= in->h0;
+  out->h1 ^= in->h1;
+  out->h2 ^= in->h2;
+  out->h3 ^= in->h3;
+  out->h4 ^= in->h4;
+}
+
+DECL_PBKDF2(sha1, SHA_CBLOCK, SHA_DIGEST_LENGTH, SHA_CTX, SHA1_Init,
+            SHA1_Update, SHA1_Transform, SHA1_Final, sha1_cpy, sha1_extract,
+            sha1_xor)
+
+static inline void sha256_extract(SHA256_CTX *restrict ctx,
+                                  uint8_t *restrict out) {
+  write32_be(ctx->h[0], out);
+  write32_be(ctx->h[1], out + 4);
+  write32_be(ctx->h[2], out + 8);
+  write32_be(ctx->h[3], out + 12);
+  write32_be(ctx->h[4], out + 16);
+  write32_be(ctx->h[5], out + 20);
+  write32_be(ctx->h[6], out + 24);
+  write32_be(ctx->h[7], out + 28);
+}
+
+static inline void sha256_cpy(SHA256_CTX *restrict out,
+                              const SHA256_CTX *restrict in) {
+  out->h[0] = in->h[0];
+  out->h[1] = in->h[1];
+  out->h[2] = in->h[2];
+  out->h[3] = in->h[3];
+  out->h[4] = in->h[4];
+  out->h[5] = in->h[5];
+  out->h[6] = in->h[6];
+  out->h[7] = in->h[7];
+}
+
+static inline void sha256_xor(SHA256_CTX *restrict out,
+                              const SHA256_CTX *restrict in) {
+  out->h[0] ^= in->h[0];
+  out->h[1] ^= in->h[1];
+  out->h[2] ^= in->h[2];
+  out->h[3] ^= in->h[3];
+  out->h[4] ^= in->h[4];
+  out->h[5] ^= in->h[5];
+  out->h[6] ^= in->h[6];
+  out->h[7] ^= in->h[7];
+}
+
+DECL_PBKDF2(sha256, SHA256_CBLOCK, SHA256_DIGEST_LENGTH, SHA256_CTX,
+            SHA256_Init, SHA256_Update, SHA256_Transform, SHA256_Final,
+            sha256_cpy, sha256_extract, sha256_xor)
+
+static inline void sha512_extract(SHA512_CTX *restrict ctx,
+                                  uint8_t *restrict out) {
+  write64_be(ctx->h[0], out);
+  write64_be(ctx->h[1], out + 8);
+  write64_be(ctx->h[2], out + 16);
+  write64_be(ctx->h[3], out + 24);
+  write64_be(ctx->h[4], out + 32);
+  write64_be(ctx->h[5], out + 40);
+  write64_be(ctx->h[6], out + 48);
+  write64_be(ctx->h[7], out + 56);
+}
+
+static inline void sha512_cpy(SHA512_CTX *restrict out,
+                              const SHA512_CTX *restrict in) {
+  out->h[0] = in->h[0];
+  out->h[1] = in->h[1];
+  out->h[2] = in->h[2];
+  out->h[3] = in->h[3];
+  out->h[4] = in->h[4];
+  out->h[5] = in->h[5];
+  out->h[6] = in->h[6];
+  out->h[7] = in->h[7];
+}
+
+static inline void sha512_xor(SHA512_CTX *restrict out,
+                              const SHA512_CTX *restrict in) {
+  out->h[0] ^= in->h[0];
+  out->h[1] ^= in->h[1];
+  out->h[2] ^= in->h[2];
+  out->h[3] ^= in->h[3];
+  out->h[4] ^= in->h[4];
+  out->h[5] ^= in->h[5];
+  out->h[6] ^= in->h[6];
+  out->h[7] ^= in->h[7];
+}
+
+DECL_PBKDF2(sha512, SHA512_CBLOCK, SHA512_DIGEST_LENGTH, SHA512_CTX,
+            SHA512_Init, SHA512_Update, SHA512_Transform, SHA512_Final,
+            sha512_cpy, sha512_extract, sha512_xor)
+
+void fastpbkdf2_hmac_sha1(const uint8_t *pw, size_t npw, const uint8_t *salt,
+                          size_t nsalt, uint32_t iterations, uint8_t *out,
+                          size_t nout) {
+  PBKDF2(sha1)(pw, npw, salt, nsalt, iterations, out, nout);
+}
+
+void fastpbkdf2_hmac_sha256(const uint8_t *pw, size_t npw, const uint8_t *salt,
+                            size_t nsalt, uint32_t iterations, uint8_t *out,
+                            size_t nout) {
+  PBKDF2(sha256)(pw, npw, salt, nsalt, iterations, out, nout);
+}
+
+void fastpbkdf2_hmac_sha512(const uint8_t *pw, size_t npw, const uint8_t *salt,
+                            size_t nsalt, uint32_t iterations, uint8_t *out,
+                            size_t nout) {
+  PBKDF2(sha512)(pw, npw, salt, nsalt, iterations, out, nout);
+}

package/deps/fastpbkdf2/fastpbkdf2.h

@@ -0,0 +1,68 @@
+/*
+ * fastpbkdf2 - Faster PBKDF2-HMAC calculation
+ * Written in 2015 by Joseph Birr-Pixton <jpixton@gmail.com>
+ *
+ * To the extent possible under law, the author(s) have dedicated all
+ * copyright and related and neighboring rights to this software to the
+ * public domain worldwide. This software is distributed without any
+ * warranty.
+ *
+ * You should have received a copy of the CC0 Public Domain Dedication
+ * along with this software. If not, see
+ * <http://creativecommons.org/publicdomain/zero/1.0/>.
+ */
+
+#ifndef FASTPBKDF2_H
+#define FASTPBKDF2_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** Calculates PBKDF2-HMAC-SHA1.
+ *
+ *  @p npw bytes at @p pw are the password input.
+ *  @p nsalt bytes at @p salt are the salt input.
+ *  @p iterations is the PBKDF2 iteration count and must be non-zero.
+ *  @p nout bytes of output are written to @p out.  @p nout must be non-zero.
+ *
+ *  This function cannot fail; it does not report errors.
+ */
+void fastpbkdf2_hmac_sha1(const uint8_t *pw, size_t npw, const uint8_t *salt,
+                          size_t nsalt, uint32_t iterations, uint8_t *out,
+                          size_t nout);
+
+/** Calculates PBKDF2-HMAC-SHA256.
+ *
+ *  @p npw bytes at @p pw are the password input.
+ *  @p nsalt bytes at @p salt are the salt input.
+ *  @p iterations is the PBKDF2 iteration count and must be non-zero.
+ *  @p nout bytes of output are written to @p out.  @p nout must be non-zero.
+ *
+ *  This function cannot fail; it does not report errors.
+ */
+void fastpbkdf2_hmac_sha256(const uint8_t *pw, size_t npw, const uint8_t *salt,
+                            size_t nsalt, uint32_t iterations, uint8_t *out,
+                            size_t nout);
+
+/** Calculates PBKDF2-HMAC-SHA512.
+ *
+ *  @p npw bytes at @p pw are the password input.
+ *  @p nsalt bytes at @p salt are the salt input.
+ *  @p iterations is the PBKDF2 iteration count and must be non-zero.
+ *  @p nout bytes of output are written to @p out.  @p nout must be non-zero.
+ *
+ *  This function cannot fail; it does not report errors.
+ */
+void fastpbkdf2_hmac_sha512(const uint8_t *pw, size_t npw, const uint8_t *salt,
+                            size_t nsalt, uint32_t iterations, uint8_t *out,
+                            size_t nout);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif

package/deps/ncrypto/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Node.js
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/deps/ncrypto/README.md

@@ -0,0 +1,18 @@
+# Node.js crypto (ncrypto) library
+
+The `ncrypto` library extracts the base internal implementation of Node.js crypto operations
+that support both `node:crypto` and Web Crypto implementations and makes them available for
+use in other projects that need to emulate Node.js' behavior.
+
+## Compatibility
+
+* Build systems: `ncrypto` can be built with either Bazel or CMake.
+* SSL libraries: `ncrypto` supports linking to either `boringssl` or `openssl`.
+
+## Build flags
+
+* Bazel: `--@ncrypto//:bssl_libdecrepit_missing=True` 
+* CMake: `-DNCRYPTO_BSSL_LIBDECREPIT_MISSING=1`
+
+If linking against `boringssl`, libdecrepit is an optional component that isn't always built. If
+this option is set, `ncrypto` will use a built-in replacement for the missing functions.