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 // ippsMAC_BN_I() 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: ippsMAC_BN_I 58 // 59 // Purpose: Multiply and Accumulate BigNums. 60 // 61 // Returns: Reason: 62 // ippStsNullPtrErr pA == NULL 63 // pB == NULL 64 // pR == NULL 65 // ippStsContextMatchErr !BN_VALID_ID(pA) 66 // !BN_VALID_ID(pB) 67 // !BN_VALID_ID(pR) 68 // ippStsOutOfRangeErr pR can not fit result 69 // ippStsNoErr no errors 70 // 71 // Parameters: 72 // pA source BigNum 73 // pB source BigNum 74 // pR resultant BigNum 75 // 76 *F*/ 77 IPPFUN(IppStatus, ippsMAC_BN_I, (IppsBigNumState* pA, IppsBigNumState* pB, IppsBigNumState* pR)) 78 { 79 IPP_BAD_PTR3_RET(pA, pB, pR); 80 81 pA = (IppsBigNumState*)( IPP_ALIGNED_PTR(pA, BN_ALIGNMENT) ); 82 IPP_BADARG_RET(!BN_VALID_ID(pA), ippStsContextMatchErr); 83 pB = (IppsBigNumState*)( IPP_ALIGNED_PTR(pB, BN_ALIGNMENT) ); 84 IPP_BADARG_RET(!BN_VALID_ID(pB), ippStsContextMatchErr); 85 pR = (IppsBigNumState*)( IPP_ALIGNED_PTR(pR, BN_ALIGNMENT) ); 86 IPP_BADARG_RET(!BN_VALID_ID(pR), ippStsContextMatchErr); 87 88 { 89 BNU_CHUNK_T* pDataA = BN_NUMBER(pA); 90 BNU_CHUNK_T* pDataB = BN_NUMBER(pB); 91 92 cpSize nsA = BN_SIZE(pA); 93 cpSize nsB = BN_SIZE(pB); 94 95 cpSize bitSizeA = BITSIZE_BNU(pDataA, nsA); 96 cpSize bitSizeB = BITSIZE_BNU(pDataB, nsB); 97 /* size of temporary pruduct */ 98 cpSize nsP = BITS_BNU_CHUNK(bitSizeA+bitSizeB); 99 100 /* test if multiplicant/multiplier is zero */ 101 if(!bitSizeA || !bitSizeB) return ippStsNoErr; 102 /* test if product can't fit to the result */ 103 IPP_BADARG_RET(BN_ROOM(pR)<nsP, ippStsOutOfRangeErr); 104 105 { 106 BNU_CHUNK_T* pDataR = BN_NUMBER(pR); 107 IppsBigNumSGN sgnR = BN_SIGN(pR); 108 cpSize nsR = BN_SIZE(pR); 109 cpSize room = BN_ROOM(pR); 110 111 /* temporary product */ 112 BNU_CHUNK_T* pDataP = BN_BUFFER(pR); 113 IppsBigNumSGN sgnP = BN_SIGN(pA)==BN_SIGN(pB)? ippBigNumPOS : ippBigNumNEG; 114 115 /* clear the rest of R data buffer */ 116 ZEXPAND_BNU(pDataR, nsR, room); 117 118 /* temporary product */ 119 if(pA==pB) 120 cpSqr_BNU_school(pDataP, pDataA, nsA); 121 else 122 cpMul_BNU_school(pDataP, pDataA, nsA, pDataB, nsB); 123 /* clear the rest of rpoduct */ 124 ZEXPAND_BNU(pDataP, nsP, room); 125 126 if(sgnR==sgnP) { 127 BNU_CHUNK_T carry = cpAdd_BNU(pDataR, pDataR, pDataP, room); 128 if(carry) { 129 BN_SIZE(pR) = room; 130 IPP_ERROR_RET(ippStsOutOfRangeErr); 131 } 132 } 133 134 else { 135 BNU_CHUNK_T* pTmp = pDataR; 136 int cmpRes = cpCmp_BNU(pDataR, room, pDataP, room); 137 if(0>cmpRes) { 138 SWAP_PTR(BNU_CHUNK_T, pTmp, pDataP); 139 } 140 cpSub_BNU(pDataR, pTmp, pDataP, room); 141 142 BN_SIGN(pR) = cmpRes>0? sgnR : INVERSE_SIGN(sgnR); 143 } 144 145 FIX_BNU(pDataR, room); 146 BN_SIZE(pR) = room; 147 148 return ippStsNoErr; 149 } 150 } 151 } 152
