• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*******************************************************************************
2 * Copyright 2016-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 //  Purpose:
43 //     Cryptography Primitive.
44 //     HASH based Mask Generation Functions
45 //
46 //  Contents:
47 //        ippsMGF1_rmf()
48 //
49 */
50 
51 #include "owndefs.h"
52 #include "owncp.h"
53 #include "pcphash_rmf.h"
54 #include "pcptool.h"
55 
56 /*F*
57 //    Name: ippsMGF1
58 //
59 // Purpose: Mask Generation Functios.
60 //
61 // Returns:                Reason:
62 //    ippStsNullPtrErr           pMask == NULL
63 //                               pMethod ==NULL
64 //    ippStsLengthErr            seedLen <0
65 //                               maskLen <0
66 //    ippStsNoErr                no errors
67 //
68 // Parameters:
69 //    pSeed       pointer to the input stream
70 //    seedLen     input stream length (bytes)
71 //    pMaske      pointer to the ouput mask
72 //    maskLen     desired length of mask (bytes)
73 //    pMethod     hash method
74 //
75 //
76 // Note.
77 //    MGF1 defined in the IEEE P1363 standard.
78 //    MGF1 defined in the ANSI X9.63 standard and frequently called KDF (key Generation Function).
79 //    The fifference between MGF1 and MGF2 is negligible - counter i runs from 0 (in MGF1) and from 1 (in MGF2)
80 *F*/
81 IPPFUN(IppStatus, ippsMGF1_rmf,(const Ipp8u* pSeed, int seedLen, Ipp8u* pMask, int maskLen, const IppsHashMethod* pMethod))
82 {
83    IPP_BAD_PTR2_RET(pMask, pMethod);
84    IPP_BADARG_RET((seedLen<0)||(maskLen<0), ippStsLengthErr);
85 
86    {
87       /* hash specific */
88       int hashSize = pMethod->hashLen;
89 
90       int i, outLen;
91 
92       __ALIGN8 IppsHashState_rmf hashCtx;
93       ippsHashInit_rmf(&hashCtx, pMethod);
94 
95       if(!pSeed)
96          seedLen = 0;
97 
98       for(i=0,outLen=0; outLen<maskLen; i++) { /* counter i runs from 0 */
99          Ipp8u cnt[4];
100          cnt[0] = (Ipp8u)((i>>24) & 0xFF);
101          cnt[1] = (Ipp8u)((i>>16) & 0xFF);
102          cnt[2] = (Ipp8u)((i>>8)  & 0xFF);
103          cnt[3] = (Ipp8u)(i & 0xFF);
104 
105          ippsHashUpdate_rmf(pSeed, seedLen, &hashCtx);
106          ippsHashUpdate_rmf(cnt,   4,       &hashCtx);
107 
108          if((outLen + hashSize) <= maskLen) {
109             ippsHashFinal_rmf(pMask+outLen, &hashCtx);
110             outLen += hashSize;
111          }
112          else {
113             Ipp8u md[MAX_HASH_SIZE];
114             ippsHashFinal_rmf(md, &hashCtx);
115             CopyBlock(md, pMask+outLen, maskLen-outLen);
116             outLen = maskLen;
117          }
118       }
119 
120       return ippStsNoErr;
121    }
122 }
123