diff options
Diffstat (limited to 'src/lib/libcrypto/bn/old/bn_m.c')
-rw-r--r-- | src/lib/libcrypto/bn/old/bn_m.c | 139 |
1 files changed, 0 insertions, 139 deletions
diff --git a/src/lib/libcrypto/bn/old/bn_m.c b/src/lib/libcrypto/bn/old/bn_m.c index 522beb02bc..e69de29bb2 100644 --- a/src/lib/libcrypto/bn/old/bn_m.c +++ b/src/lib/libcrypto/bn/old/bn_m.c | |||
@@ -1,139 +0,0 @@ | |||
1 | /* crypto/bn/bn_m.c */ | ||
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | ||
3 | * All rights reserved. | ||
4 | * | ||
5 | * This package is an SSL implementation written | ||
6 | * by Eric Young (eay@cryptsoft.com). | ||
7 | * The implementation was written so as to conform with Netscapes SSL. | ||
8 | * | ||
9 | * This library is free for commercial and non-commercial use as long as | ||
10 | * the following conditions are aheared to. The following conditions | ||
11 | * apply to all code found in this distribution, be it the RC4, RSA, | ||
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | ||
13 | * included with this distribution is covered by the same copyright terms | ||
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | ||
15 | * | ||
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | ||
17 | * the code are not to be removed. | ||
18 | * If this package is used in a product, Eric Young should be given attribution | ||
19 | * as the author of the parts of the library used. | ||
20 | * This can be in the form of a textual message at program startup or | ||
21 | * in documentation (online or textual) provided with the package. | ||
22 | * | ||
23 | * Redistribution and use in source and binary forms, with or without | ||
24 | * modification, are permitted provided that the following conditions | ||
25 | * are met: | ||
26 | * 1. Redistributions of source code must retain the copyright | ||
27 | * notice, this list of conditions and the following disclaimer. | ||
28 | * 2. Redistributions in binary form must reproduce the above copyright | ||
29 | * notice, this list of conditions and the following disclaimer in the | ||
30 | * documentation and/or other materials provided with the distribution. | ||
31 | * 3. All advertising materials mentioning features or use of this software | ||
32 | * must display the following acknowledgement: | ||
33 | * "This product includes cryptographic software written by | ||
34 | * Eric Young (eay@cryptsoft.com)" | ||
35 | * The word 'cryptographic' can be left out if the rouines from the library | ||
36 | * being used are not cryptographic related :-). | ||
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | ||
38 | * the apps directory (application code) you must include an acknowledgement: | ||
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | ||
40 | * | ||
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | ||
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | ||
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | ||
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | ||
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | ||
51 | * SUCH DAMAGE. | ||
52 | * | ||
53 | * The licence and distribution terms for any publically available version or | ||
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | ||
55 | * copied and put under another distribution licence | ||
56 | * [including the GNU Public Licence.] | ||
57 | */ | ||
58 | |||
59 | #include <stdio.h> | ||
60 | /*#include "cryptlib.h"*/ | ||
61 | #include "bn_lcl.h" | ||
62 | |||
63 | #define limit_bits 5 /* 2^5, or 32 words */ | ||
64 | #define limit_num (1<<limit_bits) | ||
65 | |||
66 | int BN_m(BIGNUM *r, BIGNUM *a, BIGNUM *b) | ||
67 | { | ||
68 | BIGNUM *sk; | ||
69 | int i,n; | ||
70 | |||
71 | n=(BN_num_bits_word(a->top|b->top)-limit_bits); | ||
72 | n*=2; | ||
73 | sk=(BIGNUM *)malloc(sizeof(BIGNUM)*n); | ||
74 | for (i=0; i<n; i++) | ||
75 | BN_init(&(sk[i])); | ||
76 | |||
77 | return(BN_mm(r,a,b,&(sk[0]))); | ||
78 | } | ||
79 | |||
80 | #define ahal (sk[0]) | ||
81 | #define blbh (sk[1]) | ||
82 | |||
83 | /* r must be different to a and b */ | ||
84 | int BN_mm(BIGNUM *m, BIGNUM *A, BIGNUM *B, BIGNUM *sk) | ||
85 | { | ||
86 | int i,num,anum,bnum; | ||
87 | int an,bn; | ||
88 | BIGNUM ah,al,bh,bl; | ||
89 | |||
90 | an=A->top; | ||
91 | bn=B->top; | ||
92 | if ((an <= limit_num) || (bn <= limit_num)) | ||
93 | { | ||
94 | return(BN_mul(m,A,B)); | ||
95 | } | ||
96 | |||
97 | anum=(an>bn)?an:bn; | ||
98 | num=(anum)/2; | ||
99 | |||
100 | /* Are going to now chop things into 'num' word chunks. */ | ||
101 | bnum=num*BN_BITS2; | ||
102 | |||
103 | BN_init(&ahal); | ||
104 | BN_init(&blbh); | ||
105 | BN_init(&ah); | ||
106 | BN_init(&al); | ||
107 | BN_init(&bh); | ||
108 | BN_init(&bl); | ||
109 | |||
110 | al.top=num; | ||
111 | al.d=A->d; | ||
112 | ah.top=A->top-num; | ||
113 | ah.d= &(A->d[num]); | ||
114 | |||
115 | bl.top=num; | ||
116 | bl.d=B->d; | ||
117 | bh.top=B->top-num; | ||
118 | bh.d= &(B->d[num]); | ||
119 | |||
120 | BN_sub(&ahal,&ah,&al); | ||
121 | BN_sub(&blbh,&bl,&bh); | ||
122 | |||
123 | BN_mm(m,&ahal,&blbh,&(sk[2])); | ||
124 | BN_mm(&ahal,&al,&bl,&(sk[2])); | ||
125 | BN_mm(&blbh,&ah,&bh,&(sk[2])); | ||
126 | |||
127 | BN_add(m,m,&ahal); | ||
128 | BN_add(m,m,&blbh); | ||
129 | |||
130 | BN_lshift(m,m,bnum); | ||
131 | BN_add(m,m,&ahal); | ||
132 | |||
133 | BN_lshift(&blbh,&blbh,bnum*2); | ||
134 | BN_add(m,m,&blbh); | ||
135 | |||
136 | m->neg=A->neg^B->neg; | ||
137 | return(1); | ||
138 | } | ||
139 | |||