Lines Matching +full:ssi +full:- +full:all
2 * Copyright (C) 2017 - This file is part of libecc project
6 * Arnaud EBALARD <arnaud.ebalard@ssi.gouv.fr>
7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr>
10 * Nicolas VIVET <nicolas.vivet@ssi.gouv.fr>
11 * Karim KHALFALLAH <karim.khalfallah@ssi.gouv.fr>
22 * Compute out = (in1 * in2) & (2^(WORD_BYTES * wlimits) - 1).
24 * The function is constant time for all sets of parameters of given
28 * algorithm (Karatsuba, Toom-Cook, or FFT based algorithms)
34 * Portability: in order for the code to be portable, all word by
42 * The function returns 0 on succes, -1 on error.
56 for (i = 0; i < in1->wlen; i++) { in _nn_mul_low()
60 for (j = 0; j < in2->wlen; j++) { in _nn_mul_low()
77 in1->val[i], in2->val[j]); in _nn_mul_low()
88 out->val[pos] = (word_t)(out->val[pos] + prod_low); in _nn_mul_low()
89 carry = (word_t)(prod_high + (out->val[pos] < prod_low)); in _nn_mul_low()
97 out->val[pos + 1] = (word_t)(out->val[pos + 1] + carry); in _nn_mul_low()
144 * The function returns 0 on success, -1 on error.
154 ret = nn_mul_low(out, in1, in2, (u8)(in1->wlen + in2->wlen)); in nn_mul()
167 * The function returns 0 on success, -1 on error.
178 * returns 0 on success, -1 on error.