HomeSort by: relevance | last modified time | path
    Searched refs:k_i (Results 1 - 3 of 3) sorted by relevancy

  /src/crypto/external/bsd/openssl/dist/providers/implementations/kdfs/
kbkdf.c 154 unsigned char *k_i, size_t h, uint32_t l, int has_separator,
176 memcpy(k_i, iv, iv_len);
186 if (mode == FEEDBACK && !EVP_MAC_update(ctx, k_i, k_i_len))
194 || !EVP_MAC_final(ctx, k_i, NULL, h))
198 memcpy(ko + written, k_i, ossl_min(to_write, h));
217 unsigned char *k_i = NULL; local
254 k_i = OPENSSL_zalloc(h);
255 if (k_i == NULL)
259 ctx->label_len, ctx->context, ctx->context_len, k_i, h, l,
264 OPENSSL_clear_free(k_i, h)
    [all...]
  /src/crypto/external/apache2/openssl/dist/providers/implementations/kdfs/
kbkdf.c 210 unsigned char *k_i, size_t h, uint32_t l, int has_separator,
232 memcpy(k_i, iv, iv_len);
242 if (mode == FEEDBACK && !EVP_MAC_update(ctx, k_i, k_i_len))
250 || !EVP_MAC_final(ctx, k_i, NULL, h))
254 memcpy(ko + written, k_i, ossl_min(to_write, h));
298 unsigned char *k_i = NULL; local
352 k_i = OPENSSL_zalloc(h);
353 if (k_i == NULL)
357 ctx->label_len, ctx->context, ctx->context_len, k_i, h, l,
362 OPENSSL_clear_free(k_i, h)
    [all...]
  /src/external/mit/isl/dist/doc/
implementation.tex 142 A_i \vec x + B_i \vec s + D_i \vec z + \vec c_i + \vec K_i \geq \vec 0
146 with $\vec K_i$ the (component-wise) smallest non-negative integer vectors
149 The $\vec K_i$ can be obtained by solving a number of
150 LP problems, one for each element of each $\vec K_i$.
939 \exists k_i \in \Z_{\ge 0}, \vec\delta_i \in k_i \, \Delta_i(\vec s) :
942 \sum_i k_i = k > 0
959 \exists k_i \in \Z_{\ge 0} :
960 \vec y = \vec x + \sum_i k_i \, \vec \delta_i
962 \sum_i k_i = k >
    [all...]

Completed in 24 milliseconds