Lines Matching full:n
18 * \brief Perform a modular exponentiation: X = A^E mod N
23 * This must not alias E or N.
27 * \param N The base for the modular reduction. This must point to an
29 * \param prec_RR A helper MPI depending solely on \p N which can be used to
31 * of \p N. This may be \c NULL. If it is not \c NULL, it must
41 * \return #MBEDTLS_ERR_MPI_BAD_INPUT_DATA if \c N is negative or
47 const mbedtls_mpi *E, const mbedtls_mpi *N,
52 * GCD(A, N) and/or A^-1 mod N if it exists.
54 * \warning Requires N to be odd, and 0 <= A <= N. Additionally, if
55 * I != NULL, requires N > 1.
58 * \note A and N must not alias each other.
59 * When I == NULL (computing only the GCD), G can alias A or N.
61 * alias A, but neither of them can alias N (the modulus).
63 * \param[out] G The GCD of \p A and \p N.
65 * \param[out] I The inverse of \p A modulo \p N if it exists (that is,
66 * if \p G above is 1 on exit), in the range [1, \p N);
70 * This value must be less than or equal to \p N.
71 * \param[in] N The 2nd operand of GCD and modulus for inversion.
82 const mbedtls_mpi *N);
85 * \brief Modular inverse: X = A^-1 mod N with N odd
87 * \param[out] X The inverse of \p A modulo \p N in the range [1, \p N)
90 * \param[in] N The modulus. Must be odd and greater than 1.
96 * \return #MBEDTLS_ERR_MPI_NOT_ACCEPTABLE if A is not invertible mod N.
100 const mbedtls_mpi *N);
103 * \brief Modular inverse: X = A^-1 mod N with N even,
104 * A odd and 1 < A < N.
106 * \param[out] X The inverse of \p A modulo \p N in the range [1, \p N)
109 * and less than \p N.
110 * \param[in] N The modulus. Must be even and greater than 1.
116 * \return #MBEDTLS_ERR_MPI_NOT_ACCEPTABLE if A is not invertible mod N.
120 mbedtls_mpi const *N);