]> git.saurik.com Git - apple/security.git/blob - OSX/libsecurity_apple_csp/open_ssl/bn/bn_blind.c
Security-57336.1.9.tar.gz
[apple/security.git] / OSX / libsecurity_apple_csp / open_ssl / bn / bn_blind.c
1 /*
2 * Copyright (c) 2000-2001,2011,2014 Apple Inc. All Rights Reserved.
3 *
4 * The contents of this file constitute Original Code as defined in and are
5 * subject to the Apple Public Source License Version 1.2 (the 'License').
6 * You may not use this file except in compliance with the License. Please obtain
7 * a copy of the License at http://www.apple.com/publicsource and read it before
8 * using this file.
9 *
10 * This Original Code and all software distributed under the License are
11 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
12 * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT
13 * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
14 * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the
15 * specific language governing rights and limitations under the License.
16 */
17
18
19 /* crypto/bn/bn_blind.c */
20 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
21 * All rights reserved.
22 *
23 * This package is an SSL implementation written
24 * by Eric Young (eay@cryptsoft.com).
25 * The implementation was written so as to conform with Netscapes SSL.
26 *
27 * This library is free for commercial and non-commercial use as long as
28 * the following conditions are aheared to. The following conditions
29 * apply to all code found in this distribution, be it the RC4, RSA,
30 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
31 * included with this distribution is covered by the same copyright terms
32 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
33 *
34 * Copyright remains Eric Young's, and as such any Copyright notices in
35 * the code are not to be removed.
36 * If this package is used in a product, Eric Young should be given attribution
37 * as the author of the parts of the library used.
38 * This can be in the form of a textual message at program startup or
39 * in documentation (online or textual) provided with the package.
40 *
41 * Redistribution and use in source and binary forms, with or without
42 * modification, are permitted provided that the following conditions
43 * are met:
44 * 1. Redistributions of source code must retain the copyright
45 * notice, this list of conditions and the following disclaimer.
46 * 2. Redistributions in binary form must reproduce the above copyright
47 * notice, this list of conditions and the following disclaimer in the
48 * documentation and/or other materials provided with the distribution.
49 * 3. All advertising materials mentioning features or use of this software
50 * must display the following acknowledgement:
51 * "This product includes cryptographic software written by
52 * Eric Young (eay@cryptsoft.com)"
53 * The word 'cryptographic' can be left out if the rouines from the library
54 * being used are not cryptographic related :-).
55 * 4. If you include any Windows specific code (or a derivative thereof) from
56 * the apps directory (application code) you must include an acknowledgement:
57 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
58 *
59 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 * SUCH DAMAGE.
70 *
71 * The licence and distribution terms for any publically available version or
72 * derivative of this code cannot be changed. i.e. this code cannot simply be
73 * copied and put under another distribution licence
74 * [including the GNU Public Licence.]
75 */
76
77 #include <stdio.h>
78 #include "cryptlib.h"
79 #include "bn_lcl.h"
80
81 BN_BLINDING *BN_BLINDING_new(BIGNUM *A, BIGNUM *Ai, BIGNUM *mod)
82 {
83 BN_BLINDING *ret=NULL;
84
85 bn_check_top(Ai);
86 bn_check_top(mod);
87
88 if ((ret=(BN_BLINDING *)Malloc(sizeof(BN_BLINDING))) == NULL)
89 {
90 BNerr(BN_F_BN_BLINDING_NEW,ERR_R_MALLOC_FAILURE);
91 return(NULL);
92 }
93 memset(ret,0,sizeof(BN_BLINDING));
94 if ((ret->A=BN_new()) == NULL) goto err;
95 if ((ret->Ai=BN_new()) == NULL) goto err;
96 if (!BN_copy(ret->A,A)) goto err;
97 if (!BN_copy(ret->Ai,Ai)) goto err;
98 ret->mod=mod;
99 return(ret);
100 err:
101 if (ret != NULL) BN_BLINDING_free(ret);
102 return(NULL);
103 }
104
105 void BN_BLINDING_free(BN_BLINDING *r)
106 {
107 if(r == NULL)
108 return;
109
110 if (r->A != NULL) BN_free(r->A );
111 if (r->Ai != NULL) BN_free(r->Ai);
112 Free(r);
113 }
114
115 int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
116 {
117 int ret=0;
118
119 if ((b->A == NULL) || (b->Ai == NULL))
120 {
121 BNerr(BN_F_BN_BLINDING_UPDATE,BN_R_NOT_INITIALIZED);
122 goto err;
123 }
124
125 if (!BN_mod_mul(b->A,b->A,b->A,b->mod,ctx)) goto err;
126 if (!BN_mod_mul(b->Ai,b->Ai,b->Ai,b->mod,ctx)) goto err;
127
128 ret=1;
129 err:
130 return(ret);
131 }
132
133 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
134 {
135 bn_check_top(n);
136
137 if ((b->A == NULL) || (b->Ai == NULL))
138 {
139 BNerr(BN_F_BN_BLINDING_CONVERT,BN_R_NOT_INITIALIZED);
140 return(0);
141 }
142 return(BN_mod_mul(n,n,b->A,b->mod,ctx));
143 }
144
145 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
146 {
147 int ret;
148
149 bn_check_top(n);
150 if ((b->A == NULL) || (b->Ai == NULL))
151 {
152 BNerr(BN_F_BN_BLINDING_INVERT,BN_R_NOT_INITIALIZED);
153 return(0);
154 }
155 if ((ret=BN_mod_mul(n,n,b->Ai,b->mod,ctx)) >= 0)
156 {
157 if (!BN_BLINDING_update(b,ctx))
158 return(0);
159 }
160 return(ret);
161 }
162