| /crypto/ |
| D | sm3_generic.c | 44 static inline u32 gg(unsigned int n, u32 e, u32 f, u32 g) in gg() argument
46 return (n < 16) ? (e ^ f ^ g) : ((e & f) | ((~e) & g)); in gg()
78 u32 a, b, c, d, e, f, g, h; in sm3_compress() local
85 e = m[4]; in sm3_compress()
92 ss1 = rol32((rol32(a, 12) + e + rol32(t(i), i & 31)), 7); in sm3_compress()
99 tt2 = gg(i, e, f, g) + h + ss1 + *w; in sm3_compress()
108 f = e; in sm3_compress()
109 e = p0(tt2); in sm3_compress()
116 m[4] = e ^ m[4]; in sm3_compress()
121 a = b = c = d = e = f = g = h = ss1 = ss2 = tt1 = tt2 = 0; in sm3_compress()
|
| D | sha512_generic.c | 101 u64 a, b, c, d, e, f, g, h, t1, t2; in sha512_transform() local
108 e=state[4]; f=state[5]; g=state[6]; h=state[7]; in sha512_transform()
126 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[(i & 15)]; in sha512_transform()
128 t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[(i & 15) + 1]; in sha512_transform()
130 t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[(i & 15) + 2]; in sha512_transform()
132 t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[(i & 15) + 3]; in sha512_transform()
133 t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2; in sha512_transform()
135 t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2; in sha512_transform()
137 t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2; in sha512_transform()
139 t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2; in sha512_transform()
[all …]
|
| D | rsa.c | 17 MPI e; member
32 return mpi_powm(c, m, key->e, key->n); in _rsa_enc()
65 if (unlikely(!pkey->n || !pkey->e)) { in rsa_enc()
134 mpi_free(key->e); in rsa_free_mpi_key()
137 key->e = NULL; in rsa_free_mpi_key()
170 mpi_key->e = mpi_read_raw_data(raw_key.e, raw_key.e_sz); in rsa_set_pub_key()
171 if (!mpi_key->e) in rsa_set_pub_key()
208 mpi_key->e = mpi_read_raw_data(raw_key.e, raw_key.e_sz); in rsa_set_priv_key()
209 if (!mpi_key->e) in rsa_set_priv_key()
|
| D | ecrdsa.c | 81 u64 e[ECRDSA_MAX_DIGITS]; /* h \mod q */ in ecrdsa_verify() local
82 u64 *v = e; /* e^{-1} \mod q */ in ecrdsa_verify()
85 struct ecc_point cc = ECC_POINT_INIT(s, e, ndigits); /* reuse s, e */ in ecrdsa_verify()
123 vli_from_le64(e, digest, ndigits); in ecrdsa_verify()
124 if (vli_cmp(e, ctx->curve->n, ndigits) >= 0) in ecrdsa_verify()
125 vli_sub(e, e, ctx->curve->n, ndigits); in ecrdsa_verify()
126 if (vli_is_zero(e, ndigits)) in ecrdsa_verify()
127 e[0] = 1; in ecrdsa_verify()
130 vli_mod_inv(v, e, ctx->curve->n, ndigits); in ecrdsa_verify()
|
| D | rsapubkey.asn1 | 3 e INTEGER ({ rsa_get_e })
|
| D | tcrypt.c | 261 const char *e; in test_mb_aead_speed() local
277 e = "encryption"; in test_mb_aead_speed()
279 e = "decryption"; in test_mb_aead_speed()
339 get_driver_name(crypto_aead, tfm), e); in test_mb_aead_speed()
432 pr_err("%s() failed return code=%d\n", e, ret); in test_mb_aead_speed()
538 const char *e; in test_aead_speed() local
558 e = "encryption"; in test_aead_speed()
560 e = "decryption"; in test_aead_speed()
590 get_driver_name(crypto_aead, tfm), e); in test_aead_speed()
684 pr_err("%s() failed return code=%d\n", e, ret); in test_aead_speed()
[all …]
|
| D | rsaprivkey.asn1 | 4 e INTEGER ({ rsa_get_e }),
|
| D | rsa_helper.c | 55 key->e = value; in rsa_get_e()
|
| D | rmd160.c | 43 #define ROUND(a, b, c, d, e, f, k, x, s) { \ argument
45 (a) = rol32((a), (s)) + (e); \
|
| D | Kconfig | 62 for lab evaluation testing of the module, e.g. support for injecting
566 carryless multiplication, e.g. x86 processors with AES-NI and CLMUL, and
592 building for a particular system that requires it (e.g., when
1201 without hardware AES acceleration (e.g. caam crypto). It reduces the
|
| D | testmgr.c | 2606 const char *e; in test_cipher() local
2616 e = "encryption"; in test_cipher()
2618 e = "decryption"; in test_cipher()
2671 "on %s for %s\n", j, e, algo); in test_cipher()
|
| /crypto/asymmetric_keys/ |
| D | asym_tpm.c | 344 uint8_t e[3] = { 0x01, 0x00, 0x01 }; in derive_pub_key() local
353 cur = encode_tag_length(cur, 0x02, sizeof(e)); in derive_pub_key()
354 memcpy(cur, e, sizeof(e)); in derive_pub_key()
355 cur += sizeof(e); in derive_pub_key()
|