| /***************************************************************************** |
| * Copyright Statement: |
| * -------------------- |
| * This software is protected by Copyright and the information contained |
| * herein is confidential. The software may not be copied and the information |
| * contained herein may not be used or disclosed except with the written |
| * permission of MediaTek Inc. (C) 2016 |
| * |
| * BY OPENING THIS FILE, BUYER HEREBY UNEQUIVOCALLY ACKNOWLEDGES AND AGREES |
| * THAT THE SOFTWARE/FIRMWARE AND ITS DOCUMENTATIONS (""MEDIATEK SOFTWARE"") |
| * RECEIVED FROM MEDIATEK AND/OR ITS REPRESENTATIVES ARE PROVIDED TO BUYER ON |
| * AN ""AS-IS"" BASIS ONLY. MEDIATEK EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES, |
| * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF |
| * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT. |
| * NEITHER DOES MEDIATEK PROVIDE ANY WARRANTY WHATSOEVER WITH RESPECT TO THE |
| * SOFTWARE OF ANY THIRD PARTY WHICH MAY BE USED BY, INCORPORATED IN, OR |
| * SUPPLIED WITH THE MEDIATEK SOFTWARE, AND BUYER AGREES TO LOOK ONLY TO SUCH |
| * THIRD PARTY FOR ANY WARRANTY CLAIM RELATING THERETO. MEDIATEK SHALL ALSO |
| * NOT BE RESPONSIBLE FOR ANY MEDIATEK SOFTWARE RELEASES MADE TO BUYER'S |
| * SPECIFICATION OR TO CONFORM TO A PARTICULAR STANDARD OR OPEN FORUM. |
| * |
| * BUYER'S SOLE AND EXCLUSIVE REMEDY AND MEDIATEK'S ENTIRE AND CUMULATIVE |
| * LIABILITY WITH RESPECT TO THE MEDIATEK SOFTWARE RELEASED HEREUNDER WILL BE, |
| * AT MEDIATEK'S OPTION, TO REVISE OR REPLACE THE MEDIATEK SOFTWARE AT ISSUE, |
| * OR REFUND ANY SOFTWARE LICENSE FEES OR SERVICE CHARGE PAID BY BUYER TO |
| * MEDIATEK FOR SUCH MEDIATEK SOFTWARE AT ISSUE. |
| * |
| * THE TRANSACTION CONTEMPLATED HEREUNDER SHALL BE CONSTRUED IN ACCORDANCE |
| * WITH THE LAWS OF THE STATE OF CALIFORNIA, USA, EXCLUDING ITS CONFLICT OF |
| * LAWS PRINCIPLES. ANY DISPUTES, CONTROVERSIES OR CLAIMS ARISING THEREOF AND |
| * RELATED THERETO SHALL BE SETTLED BY ARBITRATION IN SAN FRANCISCO, CA, UNDER |
| * THE RULES OF THE INTERNATIONAL CHAMBER OF COMMERCE (ICC). |
| * |
| *****************************************************************************/ |
| /************************************************************* |
| * |
| * This Software is the property of VIA Telecom, Inc. and may only be used pursuant to a license from VIA Telecom, Inc. |
| * |
| * Any unauthorized use inconsistent with the terms of such license is strictly prohibited. |
| * |
| * Copyright (c) 1999-2010 VIA Telecom, Inc. All rights reserved. |
| * |
| *************************************************************/ |
| /************************************************************************* |
| * |
| * File Name: pswdhmath.h |
| * Project: Diffie Hellman |
| * Original Author: Dan Doucette |
| * Creation Date: Oct. 5, 1999 |
| * |
| * Description: Defines the generic math functions used in the |
| * calculation of the diffie hellman exponent |
| * |
| * Restrictions: |
| * |
| * Dependencies: |
| * |
| ************************************************************************* |
| * |
| * This Software is the property of ISOTEL Corporation. Unauthorized |
| * use is prohibited. |
| * |
| * ISOTEL Corporation |
| * 340, 525-28 Street S.E. |
| * Calgary, Alberta, Canada T2A 6W9 |
| * Tel: (403)275-0041 Fax: (403)274-3598 |
| * |
| * |
| ************************************************************************* |
| * |
| * RCS Log Information |
| * |
| * $Revision: 1.2 $ |
| * |
| * $Log: pswdhmath.h $ |
| * |
| * 07 06 2017 sue.zhong |
| * [MOLY00259241] [6293][C2K]Replace with KAL data type |
| * Correct copyright file header |
| * Revision 1.2 2004/03/25 12:07:47 fpeng |
| * Updated from 6.0 CP 2.5.0 |
| * Revision 1.1 2003/05/12 15:39:21 fpeng |
| * Initial revision |
| * Revision 1.2 2002/06/06 14:25:30 dstecker |
| * Updated copyright notice |
| * Revision 1.1 2001/07/23 11:36:09 mclee |
| * Initial revision |
| * Revision 1.1 2001/01/24 11:24:44 mclee |
| * Initial revision |
| * Revision 1.1 2001/01/24 00:09:22Z mclee |
| * Initial revision |
| * Revision 1.0 1999/12/02 14:28:50 danfeng hong |
| * Initial revision |
| * |
| * |
| ************************************************************************/ |
| |
| #ifndef _DH_MATH_H |
| #define _DH_MATH_H |
| |
| /* |
| * convert a DHEncryptVal value to a DHGiantInt value |
| */ |
| void dhGiantIntAssign(DHGiantInt *dest, DHEncryptVal *src); |
| |
| /* |
| * convert a DHGiantInt value to a DHEncryptVal value |
| */ |
| void dhEncryptValAssign(DHEncryptVal * dest, DHGiantInt *src); |
| |
| /* |
| * r = (m1*m2)%p |
| */ |
| void dhMulMod(DHGiantInt *r, DHGiantInt* m1, DHGiantInt * m2, DHGiantInt *p); |
| |
| /* |
| * r = (m1*m2)%p with optimization, need much more memory space than dhMulMod(), |
| * the method is called only when DH_EXTRAMEM macro is defined in dh_tune.h |
| */ |
| void dhMulModOpti(DHGiantInt *r, DHGiantInt* m1, DHGiantInt * m2, DHGiantInt *p, kal_int16 type); |
| |
| /* |
| * r = r%p |
| */ |
| void dhMod(DHGiantInt *r, DHGiantInt *p); |
| |
| /* |
| * r = mul1*mul2 |
| */ |
| void dhMul(DHGiantInt *r, DHGiantInt* mul1, DHGiantInt * mul2); |
| |
| /* |
| * r = m1*block |
| */ |
| void dhMulBlock(DHGiantInt *r, DHGiantInt* m1, DHBlockType block); |
| |
| /* |
| * r += acc |
| */ |
| void dhAccFrom(DHGiantInt *r, DHGiantInt *acc); |
| |
| /* |
| * r -= dec; assume r>=dec |
| */ |
| void dhDecFrom(DHGiantInt *r, DHGiantInt *dec); |
| |
| /* |
| * returns: |
| * 1 if a > b |
| * 0 if a == b |
| * -1 if a < b |
| */ |
| kal_int16 dhCompare(DHGiantInt *a, DHGiantInt *b); |
| |
| /* |
| * KAL_TRUE if num's value is 0, KAL_FALSE otherwise |
| */ |
| kal_bool dhEquals0(DHGiantInt *num); |
| |
| /* |
| * KAL_TRUE if num's value is 1, KAL_FALSE otherwise |
| */ |
| kal_bool dhEquals1(DHGiantInt *num); |
| |
| /* |
| * get size of the num's Most Significant Block |
| */ |
| kal_int16 dhGetDHGiantIntSize(DHGiantInt * num); |
| |
| /* |
| * left shift blocks DHBlockType of num |
| */ |
| void dhBlocksShiftLeft(DHGiantInt *num, kal_int16 blocks); |
| |
| /* |
| * left shift bits of num |
| */ |
| void dhBitsShiftLeft(DHGiantInt * num, kal_int16 bits); |
| |
| /* |
| * right shift bits of num |
| */ |
| void dhBitsShiftRight(DHGiantInt *num, kal_int16 bits); |
| |
| /* |
| * get how many half bytes are in num's Most Significant block |
| */ |
| kal_int16 dhGetMSHalfBytesNum(DHGiantInt *num); |
| |
| /* |
| * get how many half bytes are in num's value |
| */ |
| kal_int16 dhGetHalfBytesNum(DHGiantInt *num); |
| |
| /* |
| * block = halfs half bytes from num starting from MS block |
| */ |
| void dhGetHighestHalfBytes(DHCarryBlockType *block, DHGiantInt *num, kal_int16 halfs); |
| |
| /* |
| * set a set of accessory fields of public modulus, mostly used by dhMulMod() to |
| * speed up performance |
| */ |
| void dhSetPHalfs(DHGiantInt *p); |
| |
| #endif |
| |
| |