Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 32) sorted by relevance

12

/crypto/
A Daes_generic.c61 return x >> (n << 3); in byte()
1147 #define f_rn(bo, bi, n, k) do { \ argument
1148 bo[n] = crypto_ft_tab[0][byte(bi[n], 0)] ^ \
1151 crypto_ft_tab[3][byte(bi[(n + 3) & 3], 3)] ^ *(k + n); \
1163 bo[n] = crypto_fl_tab[0][byte(bi[n], 0)] ^ \
1166 crypto_fl_tab[3][byte(bi[(n + 3) & 3], 3)] ^ *(k + n); \
1218 bo[n] = crypto_it_tab[0][byte(bi[n], 0)] ^ \
1221 crypto_it_tab[3][byte(bi[(n + 1) & 3], 3)] ^ *(k + n); \
1232 #define i_rl(bo, bi, n, k) do { \ argument
1233 bo[n] = crypto_il_tab[0][byte(bi[n], 0)] ^ \
[all …]
A Dtwofish_generic.c53 #define ENCROUND(n, a, b, c, d) \ argument
56 (c) ^= x + ctx->k[2 * (n)]; \
60 #define DECROUND(n, a, b, c, d) \ argument
63 (d) ^= y + ctx->k[2 * (n) + 1]; \
66 (c) ^= (x + ctx->k[2 * (n)])
71 #define ENCCYCLE(n) \ argument
72 ENCROUND (2 * (n), a, b, c, d); \
75 #define DECCYCLE(n) \ argument
77 DECROUND (2 * (n), a, b, c, d)
85 #define INPACK(n, x, m) \ argument
[all …]
A Dscatterwalk.c153 unsigned n; in skcipher_next_slow() local
220 unsigned int n; in skcipher_walk_next() local
222 n = walk->total; in skcipher_walk_next()
224 n = scatterwalk_clamp(&walk->in, n); in skcipher_walk_next()
225 n = scatterwalk_clamp(&walk->out, n); in skcipher_walk_next()
227 if (unlikely(n < bsize)) { in skcipher_walk_next()
234 walk->nbytes = n; in skcipher_walk_next()
316 if (!n) in skcipher_walk_done()
321 total = walk->total - n; in skcipher_walk_done()
327 scatterwalk_advance(&walk->in, n); in skcipher_walk_done()
[all …]
A Drsa.c17 MPI n; member
58 if (rsa_check_payload(m, key->n)) in _rsa_enc()
62 return mpi_powm(c, m, key->e, key->n); in _rsa_enc()
82 if (rsa_check_payload(c, key->n)) in _rsa_dec_crt()
201 mpi_free(key->n); in rsa_free_mpi_key()
209 key->n = NULL; in rsa_free_mpi_key()
287 mpi_key->n = mpi_read_raw_data(raw_key.n, raw_key.n_sz); in rsa_set_pub_key()
288 if (!mpi_key->n) in rsa_set_pub_key()
330 mpi_key->n = mpi_read_raw_data(raw_key.n, raw_key.n_sz); in rsa_set_priv_key()
331 if (!mpi_key->n) in rsa_set_priv_key()
[all …]
A Decrdsa.c108 vli_cmp(r, ctx->curve->n, ndigits) >= 0 || in ecrdsa_verify()
110 vli_cmp(s, ctx->curve->n, ndigits) >= 0) in ecrdsa_verify()
116 if (vli_cmp(e, ctx->curve->n, ndigits) >= 0) in ecrdsa_verify()
117 vli_sub(e, e, ctx->curve->n, ndigits); in ecrdsa_verify()
122 vli_mod_inv(v, e, ctx->curve->n, ndigits); in ecrdsa_verify()
125 vli_mod_mult_slow(z1, s, v, ctx->curve->n, ndigits); in ecrdsa_verify()
126 vli_sub(_r, ctx->curve->n, r, ndigits); in ecrdsa_verify()
127 vli_mod_mult_slow(z2, _r, v, ctx->curve->n, ndigits); in ecrdsa_verify()
132 if (vli_cmp(cc.x, ctx->curve->n, ndigits) >= 0) in ecrdsa_verify()
133 vli_sub(cc.x, cc.x, ctx->curve->n, ndigits); in ecrdsa_verify()
A Decrdsa_defs.h57 .n = cp256a_n,
91 .n = cp256b_n,
129 .n = cp256c_n,
179 .n = tc512a_n,
225 .n = tc512b_n,
A Decc_curve_defs.h27 .n = nist_p192_n,
54 .n = nist_p256_n,
87 .n = nist_p384_n,
132 .n = nist_p521_n,
A Ddh.c339 for (i = n; val && i > 0; --i) { in __add_u64_to_be()
353 unsigned int n, oversampling_size; in dh_safe_prime_gen_privkey() local
374 n = roundup_pow_of_two(2 * safe_prime->max_strength); in dh_safe_prime_gen_privkey()
375 WARN_ON_ONCE(n & ((1u << 6) - 1)); in dh_safe_prime_gen_privkey()
376 n >>= 6; /* Convert N into units of u64. */ in dh_safe_prime_gen_privkey()
382 oversampling_size = (n + 1) * sizeof(__be64); in dh_safe_prime_gen_privkey()
430 h = __add_u64_to_be(key + 1, n, h); in dh_safe_prime_gen_privkey()
431 h = __add_u64_to_be(key + 1, n, h); in dh_safe_prime_gen_privkey()
435 o = __add_u64_to_be(key + 1, n, 1); in dh_safe_prime_gen_privkey()
443 key[n] = cpu_to_be64(1); in dh_safe_prime_gen_privkey()
[all …]
A Decdsa.c35 if (vli_is_zero(r, ndigits) || vli_cmp(r, curve->n, ndigits) >= 0 || in _ecdsa_verify()
36 vli_is_zero(s, ndigits) || vli_cmp(s, curve->n, ndigits) >= 0) in _ecdsa_verify()
44 vli_mod_inv(s1, s, curve->n, ndigits); in _ecdsa_verify()
46 vli_mod_mult_slow(u1, hash, s1, curve->n, ndigits); in _ecdsa_verify()
48 vli_mod_mult_slow(u2, r, s1, curve->n, ndigits); in _ecdsa_verify()
53 if (unlikely(vli_cmp(res.x, curve->n, ndigits) == 1)) in _ecdsa_verify()
55 vli_sub(res.x, res.x, curve->n, ndigits); in _ecdsa_verify()
A Dalgapi.c77 struct hlist_node *n; in crypto_destroy_instance_workfn() local
89 hlist_for_each_entry_safe(inst, n, &list, list) in crypto_destroy_instance_workfn()
118 struct crypto_spawn *spawn, *n; in crypto_more_spawns() local
124 n = list_prev_entry(spawn, list); in crypto_more_spawns()
127 if (list_is_last(&n->list, stack)) in crypto_more_spawns()
130 n = list_next_entry(n, list); in crypto_more_spawns()
132 n->dead = false; in crypto_more_spawns()
134 return &n->inst->alg.cra_users; in crypto_more_spawns()
169 struct crypto_spawn *spawn, *n; in crypto_remove_spawns() local
411 struct crypto_alg *n; in crypto_remove_final() local
[all …]
A Dtwofish_common.c535 #define CALC_K(a, j, k, l, m, n) \ argument
537 y = CALC_K_2 (m, n, m, n, 4); \
548 #define CALC_K192(a, j, k, l, m, n) \ argument
550 y = CALC_K192_2 (n, n, m, m, 4); \
561 #define CALC_K256(a, j, k, l, m, n) \ argument
563 y = CALC_K256_2 (m, n, 4); \
A Dtea.c58 u32 y, z, n, sum = 0; in tea_encrypt() local
70 n = TEA_ROUNDS; in tea_encrypt()
72 while (n-- > 0) { in tea_encrypt()
84 u32 y, z, n, sum; in tea_decrypt() local
98 n = TEA_ROUNDS; in tea_decrypt()
100 while (n-- > 0) { in tea_decrypt()
A Dscompress.c179 unsigned int n; in scomp_acomp_comp_decomp() local
204 n = (dlen - 1) / PAGE_SIZE; in scomp_acomp_comp_decomp()
205 n += (offset_in_page(dlen - 1) + doff) / PAGE_SIZE; in scomp_acomp_comp_decomp()
206 if (PageHighMem(dpage + n) && in scomp_acomp_comp_decomp()
226 n = (slen - 1) / PAGE_SIZE; in scomp_acomp_comp_decomp()
227 n += (offset_in_page(slen - 1) + soff) / PAGE_SIZE; in scomp_acomp_comp_decomp()
228 if (PageHighMem(nth_page(spage, n)) && in scomp_acomp_comp_decomp()
A Dchacha20poly1305.c160 unsigned int n = scatterwalk_next(&walk, total); in poly_hash() local
162 poly1305_update(&desc, walk.addr, n); in poly_hash()
163 scatterwalk_done_src(&walk, n); in poly_hash()
164 total -= n; in poly_hash()
174 unsigned int n = scatterwalk_next(&walk, total); in poly_hash() local
176 poly1305_update(&desc, walk.addr, n); in poly_hash()
177 scatterwalk_done_src(&walk, n); in poly_hash()
178 total -= n; in poly_hash()
A Dfcrypt.c58 #define ror56(hi, lo, n) \ argument
60 u32 t = lo & ((1 << n) - 1); \
61 lo = (lo >> n) | ((hi & ((1 << n) - 1)) << (32 - n)); \
62 hi = (hi >> n) | (t << (24-n)); \
66 #define ror56_64(k, n) (k = (k >> n) | ((k & ((1 << n) - 1)) << (56 - n))) argument
A Dblowfish_common.c305 #define ROUND(a, b, n) ({ b ^= P[n]; a ^= bf_F(b); }) argument
A Dblowfish_generic.c35 #define ROUND(a, b, n) ({ b ^= P[n]; a ^= bf_F(b); }) argument
A Drsapubkey.asn19 n INTEGER ({ rsa_get_n }),
A Drsaprivkey.asn110 n INTEGER ({ rsa_get_n }),
A Dhctr2.c204 int n = 0; in hctr2_hash_message() local
208 for (i = 0; i < bulk_len; i += n) { in hctr2_hash_message()
210 n = min_t(unsigned int, miter.length, bulk_len - i); in hctr2_hash_message()
211 err = crypto_shash_update(hash_desc, miter.addr, n); in hctr2_hash_message()
A Dadiantum.c255 unsigned int i, n; in adiantum_hash_message() local
263 for (i = 0; i < bulk_len; i += n) { in adiantum_hash_message()
265 n = min_t(unsigned int, miter.length, bulk_len - i); in adiantum_hash_message()
266 err = crypto_shash_update(hash_desc, miter.addr, n); in adiantum_hash_message()
/crypto/krb5/
A Dkrb5_kdf.c41 int ret, n = 1; in crypto_krb5_calc_PRFplus() local
56 *(__be32 *)(n_S.data) = htonl(n); in crypto_krb5_calc_PRFplus()
57 Tn.data = T_series.data + Tn.len * (n - 1); in crypto_krb5_calc_PRFplus()
62 n++; in crypto_krb5_calc_PRFplus()
A Drfc3961_simplified.c87 size_t i, n; in crypto_shash_update_sg() local
93 for (i = 0; i < len; i += n) { in crypto_shash_update_sg()
95 n = min(miter.length, len - i); in crypto_shash_update_sg()
96 ret = crypto_shash_update(desc, miter.addr, n); in crypto_shash_update_sg()
270 unsigned int blocksize, keybytes, keylength, n; in rfc3961_calc_DK() local
312 n = 0; in rfc3961_calc_DK()
313 while (n < rawkey.len) { in rfc3961_calc_DK()
316 if (keybytes - n <= outblock.len) { in rfc3961_calc_DK()
317 memcpy(rawkey.data + n, outblock.data, keybytes - n); in rfc3961_calc_DK()
321 memcpy(rawkey.data + n, outblock.data, outblock.len); in rfc3961_calc_DK()
[all …]
/crypto/asymmetric_keys/
A Dpublic_key.c72 int n; in software_key_determine_akcipher() local
91 n = snprintf(alg_name, CRYPTO_MAX_ALG_NAME, in software_key_determine_akcipher()
97 n = snprintf(alg_name, CRYPTO_MAX_ALG_NAME, in software_key_determine_akcipher()
101 return n >= CRYPTO_MAX_ALG_NAME ? -EINVAL : 0; in software_key_determine_akcipher()
134 n = snprintf(alg_name, CRYPTO_MAX_ALG_NAME, "%s(%s)", in software_key_determine_akcipher()
136 return n >= CRYPTO_MAX_ALG_NAME ? -EINVAL : 0; in software_key_determine_akcipher()
A Dasymmetric_type.c359 int n; in asymmetric_key_describe() local
370 n = kid->len; in asymmetric_key_describe()
372 if (n > 4) { in asymmetric_key_describe()
373 p += n - 4; in asymmetric_key_describe()
374 n = 4; in asymmetric_key_describe()
376 seq_printf(m, "%*phN", n, p); in asymmetric_key_describe()

Completed in 47 milliseconds

12