• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*******************************************************************************
2 * Copyright 2010-2018 Intel Corporation
3 * All Rights Reserved.
4 *
5 * If this  software was obtained  under the  Intel Simplified  Software License,
6 * the following terms apply:
7 *
8 * The source code,  information  and material  ("Material") contained  herein is
9 * owned by Intel Corporation or its  suppliers or licensors,  and  title to such
10 * Material remains with Intel  Corporation or its  suppliers or  licensors.  The
11 * Material  contains  proprietary  information  of  Intel or  its suppliers  and
12 * licensors.  The Material is protected by  worldwide copyright  laws and treaty
13 * provisions.  No part  of  the  Material   may  be  used,  copied,  reproduced,
14 * modified, published,  uploaded, posted, transmitted,  distributed or disclosed
15 * in any way without Intel's prior express written permission.  No license under
16 * any patent,  copyright or other  intellectual property rights  in the Material
17 * is granted to  or  conferred  upon  you,  either   expressly,  by implication,
18 * inducement,  estoppel  or  otherwise.  Any  license   under such  intellectual
19 * property rights must be express and approved by Intel in writing.
20 *
21 * Unless otherwise agreed by Intel in writing,  you may not remove or alter this
22 * notice or  any  other  notice   embedded  in  Materials  by  Intel  or Intel's
23 * suppliers or licensors in any way.
24 *
25 *
26 * If this  software  was obtained  under the  Apache License,  Version  2.0 (the
27 * "License"), the following terms apply:
28 *
29 * You may  not use this  file except  in compliance  with  the License.  You may
30 * obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
31 *
32 *
33 * Unless  required  by   applicable  law  or  agreed  to  in  writing,  software
34 * distributed under the License  is distributed  on an  "AS IS"  BASIS,  WITHOUT
35 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
36 *
37 * See the   License  for the   specific  language   governing   permissions  and
38 * limitations under the License.
39 *******************************************************************************/
40 
41 /*
42 //     Intel(R) Integrated Performance Primitives. Cryptography Primitives.
43 //
44 //     Context:
45 //        cpMontMultiExpInitArray()
46 //
47 */
48 
49 #include "owndefs.h"
50 #include "owncp.h"
51 #include "pcpbn.h"
52 #include "pcpmontgomery.h"
53 
54 /*
55 //               Intel(R) Integrated Performance Primitives
56 //                   Cryptographic Primitives (ippcp)
57 //
58 //
59 */
60 /*
61 // Initialize multi-exponentiation computation
62 //    y = x[0]^e[0] * x[1]^e[1] *...* x[numItems-1]^e[numItems-1] mod M
63 //
64 // Output:
65 //    - table pTbl of precomuted values pTbl[i] = x[0]^i[0] * x[1]^i[1] *...* x[numItems-1]^i[numItems-1] mod M,
66 //      where i[0], i[1], ..., i[numItems-1] are bits of i value;
67 //
68 // Input:
69 //    - array of pointers to the BNU bases x[0], x[1],...,x[numItems-1]
70 //    - pointer to the Montgomery engine
71 */
cpMontMultiExpInitArray(BNU_CHUNK_T * pPrecomTbl,const BNU_CHUNK_T ** ppX,cpSize xItemBitSize,cpSize numItems,gsModEngine * pModEngine)72 void cpMontMultiExpInitArray(BNU_CHUNK_T* pPrecomTbl,
73               const BNU_CHUNK_T** ppX, cpSize xItemBitSize,
74               cpSize numItems,
75               gsModEngine* pModEngine)
76 {
77    cpSize sizeM = MOD_LEN(pModEngine);
78 
79    cpSize i, base;
80    cpSize sizeX = BITS_BNU_CHUNK(xItemBitSize);
81 
82    /* buff[0] = mont(1) */
83    COPY_BNU(pPrecomTbl, MOD_MNT_R(pModEngine), sizeM);
84    /* buff[1] = X[0] */
85    ZEXPAND_COPY_BNU(pPrecomTbl+sizeM, sizeM, ppX[0], sizeX);
86 
87    for(i=1,base=2*sizeM; i<numItems; i++,base*=2) {
88       /* buf[base] = X[i] */
89       ZEXPAND_COPY_BNU(pPrecomTbl+base, sizeM, ppX[i], sizeX);
90 
91       {
92          int nPasses = 1;
93          int step = base/2;
94 
95          int k;
96          for(k=i-1; k>=0; k--) {
97             const BNU_CHUNK_T* pXterm = ppX[k];
98 
99             BNU_CHUNK_T* pBufferBase = pPrecomTbl+base;
100             int n;
101             for(n=1; n<=nPasses; n++, pBufferBase+=2*step) {
102                cpMontMul_BNU_EX(pBufferBase+step,
103                                 pBufferBase,      sizeM,
104                                 pXterm,           sizeX,
105                                 pModEngine);
106             }
107 
108             nPasses *= 2;
109             step /= 2;
110          }
111       }
112    }
113 }
114