Home
last modified time | relevance | path

Searched refs:g (Results 1 – 9 of 9) sorted by relevance

/crypto/
A Decc_curve_defs.h21 .g = {
48 .g = {
81 .g = {
126 .g = {
147 .g = {
A Decrdsa_defs.h51 .g = {
85 .g = {
123 .g = {
173 .g = {
219 .g = {
A Decdsa.c26 unsigned int ndigits = curve->g.ndigits; in _ecdsa_verify()
50 ecc_point_mult_shamir(&res, u1, &curve->g, u2, &ctx->pub_key, curve); in _ecdsa_verify()
71 size_t bufsize = ctx->curve->g.ndigits * sizeof(u64); in ecdsa_verify()
84 ecc_digits_from_bytes(digest, bufsize, hash, ctx->curve->g.ndigits); in ecdsa_verify()
114 ctx->curve->g.ndigits); in ecdsa_ecc_ctx_reset()
144 if (ndigits != ctx->curve->g.ndigits) in ecdsa_set_pub_key()
A Decrdsa.c96 dlen != ctx->curve->g.ndigits * sizeof(u64) || in ecrdsa_verify()
97 ctx->pub_key.ndigits != ctx->curve->g.ndigits || in ecrdsa_verify()
130 ecc_point_mult_shamir(&cc, z1, &ctx->curve->g, z2, &ctx->pub_key, in ecrdsa_verify()
221 ctx->curve->g.ndigits * sizeof(u64) != ctx->digest_len) in ecrdsa_set_pub_key()
229 ctx->key_len != ctx->curve->g.ndigits * sizeof(u64) * 2) in ecrdsa_set_pub_key()
A Ddh.c18 MPI g; /* Value is guaranteed to be set. */ member
25 mpi_free(ctx->g); in dh_clear_ctx()
64 ctx->g = mpi_read_raw_data(params->g, params->g_size); in dh_set_params()
65 if (!ctx->g) in dh_set_params()
193 base = ctx->g; in dh_compute_value()
478 params.g = safe_prime_g; in dh_safe_prime_set_secret()
A Ddh_helper.c59 ptr = dh_pack_data(ptr, end, params->g, params->g_size); in crypto_dh_encode_key()
89 params->g = (void *)(ptr + params->key_size + params->p_size); in __crypto_dh_decode_key()
A Decc.c961 const unsigned int ndigits = curve->g.ndigits; in vli_mmod_fast()
1020 vli_mult(product, left, right, curve->g.ndigits); in vli_mod_mult_fast()
1030 vli_square(product, left, curve->g.ndigits); in vli_mod_square_fast()
1136 const unsigned int ndigits = curve->g.ndigits; in ecc_point_double_jacobian()
1209 const unsigned int ndigits = curve->g.ndigits; in xycz_initial_double()
1237 const unsigned int ndigits = curve->g.ndigits; in xycz_add()
1282 const unsigned int ndigits = curve->g.ndigits; in xycz_add_c()
1399 unsigned int ndigits = curve->g.ndigits; in ecc_point_add()
1423 unsigned int ndigits = curve->g.ndigits; in ecc_point_mult_shamir()
1486 if (curve->g.ndigits != ndigits) in __ecc_is_key_valid()
[all …]
A DKconfig713 instructions to accelerate AES and carryless multiplication, e.g.
879 building for a particular system that requires it (e.g., when
1236 A non-physical non-deterministic ("true") RNG (e.g., an entropy source
1238 deterministic RNG (e.g., per NIST SP800-90C).
1253 size fits into a cache (e.g. L1), only the memory access timing
1300 on hardware whose timers deliver limited amount of entropy (e.g.
/crypto/async_tx/
A Dasync_raid6_recov.c208 struct page *p, *q, *g, *dp, *dq; in __2data_recov_5() local
235 g = blocks[good]; in __2data_recov_5()
248 tx = async_memcpy(dp, g, dp_off, g_off, bytes, submit); in __2data_recov_5()
250 tx = async_mult(dq, dq_off, g, g_off, in __2data_recov_5()
543 struct page *g = blocks[good]; in async_raid6_datap_recov() local
548 tx = async_memcpy(p, g, p_off, g_off, bytes, submit); in async_raid6_datap_recov()
552 tx = async_mult(dq, dq_off, g, g_off, in async_raid6_datap_recov()

Completed in 23 milliseconds