/crypto/ |
D | twofish_generic.c | 67 #define ENCROUND(n, a, b, c, d) \ argument 69 x += y; y += x + ctx->k[2 * (n) + 1]; \ 70 (c) ^= x + ctx->k[2 * (n)]; \ 74 #define DECROUND(n, a, b, c, d) \ argument 77 (d) ^= y + ctx->k[2 * (n) + 1]; \ 80 (c) ^= (x + ctx->k[2 * (n)]) 85 #define ENCCYCLE(n) \ argument 86 ENCROUND (2 * (n), a, b, c, d); \ 87 ENCROUND (2 * (n) + 1, c, d, a, b) 89 #define DECCYCLE(n) \ argument [all …]
|
D | aes_generic.c | 58 static inline u8 byte(const u32 x, const unsigned n) in byte() argument 60 return x >> (n << 3); in byte() 1300 #define f_rn(bo, bi, n, k) do { \ argument 1301 bo[n] = crypto_ft_tab[0][byte(bi[n], 0)] ^ \ 1302 crypto_ft_tab[1][byte(bi[(n + 1) & 3], 1)] ^ \ 1303 crypto_ft_tab[2][byte(bi[(n + 2) & 3], 2)] ^ \ 1304 crypto_ft_tab[3][byte(bi[(n + 3) & 3], 3)] ^ *(k + n); \ 1315 #define f_rl(bo, bi, n, k) do { \ argument 1316 bo[n] = crypto_fl_tab[0][byte(bi[n], 0)] ^ \ 1317 crypto_fl_tab[1][byte(bi[(n + 1) & 3], 1)] ^ \ [all …]
|
D | ablkcipher.c | 78 unsigned int n = bsize; in ablkcipher_done_slow() local 83 if (len_this_page > n) in ablkcipher_done_slow() 84 len_this_page = n; in ablkcipher_done_slow() 85 scatterwalk_advance(&walk->out, n); in ablkcipher_done_slow() 86 if (n == len_this_page) in ablkcipher_done_slow() 88 n -= len_this_page; in ablkcipher_done_slow() 96 unsigned int n) in ablkcipher_done_fast() argument 98 scatterwalk_advance(&walk->in, n); in ablkcipher_done_fast() 99 scatterwalk_advance(&walk->out, n); in ablkcipher_done_fast() 101 return n; in ablkcipher_done_fast() [all …]
|
D | blkcipher.c | 85 unsigned int n) in blkcipher_done_fast() argument 89 memcpy(walk->dst.virt.addr, walk->page, n); in blkcipher_done_fast() 97 scatterwalk_advance(&walk->in, n); in blkcipher_done_fast() 98 scatterwalk_advance(&walk->out, n); in blkcipher_done_fast() 100 return n; in blkcipher_done_fast() 109 unsigned int n = walk->nbytes - err; in blkcipher_walk_done() local 112 n = blkcipher_done_fast(walk, n); in blkcipher_walk_done() 117 n = blkcipher_done_slow(walk, n); in blkcipher_walk_done() 119 nbytes = walk->total - n; in blkcipher_walk_done() 151 unsigned int n; in blkcipher_next_slow() local [all …]
|
D | algapi.c | 84 struct crypto_spawn *spawn, *n; in crypto_more_spawns() local 90 n = list_entry(spawn->list.next, struct crypto_spawn, list); in crypto_more_spawns() 92 if (spawn->alg && &n->list != stack && !n->alg) in crypto_more_spawns() 93 n->alg = (n->list.next == stack) ? alg : in crypto_more_spawns() 94 &list_entry(n->list.next, struct crypto_spawn, in crypto_more_spawns() 99 return &n->list == stack ? top : &n->inst->alg.cra_users; in crypto_more_spawns() 130 struct crypto_spawn *spawn, *n; in crypto_remove_spawns() local 137 list_for_each_entry_safe(spawn, n, spawns, list) { in crypto_remove_spawns() 178 list_for_each_entry_safe(spawn, n, &secondary_spawns, list) { in crypto_remove_spawns() 332 struct crypto_alg *n; in crypto_remove_final() local [all …]
|
D | twofish_common.c | 549 #define CALC_K(a, j, k, l, m, n) \ argument 551 y = CALC_K_2 (m, n, m, n, 4); \ 562 #define CALC_K192(a, j, k, l, m, n) \ argument 564 y = CALC_K192_2 (n, n, m, m, 4); \ 575 #define CALC_K256(a, j, k, l, m, n) \ argument 577 y = CALC_K256_2 (m, n, 4); \
|
D | ghash-generic.c | 74 int n = min(srclen, dctx->bytes); in ghash_update() local 77 dctx->bytes -= n; in ghash_update() 78 srclen -= n; in ghash_update() 80 while (n--) in ghash_update()
|
D | tea.c | 64 u32 y, z, n, sum = 0; in tea_encrypt() local 78 n = TEA_ROUNDS; in tea_encrypt() 80 while (n-- > 0) { in tea_encrypt() 92 u32 y, z, n, sum; in tea_decrypt() local 108 n = TEA_ROUNDS; in tea_decrypt() 110 while (n-- > 0) { in tea_decrypt()
|
D | scatterwalk.c | 131 int offset = 0, n = 0; in scatterwalk_bytes_sglen() local 139 n++; in scatterwalk_bytes_sglen() 147 return n; in scatterwalk_bytes_sglen()
|
D | fcrypt.c | 58 #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) \ argument 68 k = (k >> n) | ((k & ((1 << n) - 1)) << (56 - n)); \
|
D | ccm.c | 164 static void compute_mac(struct crypto_cipher *tfm, u8 *data, int n, in compute_mac() argument 172 datalen = n; in compute_mac() 209 int n; in get_data_to_compute() local 214 n = scatterwalk_clamp(&walk, len); in get_data_to_compute() 215 if (!n) { in get_data_to_compute() 217 n = scatterwalk_clamp(&walk, len); in get_data_to_compute() 221 compute_mac(tfm, data_src, n, pctx); in get_data_to_compute() 222 len -= n; in get_data_to_compute() 225 scatterwalk_advance(&walk, n); in get_data_to_compute()
|
D | testmgr.c | 424 unsigned int i, j, k, n, temp; in __test_aead() local 657 n = template[i].tap[k]; in __test_aead() 659 n += authsize; in __test_aead() 660 if (offset_in_page(q) + n < PAGE_SIZE) in __test_aead() 661 q[n] = 0; in __test_aead() 749 n = template[i].tap[k]; in __test_aead() 751 n += enc ? authsize : -authsize; in __test_aead() 753 if (memcmp(q, template[i].result + temp, n)) { in __test_aead() 756 hexdump(q, n); in __test_aead() 760 q += n; in __test_aead() [all …]
|
D | blowfish_common.c | 309 #define ROUND(a, b, n) ({ b ^= P[n]; a ^= bf_F(b); }) argument
|
D | blowfish_generic.c | 39 #define ROUND(a, b, n) ({ b ^= P[n]; a ^= bf_F(b); }) argument
|
D | vmac.c | 462 const unsigned char n[16], u64 *tagl, in vmac() 472 i = n[15] & 1; in vmac() 473 if ((*(u64 *)(n+8) != in_n[1]) || (*(u64 *)(n) != in_n[0])) { in vmac() 474 in_n[0] = *(u64 *)(n); in vmac() 475 in_n[1] = *(u64 *)(n+8); in vmac()
|
D | seed.c | 31 byte(const u32 x, const unsigned n) in byte() argument 33 return x >> (n << 3); in byte()
|
D | Kconfig | 98 def_tristate CRYPTO_MANAGER || (CRYPTO_MANAGER!=n && CRYPTO_ALGAPI=y)
|
/crypto/asymmetric_keys/ |
D | asymmetric_type.c | 236 int n; in asymmetric_key_describe() local 247 n = kid->len; in asymmetric_key_describe() 249 if (n > 4) { in asymmetric_key_describe() 250 p += n - 4; in asymmetric_key_describe() 251 n = 4; in asymmetric_key_describe() 253 seq_printf(m, "%*phN", n, p); in asymmetric_key_describe()
|
D | pkcs7_verify.c | 333 int ret, n; in pkcs7_verify() local 337 for (n = 0, x509 = pkcs7->certs; x509; x509 = x509->next, n++) { in pkcs7_verify() 342 n, x509->authority->len, x509->authority->data); in pkcs7_verify()
|
D | rsa.c | 100 if (mpi_cmp(s, key->rsa.n) >= 0) { in RSAVP1() 110 ret = mpi_powm(m, s, key->rsa.e, key->rsa.n); in RSAVP1() 228 k = mpi_get_nbits(key->rsa.n); in RSA_verify_signature()
|
D | x509_rsakey.asn1 | 2 modulus INTEGER ({ rsa_extract_mpi }), -- n
|