Lines Matching refs:biL
10 * bound that's of the form 2^n-1 where n is a multiple of #biL.
11 * These can be thought of integers written in base 2^#biL with a fixed
80 #define biL (ciL << 3) /** bits in limb */
87 #define BITS_TO_LIMBS(i) ((i) / biL + ((i) % biL != 0))
317 * This function operates modulo `2^(biL*limbs)` and returns the carry
327 * \return 1 if `A + B >= 2^(biL*limbs)`, 0 otherwise.
346 * This function operates modulo `2^(biL*limbs)`.
362 * \return 1 if `X + cond * A >= 2^(biL*limbs)`, 0 otherwise.
373 * This function operates modulo `2^(biL*limbs)` and returns the carry
398 * This function operates modulo `2^(biL*X_limbs)`.
463 * `R = 2^(biL*AN_limbs)`.
475 * \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL.
495 * 2^{2*n*biL} mod N.
622 * \param[in] RR The precomputed residue of 2^{2*biL} modulo N, as a little
705 * the base `R` = 2^(biL*N->limbs).
707 * \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL.
710 * \param[in] rr The residue for `2^{2*n*biL} mod N`.
743 * the base `R` = 2^(biL*N->limbs).
745 * \param mm The Montgomery constant for \p N: -N^-1 mod 2^biL.