1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*******************************************************************************
* Copyright 2010-2018 Intel Corporation
* All Rights Reserved.
*
* If this software was obtained under the Intel Simplified Software License,
* the following terms apply:
*
* The source code, information and material ("Material") contained herein is
* owned by Intel Corporation or its suppliers or licensors, and title to such
* Material remains with Intel Corporation or its suppliers or licensors. The
* Material contains proprietary information of Intel or its suppliers and
* licensors. The Material is protected by worldwide copyright laws and treaty
* provisions. No part of the Material may be used, copied, reproduced,
* modified, published, uploaded, posted, transmitted, distributed or disclosed
* in any way without Intel's prior express written permission. No license under
* any patent, copyright or other intellectual property rights in the Material
* is granted to or conferred upon you, either expressly, by implication,
* inducement, estoppel or otherwise. Any license under such intellectual
* property rights must be express and approved by Intel in writing.
*
* Unless otherwise agreed by Intel in writing, you may not remove or alter this
* notice or any other notice embedded in Materials by Intel or Intel's
* suppliers or licensors in any way.
*
*
* If this software was obtained under the Apache License, Version 2.0 (the
* "License"), the following terms apply:
*
* You may not use this file except in compliance with the License. You may
* obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
*
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*
* See the License for the specific language governing permissions and
* limitations under the License.
*******************************************************************************/
/*
// Intel(R) Integrated Performance Primitives. Cryptography Primitives.
// Operations over GF(p) ectension.
//
// Context:
// pcpgfpxinit.c()
//
*/
#include "owndefs.h"
#include "owncp.h"
#include "pcpgfpstuff.h"
#include "pcpgfpxstuff.h"
#include "pcptool.h"
/*F*
// Name: ippsGFpxInit
//
// Purpose: initializes finite field extension GF(p^d)
//
// Returns: Reason:
// ippStsNullPtrErr NULL == pGFpx
// NULL == pGroundGF
// NULL == ppGroundElm
// NULL == pGFpMethod
//
// ippStsContextMatchErr incorrect pGroundGF's context ID
// incorrect ppGroundElm[i]'s context ID
//
// ippStsOutOfRangeErr size of ppGroundElm[i] does not equal to size of pGroundGF element
//
// ippStsBadArgErr IPP_MIN_GF_EXTDEG > extDeg || extDeg > IPP_MAX_GF_EXTDEG
// (IPP_MIN_GF_EXTDEG==2, IPP_MAX_GF_EXTDEG==8)
// 1>nElm || nElm>extDeg
//
// cpID_Poly!=pGFpMethod->modulusID -- method does not refferenced to polynomial one
// pGFpMethod->modulusBitDeg!=extDeg -- fixed method does not match to degree extension
//
// ippStsNoErr no error
//
// Parameters:
// pGroundGF pointer to the context of the finite field is being extension
// extDeg degree of extension
// ppGroundElm[] pointer to the array of extension field polynomial
// nElm number of coefficients above
// pGFpMethod pointer to the basic arithmetic metods
// pGFpx pointer to Finite Field context is being initialized
*F*/
IPPFUN(IppStatus, ippsGFpxInit,(const IppsGFpState* pGroundGF, int extDeg,
const IppsGFpElement* const ppGroundElm[], int nElm,
const IppsGFpMethod* pGFpMethod, IppsGFpState* pGFpx))
{
IPP_BAD_PTR4_RET(pGFpx, pGroundGF, ppGroundElm, pGFpMethod);
pGFpx = (IppsGFpState*)( IPP_ALIGNED_PTR(pGFpx, GFP_ALIGNMENT) );
pGroundGF = (IppsGFpState*)( IPP_ALIGNED_PTR(pGroundGF, GFP_ALIGNMENT) );
IPP_BADARG_RET( !GFP_TEST_ID(pGroundGF), ippStsContextMatchErr );
/* test extension degree */
IPP_BADARG_RET( extDeg<IPP_MIN_GF_EXTDEG || extDeg>IPP_MAX_GF_EXTDEG, ippStsBadArgErr);
/* coeffs at (x^0), (x^1), ..., (x^(deg-1)) passed acually */
/* considering normilized f(x), the coeff at (x^deg) is 1 and so could neither stored no passed */
/* test if 1<=nElm<=extDeg */
IPP_BADARG_RET( 1>nElm || nElm>extDeg, ippStsBadArgErr);
/* test if method is polynomial based */
IPP_BADARG_RET(cpID_Poly != (pGFpMethod->modulusID & cpID_Poly), ippStsBadArgErr);
/* test if method is fixed polynomial based */
IPP_BADARG_RET(pGFpMethod->modulusBitDeg && (pGFpMethod->modulusBitDeg!=extDeg), ippStsBadArgErr);
InitGFpxCtx(pGroundGF, extDeg, pGFpMethod, pGFpx);
{
BNU_CHUNK_T* pPoly = GFP_MODULUS(GFP_PMA(pGFpx));
int polyTermlen = GFP_FELEN(GFP_PMA(pGroundGF));
int n;
for(n=0; n<nElm; n++, pPoly+=polyTermlen) {
const IppsGFpElement* pGroundElm = ppGroundElm[n];
/* test element */
IPP_BAD_PTR1_RET(pGroundElm);
IPP_BADARG_RET(!GFPE_TEST_ID(pGroundElm), ippStsContextMatchErr);
IPP_BADARG_RET(GFPE_ROOM(pGroundElm)!=polyTermlen, ippStsOutOfRangeErr);
/* copy element */
cpGFpElementCopy(pPoly, GFPE_DATA(pGroundElm), polyTermlen);
}
}
return ippStsNoErr;
}
|