1 /*******************************************************************************
2 * Copyright 2003-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 //
43 //  Purpose:
44 //     Cryptography Primitive.
45 //     EC over Prime Finite Field (EC Point operations)
46 //
47 //  Contents:
48 //        ippsECCPGetPoint()
49 //
50 */
51 
52 #include "owndefs.h"
53 #include "owncp.h"
54 #include "pcpeccp.h"
55 
56 /*F*
57 //    Name: ippsECCPGetPoint
58 //
59 // Purpose: Converts  internal presentation EC point - montgomery projective
60 //          into regular affine coordinates EC point (pX,pY)
61 //
62 // Returns:                Reason:
63 //    ippStsNullPtrErr        NULL == pEC
64 //                            NULL == pPoint
65 //
66 //    ippStsContextMatchErr   illegal pEC->idCtx
67 //                            illegal pPoint->idCtx
68 //                            NULL != pX, illegal pX->idCtx
69 //                            NULL != pY, illegal pY->idCtx
70 //
71 //    ippStsNoErr             no errors
72 //
73 // Parameters:
74 //    pX          pointer to the regular affine coordinate X
75 //    pY          pointer to the regular affine coordinate Y
76 //    pPoint      pointer to the EC Point context
77 //    pEC        pointer to the ECCP context
78 //
79 *F*/
80 IPPFUN(IppStatus, ippsECCPGetPoint,(IppsBigNumState* pX, IppsBigNumState* pY,
81                                   const IppsECCPPointState* pPoint,
82                                   IppsECCPState* pEC))
83 {
84    /* test pEC */
85    IPP_BAD_PTR1_RET(pEC);
86    /* use aligned EC context */
87    pEC = (IppsGFpECState*)( IPP_ALIGNED_PTR(pEC, ECGFP_ALIGNMENT) );
88    IPP_BADARG_RET(!ECP_TEST_ID(pEC), ippStsContextMatchErr);
89 
90    /* test pX and pY */
91    if(pX) {
92       pX = (IppsBigNumState*)( IPP_ALIGNED_PTR(pX, ALIGN_VAL) );
93       IPP_BADARG_RET(!BN_VALID_ID(pX), ippStsContextMatchErr);
94    }
95    if(pY) {
96       pY = (IppsBigNumState*)( IPP_ALIGNED_PTR(pY, ALIGN_VAL) );
97       IPP_BADARG_RET(!BN_VALID_ID(pY), ippStsContextMatchErr);
98    }
99 
100    {
101       IppStatus sts;
102 
103       IppsGFpState* pGF = ECP_GFP(pEC);
104       gsModEngine* pGFE = GFP_PMA(pGF);
105       int elemLen = GFP_FELEN(pGFE);
106 
107       mod_decode decode = GFP_METHOD(pGFE)->decode;  /* gf decode method  */
108 
109       IppsGFpElement elmX, elmY;
110 
111       cpGFpElementConstruct(&elmX, cpGFpGetPool(1, pGFE), elemLen);
112       cpGFpElementConstruct(&elmY, cpGFpGetPool(1, pGFE), elemLen);
113       do {
114          sts = ippsGFpECGetPoint(pPoint, pX? &elmX:NULL, pY? &elmY:NULL, pEC);
115          if(ippStsNoErr!=sts) break;
116 
117          if(pX) {
118             decode(elmX.pData, elmX.pData, pGFE);
119             sts = ippsSet_BN(ippBigNumPOS, GFP_FELEN32(pGFE), (Ipp32u*)elmX.pData, pX);
120             if(ippStsNoErr!=sts) break;
121          }
122          if(pY) {
123             decode(elmY.pData, elmY.pData, pGFE);
124             sts = ippsSet_BN(ippBigNumPOS, GFP_FELEN32(pGFE), (Ipp32u*)elmY.pData, pY);
125             if(ippStsNoErr!=sts) break;
126          }
127       } while(0);
128 
129       cpGFpReleasePool(2, pGFE);
130       return sts;
131    }
132 }
133