Lines Matching defs:in
9 * you may not use this file except in compliance with the License.
14 * Unless required by applicable law or agreed to in writing, software
37 * input/output buffer ('num' points in projective form, i.e. three
47 *in),
50 *in),
53 *in),
61 *in),
66 *in))
131 * significant bit), and recodes them into a signed digit for use in fast point
140 * pt. 2 (1951), pp. 236-240), in that case for multiplication of integers.
143 * handling of signed factors given in two's complement; but it has since been
151 * of a nonnegative integer (b_k in {0, 1}), rewrite it in digits 0, 1, -1
161 * This representation from Booth's paper has since appeared in the
172 * in the 1990s), and left-to-right sliding windows yield a left-to-right
176 * To prevent leaking information through side channels in point multiplication,
178 * as in wNAFs won't do, we need their fixed-window equivalent -- which is a few
180 * MacSorley ("High-speed arithmetic in binary computers", Proc. IRE, vol. 49
181 * (1961), pp. 67-91), in a radix-2^5 setting. That is, we always combine five
196 * value, in the range 0 .. 8). Note that this integer essentially provides the
203 unsigned char *digit, unsigned char in)
207 s = ~((in >> 5) - 1); /* sets all bits to MSB(in), 'in' seen as
209 d = (1 << 6) - in - 1;
210 d = (d & s) | (in & ~s);