Path: blob/main/contrib/bearssl/src/int/i31_modpow.c
39483 views
/*1* Copyright (c) 2016 Thomas Pornin <[email protected]>2*3* Permission is hereby granted, free of charge, to any person obtaining4* a copy of this software and associated documentation files (the5* "Software"), to deal in the Software without restriction, including6* without limitation the rights to use, copy, modify, merge, publish,7* distribute, sublicense, and/or sell copies of the Software, and to8* permit persons to whom the Software is furnished to do so, subject to9* the following conditions:10*11* The above copyright notice and this permission notice shall be12* included in all copies or substantial portions of the Software.13*14* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,15* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF16* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND17* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS18* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN19* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN20* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE21* SOFTWARE.22*/2324#include "inner.h"2526/* see inner.h */27void28br_i31_modpow(uint32_t *x,29const unsigned char *e, size_t elen,30const uint32_t *m, uint32_t m0i, uint32_t *t1, uint32_t *t2)31{32size_t mlen;33uint32_t k;3435/*36* 'mlen' is the length of m[] expressed in bytes (including37* the "bit length" first field).38*/39mlen = ((m[0] + 63) >> 5) * sizeof m[0];4041/*42* Throughout the algorithm:43* -- t1[] is in Montgomery representation; it contains x, x^2,44* x^4, x^8...45* -- The result is accumulated, in normal representation, in46* the x[] array.47* -- t2[] is used as destination buffer for each multiplication.48*49* Note that there is no need to call br_i32_from_monty().50*/51memcpy(t1, x, mlen);52br_i31_to_monty(t1, m);53br_i31_zero(x, m[0]);54x[1] = 1;55for (k = 0; k < ((uint32_t)elen << 3); k ++) {56uint32_t ctl;5758ctl = (e[elen - 1 - (k >> 3)] >> (k & 7)) & 1;59br_i31_montymul(t2, x, t1, m, m0i);60CCOPY(ctl, x, t2, mlen);61br_i31_montymul(t2, t1, t1, m, m0i);62memcpy(t1, t2, mlen);63}64}656667