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 // pcpgfpxinitbinomial.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 /*F* 58 // Name: ippsGFpxInitBinomial 59 // 60 // Purpose: initializes finite field extension GF(p^d) 61 // 62 // Returns: Reason: 63 // ippStsNullPtrErr NULL == pGFpx 64 // NULL == pGroundGF 65 // NULL == pGroundElm 66 // NULL == pGFpMethod 67 // 68 // ippStsContextMatchErr incorrect pGroundGF's context ID 69 // incorrect pGroundElm's context ID 70 // 71 // ippStsOutOfRangeErr size of pGroundElm does not equal to size of pGroundGF element 72 // 73 // ippStsBadArgErr IPP_MIN_GF_EXTDEG > extDeg || extDeg > IPP_MAX_GF_EXTDEG 74 // (IPP_MIN_GF_EXTDEG==2, IPP_MAX_GF_EXTDEG==8) 75 // 76 // cpID_Poly!=pGFpMethod->modulusID -- method does not refferenced to polynomial one 77 // pGFpMethod->modulusBitDeg!=extDeg -- fixed method does not match to degree extension 78 // 79 // ippStsNoErr no error 80 // 81 // Parameters: 82 // pGroundGF pointer to the context of the finite field is being extension 83 // extDeg degree of extension 84 // pGroundElm pointer to the IppsGFpElement context containing the trailing coefficient of the field binomial. 85 // pGFpMethod pointer to the basic arithmetic metods 86 // pGFpx pointer to Finite Field context is being initialized 87 *F*/ 88 IPPFUN(IppStatus, ippsGFpxInitBinomial,(const IppsGFpState* pGroundGF, int extDeg, 89 const IppsGFpElement* pGroundElm, 90 const IppsGFpMethod* pGFpMethod, 91 IppsGFpState* pGFpx)) 92 { 93 IPP_BAD_PTR4_RET(pGFpx, pGroundGF, pGroundElm, pGFpMethod); 94 95 pGFpx = (IppsGFpState*)( IPP_ALIGNED_PTR(pGFpx, GFP_ALIGNMENT) ); 96 pGroundGF = (IppsGFpState*)( IPP_ALIGNED_PTR(pGroundGF, GFP_ALIGNMENT) ); 97 IPP_BADARG_RET( !GFP_TEST_ID(pGroundGF), ippStsContextMatchErr ); 98 99 IPP_BADARG_RET( !GFPE_TEST_ID(pGroundElm), ippStsContextMatchErr ); 100 IPP_BADARG_RET(GFPE_ROOM(pGroundElm)!=GFP_FELEN(GFP_PMA(pGroundGF)), ippStsOutOfRangeErr); 101 102 IPP_BADARG_RET( extDeg<IPP_MIN_GF_EXTDEG || extDeg>IPP_MAX_GF_EXTDEG, ippStsBadArgErr); 103 104 /* test method is binomial based */ 105 IPP_BADARG_RET(cpID_Binom != (pGFpMethod->modulusID & cpID_Binom), ippStsBadArgErr); 106 107 /* test if method assums fixed degree extension */ 108 IPP_BADARG_RET(pGFpMethod->modulusBitDeg && (extDeg!=pGFpMethod->modulusBitDeg), ippStsBadArgErr); 109 110 /* init context */ 111 InitGFpxCtx(pGroundGF, extDeg, pGFpMethod, pGFpx); 112 113 /* store low-order coefficient of irresucible into the context */ 114 cpGFpElementCopy(GFP_MODULUS(GFP_PMA(pGFpx)), GFPE_DATA(pGroundElm), GFP_FELEN(GFP_PMA(pGroundGF))); 115 116 return ippStsNoErr; 117 } 118