1*0957b409SSimon J. Gerraty /*
2*0957b409SSimon J. Gerraty * Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
3*0957b409SSimon J. Gerraty *
4*0957b409SSimon J. Gerraty * Permission is hereby granted, free of charge, to any person obtaining
5*0957b409SSimon J. Gerraty * a copy of this software and associated documentation files (the
6*0957b409SSimon J. Gerraty * "Software"), to deal in the Software without restriction, including
7*0957b409SSimon J. Gerraty * without limitation the rights to use, copy, modify, merge, publish,
8*0957b409SSimon J. Gerraty * distribute, sublicense, and/or sell copies of the Software, and to
9*0957b409SSimon J. Gerraty * permit persons to whom the Software is furnished to do so, subject to
10*0957b409SSimon J. Gerraty * the following conditions:
11*0957b409SSimon J. Gerraty *
12*0957b409SSimon J. Gerraty * The above copyright notice and this permission notice shall be
13*0957b409SSimon J. Gerraty * included in all copies or substantial portions of the Software.
14*0957b409SSimon J. Gerraty *
15*0957b409SSimon J. Gerraty * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
16*0957b409SSimon J. Gerraty * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
17*0957b409SSimon J. Gerraty * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
18*0957b409SSimon J. Gerraty * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
19*0957b409SSimon J. Gerraty * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
20*0957b409SSimon J. Gerraty * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
21*0957b409SSimon J. Gerraty * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22*0957b409SSimon J. Gerraty * SOFTWARE.
23*0957b409SSimon J. Gerraty */
24*0957b409SSimon J. Gerraty
25*0957b409SSimon J. Gerraty #include "inner.h"
26*0957b409SSimon J. Gerraty
27*0957b409SSimon J. Gerraty /* see inner.h */
28*0957b409SSimon J. Gerraty void
br_i32_modpow(uint32_t * x,const unsigned char * e,size_t elen,const uint32_t * m,uint32_t m0i,uint32_t * t1,uint32_t * t2)29*0957b409SSimon J. Gerraty br_i32_modpow(uint32_t *x,
30*0957b409SSimon J. Gerraty const unsigned char *e, size_t elen,
31*0957b409SSimon J. Gerraty const uint32_t *m, uint32_t m0i, uint32_t *t1, uint32_t *t2)
32*0957b409SSimon J. Gerraty {
33*0957b409SSimon J. Gerraty size_t mlen;
34*0957b409SSimon J. Gerraty uint32_t k;
35*0957b409SSimon J. Gerraty
36*0957b409SSimon J. Gerraty /*
37*0957b409SSimon J. Gerraty * 'mlen' is the length of m[] expressed in bytes (including
38*0957b409SSimon J. Gerraty * the "bit length" first field).
39*0957b409SSimon J. Gerraty */
40*0957b409SSimon J. Gerraty mlen = ((m[0] + 63) >> 5) * sizeof m[0];
41*0957b409SSimon J. Gerraty
42*0957b409SSimon J. Gerraty /*
43*0957b409SSimon J. Gerraty * Throughout the algorithm:
44*0957b409SSimon J. Gerraty * -- t1[] is in Montgomery representation; it contains x, x^2,
45*0957b409SSimon J. Gerraty * x^4, x^8...
46*0957b409SSimon J. Gerraty * -- The result is accumulated, in normal representation, in
47*0957b409SSimon J. Gerraty * the x[] array.
48*0957b409SSimon J. Gerraty * -- t2[] is used as destination buffer for each multiplication.
49*0957b409SSimon J. Gerraty *
50*0957b409SSimon J. Gerraty * Note that there is no need to call br_i32_from_monty().
51*0957b409SSimon J. Gerraty */
52*0957b409SSimon J. Gerraty memcpy(t1, x, mlen);
53*0957b409SSimon J. Gerraty br_i32_to_monty(t1, m);
54*0957b409SSimon J. Gerraty br_i32_zero(x, m[0]);
55*0957b409SSimon J. Gerraty x[1] = 1;
56*0957b409SSimon J. Gerraty for (k = 0; k < ((uint32_t)elen << 3); k ++) {
57*0957b409SSimon J. Gerraty uint32_t ctl;
58*0957b409SSimon J. Gerraty
59*0957b409SSimon J. Gerraty ctl = (e[elen - 1 - (k >> 3)] >> (k & 7)) & 1;
60*0957b409SSimon J. Gerraty br_i32_montymul(t2, x, t1, m, m0i);
61*0957b409SSimon J. Gerraty CCOPY(ctl, x, t2, mlen);
62*0957b409SSimon J. Gerraty br_i32_montymul(t2, t1, t1, m, m0i);
63*0957b409SSimon J. Gerraty memcpy(t1, t2, mlen);
64*0957b409SSimon J. Gerraty }
65*0957b409SSimon J. Gerraty }
66