1 /*******************************************************************************
2 * Copyright 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 //        ippsGFpSetElementHash_rmf
47 //
48 */
49 #include "owndefs.h"
50 #include "owncp.h"
51 
52 #include "pcpgfpstuff.h"
53 #include "pcpgfpxstuff.h"
54 #include "pcphash.h"
55 #include "pcphash_rmf.h"
56 #include "pcptool.h"
57 
58 
59 /*F*
60 // Name: ippsGFpSetElementHash_rmf
61 //
62 // Purpose: Set GF Element Hash of the Message
63 //
64 // Returns:                   Reason:
65 //    ippStsNullPtrErr           NULL == pGFp
66 //                               NULL == pElm
67 //                               NULL == pMsg if msgLen>0
68 //                               NULL = pMethod
69 //
70 //    ippStsContextMatchErr      invalid pGFp->idCtx
71 //                               invalid pElm->idCtx
72 //
73 //    ippStsOutOfRangeErr        GFPE_ROOM() != GFP_FELEN()
74 //
75 //    ippStsBadArgErr            !GFP_IS_BASIC(pGFE)
76 //
77 //    ippStsLengthErr            msgLen<0
78 //
79 //    ippStsNoErr                no error
80 //
81 // Parameters:
82 //    pMsg     pointer to the message is being hashed
83 //    msgLen   length of the message above
84 //    pElm     pointer to Finite Field Element context
85 //    pGFp     pointer to Finite Field context
86 //    pMethod  pointer to hash method
87 *F*/
88 
89 IPPFUN(IppStatus, ippsGFpSetElementHash_rmf,(const Ipp8u* pMsg, int msgLen, IppsGFpElement* pElm, IppsGFpState* pGFp, const IppsHashMethod* pMethod))
90 {
91    /* test method pointer */
92    IPP_BAD_PTR1_RET(pMethod);
93 
94    /* test message length and pointer */
95    IPP_BADARG_RET((msgLen<0), ippStsLengthErr);
96    IPP_BADARG_RET((msgLen && !pMsg), ippStsNullPtrErr);
97 
98    IPP_BAD_PTR2_RET(pElm, pGFp);
99    pGFp = (IppsGFpState*)( IPP_ALIGNED_PTR(pGFp, GFP_ALIGNMENT) );
100    IPP_BADARG_RET( !GFP_TEST_ID(pGFp), ippStsContextMatchErr);
101    IPP_BADARG_RET( !GFPE_TEST_ID(pElm), ippStsContextMatchErr);
102    {
103       gsModEngine* pGFE = GFP_PMA(pGFp);
104       IPP_BADARG_RET( !GFP_IS_BASIC(pGFE), ippStsBadArgErr);
105       IPP_BADARG_RET( GFPE_ROOM(pElm)!=GFP_FELEN(pGFE), ippStsOutOfRangeErr);
106 
107       {
108          Ipp8u md[MAX_HASH_SIZE];
109          BNU_CHUNK_T hashVal[(MAX_HASH_SIZE*8)/BITSIZE(BNU_CHUNK_T)+1]; /* +1 to meet cpMod_BNU() implementtaion specific */
110          IppStatus sts = ippsHashMessage_rmf(pMsg, msgLen, md, pMethod);
111 
112          if(ippStsNoErr==sts) {
113             int elemLen = GFP_FELEN(pGFE);
114             int hashLen = pMethod->hashLen;
115             int hashValLen = cpFromOctStr_BNU(hashVal, md, hashLen);
116             hashValLen = cpMod_BNU(hashVal, hashValLen, GFP_MODULUS(pGFE), elemLen);
117             cpGFpSet(GFPE_DATA(pElm), hashVal, hashValLen, pGFE);
118          }
119 
120          return sts;
121       }
122    }
123 }
124