@hxa-rn/react-native-quick-crypto 1.1.0-beta.1

package/harmony/quick_crypto/deps/blake3/main.c

@@ -0,0 +1,166 @@
+/*
+ * This main file is intended for testing via `make test`. It does not build in
+ * other settings. See README.md in this directory for examples of how to build
+ * C code.
+ */
+
+#include <assert.h>
+#include <errno.h>
+#include <stdbool.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "blake3.h"
+#include "blake3_impl.h"
+
+#define HASH_MODE 0
+#define KEYED_HASH_MODE 1
+#define DERIVE_KEY_MODE 2
+
+static void hex_char_value(uint8_t c, uint8_t *value, bool *valid) {
+  if ('0' <= c && c <= '9') {
+    *value = c - '0';
+    *valid = true;
+  } else if ('a' <= c && c <= 'f') {
+    *value = 10 + c - 'a';
+    *valid = true;
+  } else {
+    *valid = false;
+  }
+}
+
+static int parse_key(char *hex_key, uint8_t out[BLAKE3_KEY_LEN]) {
+  size_t hex_len = strlen(hex_key);
+  if (hex_len != 64) {
+    fprintf(stderr, "Expected a 64-char hexadecimal key, got %zu chars.\n",
+            hex_len);
+    return 1;
+  }
+  for (size_t i = 0; i < 64; i++) {
+    uint8_t value;
+    bool valid;
+    hex_char_value(hex_key[i], &value, &valid);
+    if (!valid) {
+      fprintf(stderr, "Invalid hex char.\n");
+      return 1;
+    }
+    if (i % 2 == 0) {
+      out[i / 2] = 0;
+      value <<= 4;
+    }
+    out[i / 2] += value;
+  }
+  return 0;
+}
+
+/* A little repetition here */
+enum cpu_feature {
+  SSE2 = 1 << 0,
+  SSSE3 = 1 << 1,
+  SSE41 = 1 << 2,
+  AVX = 1 << 3,
+  AVX2 = 1 << 4,
+  AVX512F = 1 << 5,
+  AVX512VL = 1 << 6,
+  /* ... */
+  UNDEFINED = 1 << 30
+};
+
+extern enum cpu_feature g_cpu_features;
+enum cpu_feature get_cpu_features(void);
+
+int main(int argc, char **argv) {
+  size_t out_len = BLAKE3_OUT_LEN;
+  uint8_t key[BLAKE3_KEY_LEN];
+  char *context = "";
+  uint8_t mode = HASH_MODE;
+  while (argc > 1) {
+    if (argc <= 2) {
+      fprintf(stderr, "Odd number of arguments.\n");
+      return 1;
+    }
+    if (strcmp("--length", argv[1]) == 0) {
+      char *endptr = NULL;
+      errno = 0;
+      unsigned long long out_len_ll = strtoull(argv[2], &endptr, 10);
+      if (errno != 0 || out_len_ll > SIZE_MAX || endptr == argv[2] ||
+          *endptr != 0) {
+        fprintf(stderr, "Bad length argument.\n");
+        return 1;
+      }
+      out_len = (size_t)out_len_ll;
+    } else if (strcmp("--keyed", argv[1]) == 0) {
+      mode = KEYED_HASH_MODE;
+      int ret = parse_key(argv[2], key);
+      if (ret != 0) {
+        return ret;
+      }
+    } else if (strcmp("--derive-key", argv[1]) == 0) {
+      mode = DERIVE_KEY_MODE;
+      context = argv[2];
+    } else {
+      fprintf(stderr, "Unknown flag.\n");
+      return 1;
+    }
+    argc -= 2;
+    argv += 2;
+  }
+
+  /*
+   * We're going to hash the input multiple times, so we need to buffer it all.
+   * This is just for test cases, so go ahead and assume that the input is less
+   * than 1 MiB.
+   */
+  size_t buf_capacity = 1 << 20;
+  uint8_t *buf = malloc(buf_capacity);
+  assert(buf != NULL);
+  size_t buf_len = 0;
+  while (1) {
+    size_t n = fread(&buf[buf_len], 1, buf_capacity - buf_len, stdin);
+    if (n == 0) {
+      break;
+    }
+    buf_len += n;
+    assert(buf_len < buf_capacity);
+  }
+
+  const int mask = get_cpu_features();
+  int feature = 0;
+  do {
+    fprintf(stderr, "Testing 0x%08X\n", feature);
+    g_cpu_features = feature;
+    blake3_hasher hasher;
+    switch (mode) {
+    case HASH_MODE:
+      blake3_hasher_init(&hasher);
+      break;
+    case KEYED_HASH_MODE:
+      blake3_hasher_init_keyed(&hasher, key);
+      break;
+    case DERIVE_KEY_MODE:
+      blake3_hasher_init_derive_key(&hasher, context);
+      break;
+    default:
+      abort();
+    }
+
+    blake3_hasher_update(&hasher, buf, buf_len);
+
+    /* TODO: An incremental output reader API to avoid this allocation. */
+    uint8_t *out = malloc(out_len);
+    if (out_len > 0 && out == NULL) {
+      fprintf(stderr, "malloc() failed.\n");
+      return 1;
+    }
+    blake3_hasher_finalize(&hasher, out, out_len);
+    for (size_t i = 0; i < out_len; i++) {
+      printf("%02x", out[i]);
+    }
+    printf("\n");
+    free(out);
+    feature = (feature - mask) & mask;
+  } while (feature != 0);
+  free(buf);
+  return 0;
+}

package/harmony/quick_crypto/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/harmony/quick_crypto/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/harmony/quick_crypto/deps/ncrypto/include/dh-primes.h

@@ -0,0 +1,67 @@
+/* ====================================================================
+ * Copyright (c) 2011 The OpenSSL Project.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ *
+ * 3. All advertising materials mentioning features or use of this
+ *    software must display the following acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
+ *
+ * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
+ *    endorse or promote products derived from this software without
+ *    prior written permission. For written permission, please contact
+ *    licensing@OpenSSL.org.
+ *
+ * 5. Products derived from this software may not be called "OpenSSL"
+ *    nor may "OpenSSL" appear in their names without prior written
+ *    permission of the OpenSSL Project.
+ *
+ * 6. Redistributions of any form whatsoever must retain the following
+ *    acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
+ * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
+ * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+ * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ * ====================================================================
+ *
+ * This product includes cryptographic software written by Eric Young
+ * (eay@cryptsoft.com).  This product includes software written by Tim
+ * Hudson (tjh@cryptsoft.com). */
+
+#ifndef DEPS_NCRYPTO_DH_PRIMES_H_
+#define DEPS_NCRYPTO_DH_PRIMES_H_
+
+#include <openssl/bn.h>
+
+// Backporting primes that may not be supported in earlier boringssl versions.
+// Intentionally keeping the existing C-style formatting.
+
+BIGNUM* BN_get_rfc3526_prime_2048(BIGNUM* ret);
+BIGNUM* BN_get_rfc3526_prime_3072(BIGNUM* ret);
+BIGNUM* BN_get_rfc3526_prime_4096(BIGNUM* ret);
+BIGNUM* BN_get_rfc3526_prime_6144(BIGNUM* ret);
+BIGNUM* BN_get_rfc3526_prime_8192(BIGNUM* ret);
+
+#endif  // DEPS_NCRYPTO_DH_PRIMES_H_