Lines Matching full:check

119         /* Check if gcd(K,N) = 1 */  in mbedtls_rsa_deduce_primes()
126          * and check whether they have nontrivial GCD with N. */  in mbedtls_rsa_deduce_primes()
161          * Check if that's the case and abort if not, to avoid very long,  in mbedtls_rsa_deduce_primes()
257  * Check that core RSA parameters are sane.
272      * Step 1: If PRNG provided, check that P and Q are prime  in mbedtls_rsa_validate_params()
298      * Step 2: Check that 1 < N = P * Q  in mbedtls_rsa_validate_params()
311      * Step 3: Check and 1 < D, E < N if present.  in mbedtls_rsa_validate_params()
325      * Step 4: Check that D, E are inverse modulo P-1 and Q-1  in mbedtls_rsa_validate_params()
361     /* Wrap MPI error codes by RSA check failure error code */  in mbedtls_rsa_validate_params()
370  * Check that RSA CRT parameters are in accordance with core parameters.
382     /* Check that DP - D == 0 mod P - 1 */  in mbedtls_rsa_validate_crt()
399     /* Check that DQ - D == 0 mod Q - 1 */  in mbedtls_rsa_validate_crt()
416     /* Check that QP * Q - 1 == 0 mod P */  in mbedtls_rsa_validate_crt()
434     /* Wrap MPI error codes by RSA check failure error code */  in mbedtls_rsa_validate_crt()