Lines Matching defs:bits
4868 * For this prime we need to handle data in chunks of 64 bits.
4973 * (1) chunks of 32 bits, and (2) subtractions.
4977 * For these primes, we need to handle data in chunks of 32 bits.
4978 * This makes it more complicated if we use 64 bits limbs in MPI,
5373 /* Keep the top 9 bits and reduce the rest, using 2^521 = 1 mod P521. */
5454 * limb occurs, X > 2^255 and all the remaining bits on the limb are zero.
5559 * Oversize Q catches potential carry here when X is already max 448 bits.
5595 * limb 0. We also know that B0 is the bottom 224 bits of A1 (which is
5596 * then shifted up 224 bits), so, given M is currently A1 this turns
5600 * bits, we can just move that into the right place, shifted up
5624 * with R about 33 bits, used by the Koblitz curves.
5633 size_t bits)
5641 size_t shift = bits % biL;
5643 size_t P_limbs = bits / biL + adjust;
5694 * 64 bits. The result value of the multiplication is at most
5695 * P length + 33 bits in length and the result value of the addition
5696 * is at most P length + 34 bits in length. So the result of the
5697 * addition always fits in P length + 64 bits.