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). 44 // 45 // Context: 46 // ippsGFpInit 47 // 48 // 49 */ 50 #include "owndefs.h" 51 #include "owncp.h" 52 53 #include "pcpgfpstuff.h" 54 #include "pcpgfpxstuff.h" 55 #include "pcptool.h" 56 57 58 /*F* 59 // Name: ippsGFpInit 60 // 61 // Purpose: initializes prime finite field GF(p) 62 // 63 // Returns: Reason: 64 // ippStsNullPtrErr NULL == pGFpMethod 65 // NULL == pGFp 66 // 67 // ippStsSizeErr !(IPP_MIN_GF_BITSIZE <= primeBitSize <=IPP_MAX_GF_BITSIZE 68 // 69 // ippStsContextMatchErr invalid pPrime->idCtx 70 // 71 // ippStsBadArgErr pGFpMethod != ippsGFpMethod_pXXX() or != ippsGFpMethod_pArb() 72 // prime != pGFpMethod->modulus 73 // prime <0 74 // bitsize(prime) != primeBitSize 75 // prime <IPP_MIN_GF_CHAR 76 // prime is even 77 // 78 // ippStsNoErr no error 79 // 80 // Parameters: 81 // pPrimeBN pointer to the data representation Finite Field element 82 // primeBitSize length of Finite Field data representation array 83 // pGFpMethod pointer to Finite Field Element context 84 // pGFp pointer to Finite Field context is being initialized 85 *F*/ 86 IPPFUN(IppStatus, ippsGFpInit,(const IppsBigNumState* pPrimeBN, int primeBitSize, const IppsGFpMethod* pGFpMethod, IppsGFpState* pGFp)) 87 { 88 IPP_BADARG_RET(!pPrimeBN && !pGFpMethod, ippStsNullPtrErr); 89 90 IPP_BADARG_RET((primeBitSize< IPP_MIN_GF_BITSIZE) || (primeBitSize> IPP_MAX_GF_BITSIZE), ippStsSizeErr); 91 92 /* use ippsGFpInitFixed() if NULL==pPrimeBN */ 93 if(!pPrimeBN) 94 return ippsGFpInitFixed(primeBitSize, pGFpMethod, pGFp); 95 96 /* use ippsGFpInitArbitrary() if NULL==pGFpMethod */ 97 if(!pGFpMethod) 98 return ippsGFpInitArbitrary(pPrimeBN, primeBitSize, pGFp); 99 100 /* test parameters if both pPrimeBN and method are defined */ 101 else { 102 IppStatus sts; 103 104 /* test input prime */ 105 pPrimeBN = (IppsBigNumState*)( IPP_ALIGNED_PTR(pPrimeBN, BN_ALIGNMENT) ); 106 IPP_BADARG_RET(!BN_VALID_ID(pPrimeBN), ippStsContextMatchErr); 107 IPP_BADARG_RET(BN_SIGN(pPrimeBN)!= IppsBigNumPOS, ippStsBadArgErr); /* prime is negative */ 108 IPP_BADARG_RET(BITSIZE_BNU(BN_NUMBER(pPrimeBN),BN_SIZE(pPrimeBN)) != primeBitSize, ippStsBadArgErr); /* primeBitSize == bitsize(prime) */ 109 IPP_BADARG_RET((BN_SIZE(pPrimeBN)==1) && (BN_NUMBER(pPrimeBN)[0]<IPP_MIN_GF_CHAR), ippStsBadArgErr); /* prime < 3 */ 110 IPP_BADARG_RET(0==(BN_NUMBER(pPrimeBN)[0] & 1), ippStsBadArgErr); /* prime is even */ 111 112 /* test if method is prime based */ 113 IPP_BADARG_RET(cpID_Prime!=(pGFpMethod->modulusID & cpID_Prime), ippStsBadArgErr); 114 115 /* test if size of the prime is matched to method's prime */ 116 IPP_BADARG_RET(pGFpMethod->modulusBitDeg && (primeBitSize!=pGFpMethod->modulusBitDeg), ippStsBadArgErr); 117 118 /* if method assumes fixed prime value */ 119 if(pGFpMethod->modulus) { 120 int primeLen = BITS_BNU_CHUNK(primeBitSize); 121 IPP_BADARG_RET(cpCmp_BNU(BN_NUMBER(pPrimeBN), primeLen, pGFpMethod->modulus, primeLen), ippStsBadArgErr); 122 } 123 124 /* init GF */ 125 sts = cpGFpInitGFp(primeBitSize, pGFp); 126 127 /* set up GF and find quadratic nonresidue */ 128 if(ippStsNoErr==sts) { 129 cpGFpSetGFp(BN_NUMBER(pPrimeBN), primeBitSize, pGFpMethod, pGFp); 130 } 131 132 return sts; 133 } 134 } 135