1 /*******************************************************************************
2 * Copyright 2002-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 // Purpose:
43 // Intel(R) Integrated Performance Primitives. Cryptography Primitives.
44 // Internal Unsigned arithmetic
45 //
46 // Contents:
47 // cpSqrAdc_BNU_school()
48 //
49 */
50
51 #include "owncp.h"
52 #include "pcpbnuarith.h"
53 #include "pcpbnumisc.h"
54
55
56 /*F*
57 // Name: cpSqrAdc_BNU_school
58 //
59 // Purpose: Square BigNums.
60 //
61 // Returns:
62 // extension of result of square BigNum
63 //
64 // Parameters:
65 // pA source BigNum
66 // pR resultant BigNum
67 // nsA size of A
68 //
69 *F*/
70 #if defined(_USE_C_cpSqrAdc_BNU_school_)
71 #pragma message ("C version of cpSqrAdc_BNU_school: ON")
72 #else
73 #pragma message ("C version of cpSqrAdc_BNU_school: OFF")
74 #endif
75
76 #if !((_IPP==_IPP_W7) || \
77 (_IPP==_IPP_T7) || \
78 (_IPP==_IPP_V8) || \
79 (_IPP==_IPP_P8) || \
80 (_IPP>=_IPP_G9) || \
81 (_IPP==_IPP_S8) || \
82 (_IPP32E==_IPP32E_M7) || \
83 (_IPP32E==_IPP32E_U8) || \
84 (_IPP32E==_IPP32E_Y8) || \
85 (_IPP32E>=_IPP32E_E9) || \
86 (_IPP32E==_IPP32E_N8)) || \
87 defined(_USE_C_cpSqrAdc_BNU_school_)
cpSqrAdc_BNU_school(BNU_CHUNK_T * pR,const BNU_CHUNK_T * pA,cpSize nsA)88 BNU_CHUNK_T cpSqrAdc_BNU_school(BNU_CHUNK_T* pR, const BNU_CHUNK_T* pA, cpSize nsA)
89 {
90 cpSize i;
91
92 BNU_CHUNK_T extension;
93 BNU_CHUNK_T rH, rL;
94
95 /* init result */
96 pR[0] = 0;
97 for(i=1, extension=0; i<nsA; i++) {
98 MUL_AB(rH, rL, pA[i], pA[0]);
99 ADD_AB(extension, pR[i], rL, extension);
100 extension += rH;
101 }
102 pR[i] = extension;
103
104 /* add other a[i]*a[j] */
105 for(i=1; i<nsA-1; i++) {
106 BNU_CHUNK_T a = pA[i];
107 cpSize j;
108 for(j=i+1, extension=0; j<nsA; j++) {
109 MUL_AB(rH, rL, pA[j], a);
110 ADD_ABC(extension, pR[i+j], rL, pR[i+j], extension);
111 extension += rH;
112 }
113 pR[i+j] = extension;
114 }
115
116 /* double a[i]*a[j] */
117 for(i=1, extension=0; i<(2*nsA-1); i++) {
118 ADD_ABC(extension, pR[i], pR[i], pR[i], extension);
119 }
120 pR[i] = extension;
121
122 /* add a[i]^2 */
123 for(i=0, extension=0; i<nsA; i++) {
124 MUL_AB(rH, rL, pA[i], pA[i]);
125 ADD_ABC(extension, pR[2*i], pR[2*i], rL, extension);
126 ADD_ABC(extension, pR[2*i+1], pR[2*i+1], rH, extension);
127 }
128 return pR[2*nsA-1];
129 }
130 #endif
131