Lines Matching full:announced

1079  *  -- x[0] contains the "announced bit length" of the integer
1085  * The announced bit length specifies the number of bits that are
1091  * depend on the announced bit length, but not on the actual word
1092  * values. For modular integers, the announced bit length of any integer
1118  * integer MUST be lower than m[]; the announced bit length written in
1124  * still with the announced bit length of m[]).
1127  * only of 'len' and the announced bit length of m. Whether x fits or
1135  * in x[] and its announced bit length is set to be equal to that of m[].
1139  * CT: only announced bit lengths leak, not values of x, a or m.
1145  * reduce it modulo the provided modulus m[]. The announced bit length
1163  * function assumes that x[] and m[] have the same announced bit
1164  * length, and the announced bit length of m[] matches its true
1169  * CT: only the common announced bit length of x and m leaks, not
1177  * to the announced bit length of a[].
1202  * arrays a[] and b[] MUST have the same announced bit length.
1211  * The arrays a[] and b[] MUST have the same announced bit length.
1218  * Compute d+a*b, result in d. The initial announced bit length of d[]
1221  * resulting announced bit length of d[] will be the sum of the announced
1231  * Zeroize an integer. The announced bit length is set to the provided
1248  * MUST be lower than m[], but with the same announced bit length.
1254  * integer x[] MUST be lower than m[], but with the same announced bit
1275  * (same announced bit length, lower value). m[] MUST be odd. The
1294  *  -- x[0] encodes the array length and the "announced bit length"
1295  *     of the integer: namely, if the announced bit length is k,
1303  * The announced bit length specifies the number of bits that are
1309  * depend on the announced bit length, but not on the actual word
1310  * values. For modular integers, the announced bit length of any integer
1324  * arrays a[] and b[] MUST have the same announced bit length.
1333  * The arrays a[] and b[] MUST have the same announced bit length.
1353  * announced bit length (x[0]), but all words of x[] corresponding to
1362  * integer MUST be lower than m[]; the (encoded) announced bit length
1368  * still with the announced bit length of m[]).
1371  * only of 'len' and the announced bit length of m. Whether x fits or
1378  * Zeroize an integer. The announced bit length is set to the provided
1397  * in x[] and its announced bit length is set to be equal to that of m[].
1401  * CT: only announced bit lengths leak, not values of x, a or m.
1407  * reduce it modulo the provided modulus m[]. The announced bit length
1417  * function assumes that x[] and m[] have the same announced bit
1418  * length, the announced bit length of m[] matches its true
1424  * CT: only the common announced bit length of x and m leaks, not
1456  * MUST be lower than m[], but with the same announced bit length.
1462  * integer x[] MUST be lower than m[], but with the same announced bit
1471  * (same announced bit length, lower value). m[] MUST be odd. The
1483  * (same announced bit length, lower value). m[] MUST be odd. The
1501  * Compute d+a*b, result in d. The initial announced bit length of d[]
1504  * resulting announced bit length of d[] will be the sum of the announced
1515  * m-1, and have the same announced bit length as m. Modulus m must be