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 // Intel(R) Integrated Performance Primitives 43 // Cryptographic Primitives (ippcp) 44 // 45 // Contents: 46 // ippsMod_BN() 47 // 48 */ 49 50 #include "owndefs.h" 51 #include "owncp.h" 52 #include "pcpbn.h" 53 #include "pcptool.h" 54 55 56 /*F* 57 // Name: ippsMod_BN 58 // 59 // Purpose: reduction BigNum. 60 // 61 // Returns: Reason: 62 // ippStsNullPtrErr pA == NULL 63 // pM == NULL 64 // pR == NULL 65 // ippStsContextMatchErr !BN_VALID_ID(pA) 66 // !BN_VALID_ID(pM) 67 // !BN_VALID_ID(pR) 68 // ippStsOutOfRangeErr pR can not hold result 69 // ippStsBadModulusErr modulus IppsBigNumState* pM 70 // is not a positive integer 71 // ippStsNoErr no errors 72 // 73 // Parameters: 74 // pA source BigNum 75 // pB source BigNum 76 // pR reminder BigNum 77 // 78 // A = Q*M + R, 0 <= R < B 79 // 80 *F*/ 81 IPPFUN(IppStatus, ippsMod_BN, (IppsBigNumState* pA, IppsBigNumState* pM, IppsBigNumState* pR)) 82 { 83 IPP_BAD_PTR3_RET(pA, pM, pR); 84 85 pA = (IppsBigNumState*)( IPP_ALIGNED_PTR(pA, BN_ALIGNMENT) ); 86 IPP_BADARG_RET(!BN_VALID_ID(pA), ippStsContextMatchErr); 87 pM = (IppsBigNumState*)( IPP_ALIGNED_PTR(pM, BN_ALIGNMENT) ); 88 IPP_BADARG_RET(!BN_VALID_ID(pM), ippStsContextMatchErr); 89 pR = (IppsBigNumState*)( IPP_ALIGNED_PTR(pR, BN_ALIGNMENT) ); 90 IPP_BADARG_RET(!BN_VALID_ID(pR), ippStsContextMatchErr); 91 92 IPP_BADARG_RET(BN_NEGATIVE(pM), ippStsBadModulusErr); 93 IPP_BADARG_RET(BN_SIZE(pM)== 1 && BN_NUMBER(pM)[0]==0, ippStsBadModulusErr); 94 95 IPP_BADARG_RET(BN_ROOM(pR)<BN_SIZE(pM), ippStsOutOfRangeErr); 96 97 if(cpEqu_BNU_CHUNK(BN_NUMBER(pA), BN_SIZE(pA), 0)) { 98 BN_SIGN(pR) = ippBigNumPOS; 99 BN_SIZE(pR) = 1; 100 BN_NUMBER(pR)[0] = 0; 101 } 102 103 else { 104 BNU_CHUNK_T* pDataM = BN_NUMBER(pM); 105 cpSize nsM = BN_SIZE(pM); 106 BNU_CHUNK_T* pBuffA = BN_BUFFER(pA); 107 cpSize nsA = BN_SIZE(pA); 108 BNU_CHUNK_T* pDataR = BN_NUMBER(pR); 109 cpSize nsR; 110 111 COPY_BNU(pBuffA, BN_NUMBER(pA), nsA); 112 nsR = cpMod_BNU(pBuffA, nsA, pDataM, nsM); 113 114 COPY_BNU(pDataR, pBuffA, nsR); 115 BN_SIZE(pR) = nsR; 116 BN_SIGN(pR) = ippBigNumPOS; 117 118 if(BN_NEGATIVE(pA) && !(nsR==1 && pDataR[0]==0)) { 119 ZEXPAND_BNU(pDataR, nsR, nsM); 120 cpSub_BNU(pDataR, pDataM, pDataR, nsM); 121 FIX_BNU(pDataR, nsM); 122 BN_SIZE(pR) = nsM; 123 } 124 } 125 126 return ippStsNoErr; 127 } 128
