|
sl@0
|
1 |
/*
|
|
sl@0
|
2 |
* Copyright (c) 2003-2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
3 |
* All rights reserved.
|
|
sl@0
|
4 |
* This component and the accompanying materials are made available
|
|
sl@0
|
5 |
* under the terms of the License "Eclipse Public License v1.0"
|
|
sl@0
|
6 |
* which accompanies this distribution, and is available
|
|
sl@0
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
8 |
*
|
|
sl@0
|
9 |
* Initial Contributors:
|
|
sl@0
|
10 |
* Nokia Corporation - initial contribution.
|
|
sl@0
|
11 |
*
|
|
sl@0
|
12 |
* Contributors:
|
|
sl@0
|
13 |
*
|
|
sl@0
|
14 |
* Description:
|
|
sl@0
|
15 |
* Bigint algorithms header file
|
|
sl@0
|
16 |
*
|
|
sl@0
|
17 |
*/
|
|
sl@0
|
18 |
|
|
sl@0
|
19 |
|
|
sl@0
|
20 |
/**
|
|
sl@0
|
21 |
@file
|
|
sl@0
|
22 |
@internalTechnology
|
|
sl@0
|
23 |
*/
|
|
sl@0
|
24 |
|
|
sl@0
|
25 |
#ifndef __ALGORITHMS_H__
|
|
sl@0
|
26 |
#define __ALGORITHMS_H__
|
|
sl@0
|
27 |
|
|
sl@0
|
28 |
#include "../common/inlines.h"
|
|
sl@0
|
29 |
|
|
sl@0
|
30 |
word Add(word* C, const word* A, const word* B, unsigned int N);
|
|
sl@0
|
31 |
word Subtract(word* C, const word* A, const word* B, unsigned int N);
|
|
sl@0
|
32 |
int Compare(const word *A, const word *B, unsigned int N);
|
|
sl@0
|
33 |
void IncrementNoCarry(word *A, unsigned int N, word B=1);
|
|
sl@0
|
34 |
word Increment(word *A, unsigned int N, word B=1);
|
|
sl@0
|
35 |
void DecrementNoCarry(word *A, unsigned int N, word B=1);
|
|
sl@0
|
36 |
word Decrement(word *A, unsigned int N, word B=1);
|
|
sl@0
|
37 |
void TwosComplement(word *A, unsigned int N);
|
|
sl@0
|
38 |
void Divide(word* R, word* Q, word* T, const word* A, unsigned int NA,
|
|
sl@0
|
39 |
const word* B, unsigned int NB);
|
|
sl@0
|
40 |
unsigned int AlmostInverse(word *R, word *T, const word *A, unsigned int NA,
|
|
sl@0
|
41 |
const word *M, unsigned int N);
|
|
sl@0
|
42 |
void DivideByPower2Mod(word *R, const word *A, unsigned int k, const word *M,
|
|
sl@0
|
43 |
unsigned int N);
|
|
sl@0
|
44 |
void RecursiveInverseModPower2(word *R, word *T, const word *A, unsigned int N);
|
|
sl@0
|
45 |
void AsymmetricMultiply(word *R, word *T, const word *A, unsigned int NA,
|
|
sl@0
|
46 |
const word *B, unsigned int NB);
|
|
sl@0
|
47 |
void MontgomeryReduce(word *R, word *T, const word *X, const word *M,
|
|
sl@0
|
48 |
const word *U, unsigned int N);
|
|
sl@0
|
49 |
void RecursiveSquare(word *R, word *T, const word *A, unsigned int N);
|
|
sl@0
|
50 |
|
|
sl@0
|
51 |
#endif
|