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 // ippsMontExp() 47 // 48 */ 49 50 #include "owndefs.h" 51 #include "owncp.h" 52 #include "pcpbn.h" 53 #include "pcpmontgomery.h" 54 #include "pcptool.h" 55 56 /*F* 57 // Name: ippsMontExp 58 // 59 // Purpose: computes the Montgomery exponentiation with exponent 60 // IppsBigNumState *pE to the given big number integer of Montgomery form 61 // IppsBigNumState *pA with respect to the modulus IppsMontState *pCtx. 62 // 63 // Returns: Reason: 64 // ippStsNoErr Returns no error. 65 // ippStsNullPtrErr Returns an error when pointers are null. 66 // ippStsBadArgErr Returns an error when a or b is a negative integer. 67 // ippStsScaleRangeErr Returns an error when a or b is more than m. 68 // ippStsOutOfRangeErr Returns an error when IppsBigNumState *r is larger than 69 // IppsMontState *m. 70 // ippStsContextMatchErr Returns an error when the context parameter does 71 // not match the operation. 72 // 73 // 74 // Parameters: 75 // pA big number integer of Montgomery form within the 76 // range [0,m-1] 77 // pE big number exponent 78 // pCtx Montgomery modulus of IppsMontState 79 / pR the Montgomery exponentation result. 80 // 81 // Notes: IppsBigNumState *r should possess enough memory space as to hold the result 82 // of the operation. i.e. both pointers r->d and r->buffer should possess 83 // no less than (m->n->length) number of 32-bit words. 84 *F*/ 85 86 IPPFUN(IppStatus, ippsMontExp, (const IppsBigNumState* pA, const IppsBigNumState* pE, IppsMontState* pCtx, IppsBigNumState* pR)) 87 { 88 IPP_BAD_PTR4_RET(pA, pE, pCtx, pR); 89 90 pCtx = (IppsMontState*)(IPP_ALIGNED_PTR((pCtx), MONT_ALIGNMENT)); 91 pA = (IppsBigNumState*)( IPP_ALIGNED_PTR(pA, BN_ALIGNMENT) ); 92 pE = (IppsBigNumState*)( IPP_ALIGNED_PTR(pE, BN_ALIGNMENT) ); 93 pR = (IppsBigNumState*)( IPP_ALIGNED_PTR(pR, BN_ALIGNMENT) ); 94 95 IPP_BADARG_RET(!MNT_VALID_ID(pCtx), ippStsContextMatchErr); 96 IPP_BADARG_RET(!BN_VALID_ID(pA), ippStsContextMatchErr); 97 IPP_BADARG_RET(!BN_VALID_ID(pE), ippStsContextMatchErr); 98 IPP_BADARG_RET(!BN_VALID_ID(pR), ippStsContextMatchErr); 99 100 IPP_BADARG_RET(BN_ROOM(pR) < MOD_LEN( MNT_ENGINE(pCtx) ), ippStsOutOfRangeErr); 101 /* check a */ 102 IPP_BADARG_RET(BN_NEGATIVE(pA), ippStsBadArgErr); 103 IPP_BADARG_RET(cpCmp_BNU(BN_NUMBER(pA), BN_SIZE(pA), MOD_MODULUS( MNT_ENGINE(pCtx) ), MOD_LEN( MNT_ENGINE(pCtx) )) >= 0, ippStsScaleRangeErr); 104 /* check e */ 105 IPP_BADARG_RET(BN_NEGATIVE(pE), ippStsBadArgErr); 106 107 cpMontExpBin_BN(pR, pA, pE, MNT_ENGINE( pCtx) ); 108 109 return ippStsNoErr; 110 } 111
