Lines Matching refs:so
315 * so that every element p of GF(2)[x]/w(x) is either 0 or equal to (x)^n for
321 * 3. pq=(x^m)(x^n)=x^(m+n), so add m and n and find pq
325 * one of my operands is always a constant, so the poly_to_exp lookup on it
326 * is done in advance; I included the original values in the comments so
330 * exponents I'll ever see are 254 (variable) and 237 (constant), so they'll
332 * so that I don't have to do mod-255 reduction in the exponent arithmetic.
337 * statements so that each if covers four group multiplications. */
515 ctx->s[2][i] = mds[2][q1[q0[q0[(a) ^ sc] ^ sg] ^ sk] ^ so]; \
582 byte si = 0, sj = 0, sk = 0, sl = 0, sm = 0, sn = 0, so = 0, sp = 0;
638 CALC_S (sm, sn, so, sp, 24, 0x00, 0x2D, 0x01, 0x2D); /* 01 A4 02 A4 */
639 CALC_S (sm, sn, so, sp, 25, 0x2D, 0xA4, 0x44, 0x8A); /* A4 56 A1 55 */
640 CALC_S (sm, sn, so, sp, 26, 0x8A, 0xD5, 0xBF, 0xD1); /* 55 82 FC 87 */
641 CALC_S (sm, sn, so, sp, 27, 0xD1, 0x7F, 0x3D, 0x99); /* 87 F3 C1 5A */
642 CALC_S (sm, sn, so, sp, 28, 0x99, 0x46, 0x66, 0x96); /* 5A 1E 47 58 */
643 CALC_S (sm, sn, so, sp, 29, 0x96, 0x3C, 0x5B, 0xED); /* 58 C6 AE DB */
644 CALC_S (sm, sn, so, sp, 30, 0xED, 0x37, 0x4F, 0xE0); /* DB 68 3D 9E */
645 CALC_S (sm, sn, so, sp, 31, 0xE0, 0xD0, 0x8C, 0x17); /* 9E E5 19 03 */
934 * cipher, so as to be sure of testing all the table entries pretty
935 * thoroughly. We keep changing the keys so as to get a more meaningful