Lines Matching full:128
12 * than 128. We then compute p(x) = h^8m_0 + ... + h^1m_7 where multiplication
16 * modulus g(x) = x^128 + x^127 + x^126 + x^121 + 1.
54 * Performs schoolbook1_iteration on two lists of 128-bit polynomials of length
66 * Computes the product of two 128-bit polynomials at the memory locations
128 * Computes the 128-bit reduction of PH : PL. Stores the result in dest.
131 * x^128 + x^127 + x^126 + x^121 + 1.
134 * product of two 128-bit polynomials in Montgomery form. We need to reduce it
136 * of x^128, this product has two extra factors of x^128. To get it back into
137 * Montgomery form, we need to remove one of these factors by dividing by x^128.
140 * the low 128 bits P_1 : P_0, leaving just the high 128 bits. Since the low
141 * bits are zero, the polynomial division by x^128 can be done by right shifting.
145 * only do 64x64 bit multiplications, so split P_0 * g(x) into x^128 * P_0 +
151 * 128-255, giving the answer in bits 128-255. This time, we need to cancel P_1
159 * p(x) / x^{128} mod g(x) = P_3 + P_1 + T_0 + V_1 : P_2 + P_0 + T_1 + V_0
264 * Perform montgomery multiplication in GF(2^128) and store result in op1.
266 * Computes op1*op2*x^{-128} mod x^128 + x^127 + x^126 + x^121 + 1