![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to bf_skey.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [truecrypt] / truecrypt / crypto|
Return to bf_skey.c CVS log | Up to [truecrypt] / truecrypt / crypto |
1.1.1.4 root 1: /* Deprecated/legacy */
2:
1.1 root 3: /* crypto/bf/bf_skey.c */
4: /* Copyright (C) 1995-1997 Eric Young ([email protected])
5: * All rights reserved.
6: *
7: * This package is an SSL implementation written
8: * by Eric Young ([email protected]).
9: * The implementation was written so as to conform with Netscapes SSL.
10: *
11: * This library is free for commercial and non-commercial use as long as
12: * the following conditions are aheared to. The following conditions
13: * apply to all code found in this distribution, be it the RC4, RSA,
14: * lhash, DES, etc., code; not just the SSL code. The SSL documentation
15: * included with this distribution is covered by the same copyright terms
16: * except that the holder is Tim Hudson ([email protected]).
17: *
18: * Copyright remains Eric Young's, and as such any Copyright notices in
19: * the code are not to be removed.
20: * If this package is used in a product, Eric Young should be given attribution
21: * as the author of the parts of the library used.
22: * This can be in the form of a textual message at program startup or
23: * in documentation (online or textual) provided with the package.
24: *
25: * Redistribution and use in source and binary forms, with or without
26: * modification, are permitted provided that the following conditions
27: * are met:
28: * 1. Redistributions of source code must retain the copyright
29: * notice, this list of conditions and the following disclaimer.
30: * 2. Redistributions in binary form must reproduce the above copyright
31: * notice, this list of conditions and the following disclaimer in the
32: * documentation and/or other materials provided with the distribution.
33: * 3. All advertising materials mentioning features or use of this software
34: * must display the following acknowledgement:
35: * "This product includes cryptographic software written by
36: * Eric Young ([email protected])"
37: * The word 'cryptographic' can be left out if the rouines from the library
38: * being used are not cryptographic related :-).
39: * 4. If you include any Windows specific code (or a derivative thereof) from
40: * the apps directory (application code) you must include an acknowledgement:
41: * "This product includes software written by Tim Hudson ([email protected])"
42: *
43: * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
44: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
47: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53: * SUCH DAMAGE.
54: *
55: * The licence and distribution terms for any publically available version or
56: * derivative of this code cannot be changed. i.e. this code cannot simply be
57: * copied and put under another distribution licence
58: * [including the GNU Public Licence.]
59: */
60:
61: #include <stdio.h>
62: #include <string.h>
1.1.1.2 root 63:
64: #include "Blowfish.h"
65: #include "Bf_locl.h"
66: #include "Bf_pi.h"
1.1 root 67:
1.1.1.3 root 68: void BF_set_key(key,len,data)
1.1 root 69: BF_KEY *key;
70: int len;
71: unsigned char *data;
72: {
73: int i;
74: BF_LONG *p,ri,in[2];
75: unsigned char *d,*end;
76:
77:
78: memcpy((char *)key,(char *)&bf_init,sizeof(BF_KEY));
79: p=key->P;
80:
81: if (len > ((BF_ROUNDS+2)*4)) len=(BF_ROUNDS+2)*4;
82:
83: d=data;
84: end= &(data[len]);
85: for (i=0; i<(BF_ROUNDS+2); i++)
86: {
87: ri= *(d++);
88: if (d >= end) d=data;
89:
90: ri<<=8;
91: ri|= *(d++);
92: if (d >= end) d=data;
93:
94: ri<<=8;
95: ri|= *(d++);
96: if (d >= end) d=data;
97:
98: ri<<=8;
99: ri|= *(d++);
100: if (d >= end) d=data;
101:
102: p[i]^=ri;
103: }
104:
105: in[0]=0L;
106: in[1]=0L;
107: for (i=0; i<(BF_ROUNDS+2); i+=2)
108: {
109: BF_encrypt(in,key);
110: p[i ]=in[0];
111: p[i+1]=in[1];
112: }
113:
114: p=key->S;
115: for (i=0; i<4*256; i+=2)
116: {
117: BF_encrypt(in,key);
118: p[i ]=in[0];
119: p[i+1]=in[1];
120: }
121: }
122:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.