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 // Operations over GF(p) ectension. 44 // 45 // Context: 46 // pcpgfpxinit.c() 47 // 48 */ 49 50 #include "owndefs.h" 51 #include "owncp.h" 52 #include "pcpgfpstuff.h" 53 #include "pcpgfpxstuff.h" 54 #include "pcptool.h" 55 56 57 58 /*F* 59 // Name: ippsGFpxInit 60 // 61 // Purpose: initializes finite field extension GF(p^d) 62 // 63 // Returns: Reason: 64 // ippStsNullPtrErr NULL == pGFpx 65 // NULL == pGroundGF 66 // NULL == ppGroundElm 67 // NULL == pGFpMethod 68 // 69 // ippStsContextMatchErr incorrect pGroundGF's context ID 70 // incorrect ppGroundElm[i]'s context ID 71 // 72 // ippStsOutOfRangeErr size of ppGroundElm[i] does not equal to size of pGroundGF element 73 // 74 // ippStsBadArgErr IPP_MIN_GF_EXTDEG > extDeg || extDeg > IPP_MAX_GF_EXTDEG 75 // (IPP_MIN_GF_EXTDEG==2, IPP_MAX_GF_EXTDEG==8) 76 // 1>nElm || nElm>extDeg 77 // 78 // cpID_Poly!=pGFpMethod->modulusID -- method does not refferenced to polynomial one 79 // pGFpMethod->modulusBitDeg!=extDeg -- fixed method does not match to degree extension 80 // 81 // ippStsNoErr no error 82 // 83 // Parameters: 84 // pGroundGF pointer to the context of the finite field is being extension 85 // extDeg degree of extension 86 // ppGroundElm[] pointer to the array of extension field polynomial 87 // nElm number of coefficients above 88 // pGFpMethod pointer to the basic arithmetic metods 89 // pGFpx pointer to Finite Field context is being initialized 90 *F*/ 91 IPPFUN(IppStatus, ippsGFpxInit,(const IppsGFpState* pGroundGF, int extDeg, 92 const IppsGFpElement* const ppGroundElm[], int nElm, 93 const IppsGFpMethod* pGFpMethod, IppsGFpState* pGFpx)) 94 { 95 IPP_BAD_PTR4_RET(pGFpx, pGroundGF, ppGroundElm, pGFpMethod); 96 97 pGFpx = (IppsGFpState*)( IPP_ALIGNED_PTR(pGFpx, GFP_ALIGNMENT) ); 98 pGroundGF = (IppsGFpState*)( IPP_ALIGNED_PTR(pGroundGF, GFP_ALIGNMENT) ); 99 IPP_BADARG_RET( !GFP_TEST_ID(pGroundGF), ippStsContextMatchErr ); 100 101 /* test extension degree */ 102 IPP_BADARG_RET( extDeg<IPP_MIN_GF_EXTDEG || extDeg>IPP_MAX_GF_EXTDEG, ippStsBadArgErr); 103 /* coeffs at (x^0), (x^1), ..., (x^(deg-1)) passed acually */ 104 /* considering normilized f(x), the coeff at (x^deg) is 1 and so could neither stored no passed */ 105 /* test if 1<=nElm<=extDeg */ 106 IPP_BADARG_RET( 1>nElm || nElm>extDeg, ippStsBadArgErr); 107 108 /* test if method is polynomial based */ 109 IPP_BADARG_RET(cpID_Poly != (pGFpMethod->modulusID & cpID_Poly), ippStsBadArgErr); 110 /* test if method is fixed polynomial based */ 111 IPP_BADARG_RET(pGFpMethod->modulusBitDeg && (pGFpMethod->modulusBitDeg!=extDeg), ippStsBadArgErr); 112 113 InitGFpxCtx(pGroundGF, extDeg, pGFpMethod, pGFpx); 114 115 { 116 BNU_CHUNK_T* pPoly = GFP_MODULUS(GFP_PMA(pGFpx)); 117 int polyTermlen = GFP_FELEN(GFP_PMA(pGroundGF)); 118 int n; 119 for(n=0; n<nElm; n++, pPoly+=polyTermlen) { 120 const IppsGFpElement* pGroundElm = ppGroundElm[n]; 121 122 /* test element */ 123 IPP_BAD_PTR1_RET(pGroundElm); 124 IPP_BADARG_RET(!GFPE_TEST_ID(pGroundElm), ippStsContextMatchErr); 125 IPP_BADARG_RET(GFPE_ROOM(pGroundElm)!=polyTermlen, ippStsOutOfRangeErr); 126 127 /* copy element */ 128 cpGFpElementCopy(pPoly, GFPE_DATA(pGroundElm), polyTermlen); 129 } 130 } 131 132 return ippStsNoErr; 133 } 134