Home
last modified time | relevance | path

Searched full:compute (Results 1 – 25 of 118) sorted by relevance

12345

/optee_os/.github/workflows/
H A Dnotify.yml26 - name: Compute maintainers
27 id: compute
36 if: steps.compute.outputs.message != ''
40 const message = "${{ steps.compute.outputs.message }}";
/optee_os/core/lib/libtomcrypt/src/pk/ecc/
H A Dltc_ecc_is_point.c26 /* compute y^2 */ in ltc_ecc_is_point()
29 /* compute x^3 */ in ltc_ecc_is_point()
34 /* compute y^2 - x^3 */ in ltc_ecc_is_point()
37 /* compute y^2 - x^3 - a*x */ in ltc_ecc_is_point()
H A Dltc_ecc_import_point.c32 /* compute x^3 */ in ltc_ecc_import_point()
35 /* compute x^3 + a*x */ in ltc_ecc_import_point()
38 /* compute x^3 + a*x + b */ in ltc_ecc_import_point()
40 /* compute sqrt(x^3 + a*x + b) */ in ltc_ecc_import_point()
H A Dltc_ecc_is_point_at_infinity.c32 /* compute y^2 */ in ltc_ecc_is_point_at_infinity()
35 /* compute x^3 */ in ltc_ecc_is_point_at_infinity()
H A Decc_recover_key.c173 /* compute x^3 */ in ecc_recover_key()
176 /* compute x^3 + a*x */ in ecc_recover_key()
179 /* compute x^3 + a*x + b */ in ecc_recover_key()
181 /* compute sqrt(x^3 + a*x + b) */ in ecc_recover_key()
223 /* compute v1*mR + v2*mG = mQ using Shamir's trick */ in ecc_recover_key()
226 /* compute u1*mG + u2*mQ = mG using Shamir's trick */ in ecc_recover_key()
/optee_os/lib/libmbedtls/core/
H A Dsm2-pke.c210 /* Step B5: get C2 from C and compute Mprime = C2 (+) t */ in sm2_mbedtls_pke_decrypt()
226 /* Step B6: compute u = Hash(x2 || M' || y2) and compare with C3 */ in sm2_mbedtls_pke_decrypt()
338 /* Step A2: compute C1 = [k]G */ in sm2_mbedtls_pke_encrypt()
347 * Step A3: compute S = [h]PB and check for infinity. in sm2_mbedtls_pke_encrypt()
351 /* Step A4: compute (x2, y2) = [k]PB */ in sm2_mbedtls_pke_encrypt()
381 /* Step A5: compute t = KDF(x2 || y2, klen) */ in sm2_mbedtls_pke_encrypt()
400 * Compute C2 = M (+) t in sm2_mbedtls_pke_encrypt()
401 * Compute C3 = Hash(x2 || M || y2) in sm2_mbedtls_pke_encrypt()
H A Dsm2-kep.c26 * Compute a hash of a user's identity and public key
126 * Compute a verification value, to be checked against the value sent by the
152 /* Compute the inner hash */ in sm2_kep_compute_S()
221 /* Now compute S */ in sm2_kep_compute_S()
384 /* Step A7: compute U = [h.tA](PB + [x2bar]RB) and check for infinity */ in crypto_acipher_sm2_kep_derive()
416 /* Step A8: compute KA = KDF(xU || yU || ZA || ZB, klen) */ in crypto_acipher_sm2_kep_derive()
448 /* Step A9: compute S1 and check S1 == SB */ in crypto_acipher_sm2_kep_derive()
472 /* Step A10: compute SA */ in crypto_acipher_sm2_kep_derive()
H A Dsm2-dsa.c73 /* Step A4: compute (x1, y1) = [k]G */ in sm2_mbedtls_dsa_sign()
80 /* Step A5: compute r = (e + x1) mod n */ in sm2_mbedtls_dsa_sign()
98 /* Step A6: compute s = ((1 + dA)^-1 * (k - r*dA)) mod n */ in sm2_mbedtls_dsa_sign()
241 /* Step B7: compute R = (e' + x1') mod n and verify R == r' */ in sm2_mbedtls_dsa_verify()
/optee_os/core/lib/libtomcrypt/
H A Dsm2-pke.c243 /* Step B5: get C2 from C and compute Mprime = C2 (+) t */ in sm2_ltc_pke_decrypt()
259 /* Step B6: compute u = Hash(x2 || M' || y2) and compare with C3 */ in sm2_ltc_pke_decrypt()
367 /* Step A2: compute C1 = [k]G */ in sm2_ltc_pke_encrypt()
382 /* Step A3: compute S = [h]PB and check for infinity */ in sm2_ltc_pke_encrypt()
419 /* Step A4: compute (x2, y2) = [k]PB */ in sm2_ltc_pke_encrypt()
444 /* Step A5: compute t = KDF(x2 || y2, klen) */ in sm2_ltc_pke_encrypt()
463 * Compute C2 = M (+) t in sm2_ltc_pke_encrypt()
464 * Compute C3 = Hash(x2 || M || y2) in sm2_ltc_pke_encrypt()
H A Dsm2-kep.c22 * Compute a hash of a user's identity and public key
96 * Compute a verification value, to be checked against the value sent by the
120 /* Compute the inner hash */ in sm2_kep_compute_S()
169 /* Now compute S */ in sm2_kep_compute_S()
284 /* Step A7: compute U = [h.tA](PB + [x2bar]RB) and check for infinity */ in sm2_kep_derive()
327 /* Step A8: compute KA = KDF(xU || yU || ZA || ZB, klen) */ in sm2_kep_derive()
355 /* Step A9: compute S1 and check S1 == SB */ in sm2_kep_derive()
379 /* Step A10: compute SA */ in sm2_kep_derive()
H A Dsm2-dsa.c69 /* Step A4: compute (x1, y1) = [k]G */ in sm2_ltc_dsa_sign()
78 /* Step A5: compute r = (e + x1) mod n */ in sm2_ltc_dsa_sign()
95 /* Step A6: compute s = ((1 + dA)^-1 * (k - r*dA)) mod n */ in sm2_ltc_dsa_sign()
233 /* Step B7: compute R = (e' + x1') mod n and verify R == r' */ in sm2_ltc_dsa_verify()
/optee_os/core/lib/libtomcrypt/src/encauth/ocb3/
H A Docb3_init.c143 /* compute L_$, L_0, L_1, ... */ in ocb3_init()
145 if (x == -1) { /* gonna compute: L_$ = double(L_*) */ in ocb3_init()
149 else if (x == 0) { /* gonna compute: L_0 = double(L_$) */ in ocb3_init()
153 … else { /* gonna compute: L_i = double(L_{i-1}) for every integer i > 0 */ in ocb3_init()
H A Docb3_int_xor_blocks.c13 Compute xor for two blocks of bytes 'out = block_a XOR block_b' (internal function)
/optee_os/core/drivers/crypto/caam/utils/
H A Dutils_sgt_v2.c32 * Compute the new offset reading the one present and adding the in sgt_entry_offset()
59 /* Compute the second word */ in caam_sgt_set_entry()
/optee_os/core/lib/libtomcrypt/src/pk/pkcs1/
H A Dpkcs_1_oaep_decode.c106 /* compute MGF1 of maskedDB (hLen) */ in pkcs_1_oaep_decode()
116 /* compute MGF1 of seed (k - hlen - 1) */ in pkcs_1_oaep_decode()
128 /* compute lhash and store it in seed [reuse temps!] */ in pkcs_1_oaep_decode()
H A Dpkcs_1_oaep_encode.c119 /* compute MGF1 of seed (k - hlen - 1) */ in pkcs_1_oaep_encode()
129 /* compute MGF1 of maskedDB (hLen) */ in pkcs_1_oaep_encode()
/optee_os/lib/libmbedtls/mbedtls/library/
H A Dssl_tls13_keys.h383 * \brief Compute the next secret in the TLS 1.3 key schedule
385 * The TLS 1.3 key schedule proceeds as follows to compute
545 * \brief Compute TLS 1.3 resumption master secret.
588 * \brief Compute TLS 1.3 early transform
595 * \warning The function does not compute the early master secret. Call
608 * \brief Compute TLS 1.3 handshake transform
620 * \brief Compute TLS 1.3 application transform
H A Dpsa_crypto_cipher.h69 * \param[in] alg The cipher algorithm to compute
99 * \param[in] alg The cipher algorithm to compute
224 * \param[in] alg The cipher algorithm to compute
278 * \param[in] alg The cipher algorithm to compute
H A Dssl_tls13_keys.c511 * Compute client_handshake_traffic_secret with in mbedtls_ssl_tls13_derive_handshake_secrets()
528 * Compute server_handshake_traffic_secret with in mbedtls_ssl_tls13_derive_handshake_secrets()
679 * Compute MasterSecret in ssl_tls13_key_schedule_stage_application()
1319 * \brief Compute TLS 1.3 handshake traffic keys.
1477 * Compute ECDHE secret used to compute the handshake secret from which in ssl_tls13_key_schedule_stage_handshake()
1489 /* Compute ECDH shared secret. */ in ssl_tls13_key_schedule_stage_handshake()
1533 * Compute the Handshake Secret in ssl_tls13_key_schedule_stage_handshake()
1557 * \brief Compute TLS 1.3 application traffic keys.
1613 /* Compute current handshake transcript. It's the caller's responsibility in ssl_tls13_generate_application_keys()
1623 /* Compute application secrets from master secret and transcript hash. */ in ssl_tls13_generate_application_keys()
[all …]
H A Dpoly1305.c99 /* Compute: acc += (padded) block as a 130-bit integer */ in poly1305_process()
110 /* Compute: acc *= r */ in poly1305_process()
132 /* Compute: acc %= (2^130 - 5) (partial remainder) */ in poly1305_process()
165 * \brief Compute the Poly1305 MAC
221 /* Compute MAC (128 least significant bits of the accumulator) */ in poly1305_compute_mac()
H A Drsa_alt_helpers.c18 * Compute RSA prime factors from public and private exponents
214 /* Compute modular inverse of E in LCM(P-1, Q-1) */ in mbedtls_rsa_deduce_private_exponent()
335 /* Compute DE-1 mod P-1 */ in mbedtls_rsa_validate_params()
345 /* Compute DE-1 mod Q-1 */ in mbedtls_rsa_validate_params()
/optee_os/core/lib/libtomcrypt/src/encauth/ocb/
H A Docb_shift_xor.c13 Compute the shift/xor for OCB (internal function)
/optee_os/core/arch/arm/plat-automotive_rd/
H A Drd1ae_core_pos.S24 /* Compute linear position */
/optee_os/scripts/
H A Dgen_ldelf_hex.py50 # read only first, then read-write. Compute padding at end of each segment,
86 # Compute code_size, data_size and load_size
/optee_os/lib/libutils/compiler-rt/lib/builtins/
H A Dudivmodti4.c54 // Compute the first quotient digit, q1. in udiv128by64to64default()
68 // Compute the second quotient digit. in udiv128by64to64default()

12345