Lines Matching full:2
102 * in range `0 <= X < 2 * N` (where N is the modulus).
124 * in range `0 <= X < 2 * N` (where N is the modulus).
140 /** Fast quasi-reduction modulo p521 = 2^521 - 1 (FIPS 186-3 D.2.5)
146 * in range `0 <= X < 2 * N` (where N is the modulus).
168 * in range `0 <= X < 2 * N` (where N is the modulus).
184 /** Fast quasi-reduction modulo p192k1 = 2^192 - R,
185 * with R = 2^32 + 2^12 + 2^8 + 2^7 + 2^6 + 2^3 + 1 = 0x01000011C9
191 * in range `0 <= X < 2 * N` (where N is the modulus).
208 /** Fast quasi-reduction modulo p224k1 = 2^224 - R,
209 * with R = 2^32 + 2^12 + 2^11 + 2^9 + 2^7 + 2^4 + 2 + 1 = 0x0100001A93
215 * in range `0 <= X < 2 * N` (where N is the modulus).
232 /** Fast quasi-reduction modulo p256k1 = 2^256 - R,
233 * with R = 2^32 + 2^9 + 2^8 + 2^7 + 2^6 + 2^4 + 1 = 0x01000003D1
239 * in range `0 <= X < 2 * N` (where N is the modulus).
256 /** Fast quasi-reduction modulo p255 = 2^255 - 19
262 * in range `0 <= X < 2 * N` (where N is the modulus).
277 /** Fast quasi-reduction modulo p448 = 2^448 - 2^224 - 1
278 * Write X as A0 + 2^448 A1 and A1 as B0 + 2^224 B1, and return A0 + A1 + B1 +
279 * (B0 + B1) * 2^224.