Lines Matching full:integers

48  * These identifiers are small integers, that correspond to the values
90  *      Multiply two curve points by two integers, and return the sum of
105  *     the multipliers (integers). Only the byte length of the provided
109  *   - The multipliers (integers) MUST be lower than the subgroup order.
117  * Internally, such a signature is a pair of modular integers `(r,s)`.
119  * encodings of these two integers, possibly left-padded with zeros so
370 	 * \brief Multiply two points by two integers and add the
390 	 *   - The multiplier integers (`x` and `y`) MUST be non-zero
420  * This implementation internally uses generic code for modular integers,
429  * This implementation internally uses generic code for modular integers,
458  * integers up to 64 bits, with a 128-bit result. This implementation is
476  * integers up to 64 bits, with a 128-bit result. This implementation is
493  * This implementation uses the generic code for modular integers (with
507  * This implementation uses the generic code for modular integers (with
522  * integers up to 15 bits. Due to the specificities of the curve
536  * integers up to 31 bits. Due to the specificities of the curve
550  * integers up to 62 bits, with a 124-bit result. This implementation is
574  * integers up to 64 bits, with a 128-bit result. This implementation is