Line | Count | Source (jump to first uncovered line) |
1 | | // cast.cpp - originally written and placed in the public domain by Wei Dai and Leonard Janke |
2 | | // based on Steve Reid's public domain cast.c |
3 | | |
4 | | #include "pch.h" |
5 | | #include "cast.h" |
6 | | #include "misc.h" |
7 | | |
8 | | NAMESPACE_BEGIN(CryptoPP) |
9 | | |
10 | | /* Macros to access 8-bit bytes out of a 32-bit word */ |
11 | 15.4k | #define U8a(x) GETBYTE(x,3) |
12 | 15.4k | #define U8b(x) GETBYTE(x,2) |
13 | 15.4k | #define U8c(x) GETBYTE(x,1) |
14 | 15.4k | #define U8d(x) GETBYTE(x,0) |
15 | | |
16 | | /* CAST uses three different round functions */ |
17 | | #define f1(l, r, km, kr) \ |
18 | 5.78k | t = rotlVariable(km + r, kr); \ |
19 | 5.78k | l ^= ((S[0][U8a(t)] ^ S[1][U8b(t)]) - \ |
20 | 5.78k | S[2][U8c(t)]) + S[3][U8d(t)]; |
21 | | #define f2(l, r, km, kr) \ |
22 | 4.82k | t = rotlVariable(km ^ r, kr); \ |
23 | 4.82k | l ^= ((S[0][U8a(t)] - S[1][U8b(t)]) + \ |
24 | 4.82k | S[2][U8c(t)]) ^ S[3][U8d(t)]; |
25 | | #define f3(l, r, km, kr) \ |
26 | 4.82k | t = rotlVariable(km - r, kr); \ |
27 | 4.82k | l ^= ((S[0][U8a(t)] + S[1][U8b(t)]) ^ \ |
28 | 4.82k | S[2][U8c(t)]) - S[3][U8d(t)]; |
29 | | |
30 | 5.78k | #define F1(l, r, i, j) f1(l, r, K[i], K[i+j]) |
31 | 4.82k | #define F2(l, r, i, j) f2(l, r, K[i], K[i+j]) |
32 | 4.82k | #define F3(l, r, i, j) f3(l, r, K[i], K[i+j]) |
33 | | |
34 | | typedef BlockGetAndPut<word32, BigEndian> Block; |
35 | | |
36 | | void CAST128::Enc::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const |
37 | 192 | { |
38 | 192 | word32 &t=m_t[0], &l=m_t[1], &r=m_t[2]; |
39 | | |
40 | | /* Get inblock into l,r */ |
41 | 192 | Block::Get(inBlock)(l)(r); |
42 | | /* Do the work */ |
43 | 192 | F1(l, r, 0, 16); |
44 | 192 | F2(r, l, 1, 16); |
45 | 192 | F3(l, r, 2, 16); |
46 | 192 | F1(r, l, 3, 16); |
47 | 192 | F2(l, r, 4, 16); |
48 | 192 | F3(r, l, 5, 16); |
49 | 192 | F1(l, r, 6, 16); |
50 | 192 | F2(r, l, 7, 16); |
51 | 192 | F3(l, r, 8, 16); |
52 | 192 | F1(r, l, 9, 16); |
53 | 192 | F2(l, r, 10, 16); |
54 | 192 | F3(r, l, 11, 16); |
55 | | /* Only do full 16 rounds if key length > 80 bits */ |
56 | 192 | if (!reduced) { |
57 | 188 | F1(l, r, 12, 16); |
58 | 188 | F2(r, l, 13, 16); |
59 | 188 | F3(l, r, 14, 16); |
60 | 188 | F1(r, l, 15, 16); |
61 | 188 | } |
62 | | /* Put l,r into outblock */ |
63 | 192 | Block::Put(xorBlock, outBlock)(r)(l); |
64 | 192 | } |
65 | | |
66 | | void CAST128::Dec::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const |
67 | 774 | { |
68 | 774 | word32 &t=m_t[0], &l=m_t[1], &r=m_t[2]; |
69 | | |
70 | | /* Get inblock into l,r */ |
71 | 774 | Block::Get(inBlock)(r)(l); |
72 | | /* Only do full 16 rounds if key length > 80 bits */ |
73 | 774 | if (!reduced) { |
74 | 774 | F1(r, l, 15, 16); |
75 | 774 | F3(l, r, 14, 16); |
76 | 774 | F2(r, l, 13, 16); |
77 | 774 | F1(l, r, 12, 16); |
78 | 774 | } |
79 | 774 | F3(r, l, 11, 16); |
80 | 774 | F2(l, r, 10, 16); |
81 | 774 | F1(r, l, 9, 16); |
82 | 774 | F3(l, r, 8, 16); |
83 | 774 | F2(r, l, 7, 16); |
84 | 774 | F1(l, r, 6, 16); |
85 | 774 | F3(r, l, 5, 16); |
86 | 774 | F2(l, r, 4, 16); |
87 | 774 | F1(r, l, 3, 16); |
88 | 774 | F3(l, r, 2, 16); |
89 | 774 | F2(r, l, 1, 16); |
90 | 774 | F1(l, r, 0, 16); |
91 | | /* Put l,r into outblock */ |
92 | 774 | Block::Put(xorBlock, outBlock)(l)(r); |
93 | 774 | } |
94 | | |
95 | | void CAST128::Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) |
96 | 28 | { |
97 | 28 | AssertValidKeyLength(keylength); |
98 | | |
99 | 28 | reduced = (keylength <= 10); |
100 | | |
101 | 28 | word32 X[4], Z[4]={0}; |
102 | 28 | GetUserKey(BIG_ENDIAN_ORDER, X, 4, userKey, keylength); |
103 | | |
104 | 4.48k | #define x(i) GETBYTE(X[i/4], 3-i%4) |
105 | 4.48k | #define z(i) GETBYTE(Z[i/4], 3-i%4) |
106 | | |
107 | 28 | unsigned int i; |
108 | 84 | for (i=0; i<=16; i+=16) |
109 | 56 | { |
110 | | // this part is copied directly from RFC 2144 (with some search and replace) by Wei Dai |
111 | 56 | Z[0] = X[0] ^ S[4][x(0xD)] ^ S[5][x(0xF)] ^ S[6][x(0xC)] ^ S[7][x(0xE)] ^ S[6][x(0x8)]; |
112 | 56 | Z[1] = X[2] ^ S[4][z(0x0)] ^ S[5][z(0x2)] ^ S[6][z(0x1)] ^ S[7][z(0x3)] ^ S[7][x(0xA)]; |
113 | 56 | Z[2] = X[3] ^ S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[4][x(0x9)]; |
114 | 56 | Z[3] = X[1] ^ S[4][z(0xA)] ^ S[5][z(0x9)] ^ S[6][z(0xB)] ^ S[7][z(0x8)] ^ S[5][x(0xB)]; |
115 | 56 | K[i+0] = S[4][z(0x8)] ^ S[5][z(0x9)] ^ S[6][z(0x7)] ^ S[7][z(0x6)] ^ S[4][z(0x2)]; |
116 | 56 | K[i+1] = S[4][z(0xA)] ^ S[5][z(0xB)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[5][z(0x6)]; |
117 | 56 | K[i+2] = S[4][z(0xC)] ^ S[5][z(0xD)] ^ S[6][z(0x3)] ^ S[7][z(0x2)] ^ S[6][z(0x9)]; |
118 | 56 | K[i+3] = S[4][z(0xE)] ^ S[5][z(0xF)] ^ S[6][z(0x1)] ^ S[7][z(0x0)] ^ S[7][z(0xC)]; |
119 | 56 | X[0] = Z[2] ^ S[4][z(0x5)] ^ S[5][z(0x7)] ^ S[6][z(0x4)] ^ S[7][z(0x6)] ^ S[6][z(0x0)]; |
120 | 56 | X[1] = Z[0] ^ S[4][x(0x0)] ^ S[5][x(0x2)] ^ S[6][x(0x1)] ^ S[7][x(0x3)] ^ S[7][z(0x2)]; |
121 | 56 | X[2] = Z[1] ^ S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[4][z(0x1)]; |
122 | 56 | X[3] = Z[3] ^ S[4][x(0xA)] ^ S[5][x(0x9)] ^ S[6][x(0xB)] ^ S[7][x(0x8)] ^ S[5][z(0x3)]; |
123 | 56 | K[i+4] = S[4][x(0x3)] ^ S[5][x(0x2)] ^ S[6][x(0xC)] ^ S[7][x(0xD)] ^ S[4][x(0x8)]; |
124 | 56 | K[i+5] = S[4][x(0x1)] ^ S[5][x(0x0)] ^ S[6][x(0xE)] ^ S[7][x(0xF)] ^ S[5][x(0xD)]; |
125 | 56 | K[i+6] = S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x8)] ^ S[7][x(0x9)] ^ S[6][x(0x3)]; |
126 | 56 | K[i+7] = S[4][x(0x5)] ^ S[5][x(0x4)] ^ S[6][x(0xA)] ^ S[7][x(0xB)] ^ S[7][x(0x7)]; |
127 | 56 | Z[0] = X[0] ^ S[4][x(0xD)] ^ S[5][x(0xF)] ^ S[6][x(0xC)] ^ S[7][x(0xE)] ^ S[6][x(0x8)]; |
128 | 56 | Z[1] = X[2] ^ S[4][z(0x0)] ^ S[5][z(0x2)] ^ S[6][z(0x1)] ^ S[7][z(0x3)] ^ S[7][x(0xA)]; |
129 | 56 | Z[2] = X[3] ^ S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x5)] ^ S[7][z(0x4)] ^ S[4][x(0x9)]; |
130 | 56 | Z[3] = X[1] ^ S[4][z(0xA)] ^ S[5][z(0x9)] ^ S[6][z(0xB)] ^ S[7][z(0x8)] ^ S[5][x(0xB)]; |
131 | 56 | K[i+8] = S[4][z(0x3)] ^ S[5][z(0x2)] ^ S[6][z(0xC)] ^ S[7][z(0xD)] ^ S[4][z(0x9)]; |
132 | 56 | K[i+9] = S[4][z(0x1)] ^ S[5][z(0x0)] ^ S[6][z(0xE)] ^ S[7][z(0xF)] ^ S[5][z(0xC)]; |
133 | 56 | K[i+10] = S[4][z(0x7)] ^ S[5][z(0x6)] ^ S[6][z(0x8)] ^ S[7][z(0x9)] ^ S[6][z(0x2)]; |
134 | 56 | K[i+11] = S[4][z(0x5)] ^ S[5][z(0x4)] ^ S[6][z(0xA)] ^ S[7][z(0xB)] ^ S[7][z(0x6)]; |
135 | 56 | X[0] = Z[2] ^ S[4][z(0x5)] ^ S[5][z(0x7)] ^ S[6][z(0x4)] ^ S[7][z(0x6)] ^ S[6][z(0x0)]; |
136 | 56 | X[1] = Z[0] ^ S[4][x(0x0)] ^ S[5][x(0x2)] ^ S[6][x(0x1)] ^ S[7][x(0x3)] ^ S[7][z(0x2)]; |
137 | 56 | X[2] = Z[1] ^ S[4][x(0x7)] ^ S[5][x(0x6)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[4][z(0x1)]; |
138 | 56 | X[3] = Z[3] ^ S[4][x(0xA)] ^ S[5][x(0x9)] ^ S[6][x(0xB)] ^ S[7][x(0x8)] ^ S[5][z(0x3)]; |
139 | 56 | K[i+12] = S[4][x(0x8)] ^ S[5][x(0x9)] ^ S[6][x(0x7)] ^ S[7][x(0x6)] ^ S[4][x(0x3)]; |
140 | 56 | K[i+13] = S[4][x(0xA)] ^ S[5][x(0xB)] ^ S[6][x(0x5)] ^ S[7][x(0x4)] ^ S[5][x(0x7)]; |
141 | 56 | K[i+14] = S[4][x(0xC)] ^ S[5][x(0xD)] ^ S[6][x(0x3)] ^ S[7][x(0x2)] ^ S[6][x(0x8)]; |
142 | 56 | K[i+15] = S[4][x(0xE)] ^ S[5][x(0xF)] ^ S[6][x(0x1)] ^ S[7][x(0x0)] ^ S[7][x(0xD)]; |
143 | 56 | } |
144 | | |
145 | 476 | for (i=16; i<32; i++) |
146 | 448 | K[i] &= 0x1f; |
147 | 28 | } |
148 | | |
149 | | // The following CAST-256 implementation was contributed by Leonard Janke |
150 | | |
151 | | const word32 CAST256::Base::t_m[8][24]={ |
152 | | { 0x5a827999, 0xd151d6a1, 0x482133a9, 0xbef090b1, 0x35bfedb9, 0xac8f4ac1, |
153 | | 0x235ea7c9, 0x9a2e04d1, 0x10fd61d9, 0x87ccbee1, 0xfe9c1be9, 0x756b78f1, |
154 | | 0xec3ad5f9, 0x630a3301, 0xd9d99009, 0x50a8ed11, 0xc7784a19, 0x3e47a721, |
155 | | 0xb5170429, 0x2be66131, 0xa2b5be39, 0x19851b41, 0x90547849, 0x0723d551}, |
156 | | { 0xc95c653a, 0x402bc242, 0xb6fb1f4a, 0x2dca7c52, 0xa499d95a, 0x1b693662, |
157 | | 0x9238936a, 0x0907f072, 0x7fd74d7a, 0xf6a6aa82, 0x6d76078a, 0xe4456492, |
158 | | 0x5b14c19a, 0xd1e41ea2, 0x48b37baa, 0xbf82d8b2, 0x365235ba, 0xad2192c2, |
159 | | 0x23f0efca, 0x9ac04cd2, 0x118fa9da, 0x885f06e2, 0xff2e63ea, 0x75fdc0f2}, |
160 | | { 0x383650db, 0xaf05ade3, 0x25d50aeb, 0x9ca467f3, 0x1373c4fb, 0x8a432203, |
161 | | 0x01127f0b, 0x77e1dc13, 0xeeb1391b, 0x65809623, 0xdc4ff32b, 0x531f5033, |
162 | | 0xc9eead3b, 0x40be0a43, 0xb78d674b, 0x2e5cc453, 0xa52c215b, 0x1bfb7e63, |
163 | | 0x92cadb6b, 0x099a3873, 0x8069957b, 0xf738f283, 0x6e084f8b, 0xe4d7ac93}, |
164 | | { 0xa7103c7c, 0x1ddf9984, 0x94aef68c, 0x0b7e5394, 0x824db09c, 0xf91d0da4, |
165 | | 0x6fec6aac, 0xe6bbc7b4, 0x5d8b24bc, 0xd45a81c4, 0x4b29decc, 0xc1f93bd4, |
166 | | 0x38c898dc, 0xaf97f5e4, 0x266752ec, 0x9d36aff4, 0x14060cfc, 0x8ad56a04, |
167 | | 0x01a4c70c, 0x78742414, 0xef43811c, 0x6612de24, 0xdce23b2c, 0x53b19834}, |
168 | | { 0x15ea281d, 0x8cb98525, 0x0388e22d, 0x7a583f35, 0xf1279c3d, 0x67f6f945, |
169 | | 0xdec6564d, 0x5595b355, 0xcc65105d, 0x43346d65, 0xba03ca6d, 0x30d32775, |
170 | | 0xa7a2847d, 0x1e71e185, 0x95413e8d, 0x0c109b95, 0x82dff89d, 0xf9af55a5, |
171 | | 0x707eb2ad, 0xe74e0fb5, 0x5e1d6cbd, 0xd4ecc9c5, 0x4bbc26cd, 0xc28b83d5}, |
172 | | { 0x84c413be, 0xfb9370c6, 0x7262cdce, 0xe9322ad6, 0x600187de, 0xd6d0e4e6, |
173 | | 0x4da041ee, 0xc46f9ef6, 0x3b3efbfe, 0xb20e5906, 0x28ddb60e, 0x9fad1316, |
174 | | 0x167c701e, 0x8d4bcd26, 0x041b2a2e, 0x7aea8736, 0xf1b9e43e, 0x68894146, |
175 | | 0xdf589e4e, 0x5627fb56, 0xccf7585e, 0x43c6b566, 0xba96126e, 0x31656f76}, |
176 | | { 0xf39dff5f, 0x6a6d5c67, 0xe13cb96f, 0x580c1677, 0xcedb737f, 0x45aad087, |
177 | | 0xbc7a2d8f, 0x33498a97, 0xaa18e79f, 0x20e844a7, 0x97b7a1af, 0x0e86feb7, |
178 | | 0x85565bbf, 0xfc25b8c7, 0x72f515cf, 0xe9c472d7, 0x6093cfdf, 0xd7632ce7, |
179 | | 0x4e3289ef, 0xc501e6f7, 0x3bd143ff, 0xb2a0a107, 0x296ffe0f, 0xa03f5b17}, |
180 | | { 0x6277eb00, 0xd9474808, 0x5016a510, 0xc6e60218, 0x3db55f20, 0xb484bc28, |
181 | | 0x2b541930, 0xa2237638, 0x18f2d340, 0x8fc23048, 0x06918d50, 0x7d60ea58, |
182 | | 0xf4304760, 0x6affa468, 0xe1cf0170, 0x589e5e78, 0xcf6dbb80, 0x463d1888, |
183 | | 0xbd0c7590, 0x33dbd298, 0xaaab2fa0, 0x217a8ca8, 0x9849e9b0, 0x0f1946b8} |
184 | | }; |
185 | | |
186 | | const unsigned int CAST256::Base::t_r[8][24]={ |
187 | | {19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11, 19, 27, 3, 11}, |
188 | | {4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28, 4, 12, 20, 28}, |
189 | | {21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13, 21, 29, 5, 13}, |
190 | | {6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30, 6, 14, 22, 30}, |
191 | | {23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15, 23, 31, 7, 15}, |
192 | | {8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0, 8, 16, 24, 0}, |
193 | | {25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17, 25, 1, 9, 17}, |
194 | | {10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2, 10, 18, 26, 2} |
195 | | }; |
196 | | |
197 | | #define Q(i) \ |
198 | 0 | F1(block[2],block[3],8*i+4,-4); \ |
199 | 0 | F2(block[1],block[2],8*i+5,-4); \ |
200 | 0 | F3(block[0],block[1],8*i+6,-4); \ |
201 | 0 | F1(block[3],block[0],8*i+7,-4); |
202 | | |
203 | | #define QBar(i) \ |
204 | 0 | F1(block[3],block[0],8*i+7,-4); \ |
205 | 0 | F3(block[0],block[1],8*i+6,-4); \ |
206 | 0 | F2(block[1],block[2],8*i+5,-4); \ |
207 | 0 | F1(block[2],block[3],8*i+4,-4); |
208 | | |
209 | | /* CAST256's encrypt/decrypt functions are identical except for the order that |
210 | | the keys are used */ |
211 | | |
212 | | void CAST256::Base::ProcessAndXorBlock(const byte *inBlock, const byte *xorBlock, byte *outBlock) const |
213 | 0 | { |
214 | | // TODO: add a SecBlock workspace to the class when the ABI can change |
215 | 0 | word32 t, block[4]; |
216 | 0 | Block::Get(inBlock)(block[0])(block[1])(block[2])(block[3]); |
217 | | |
218 | | // Perform 6 forward quad rounds |
219 | 0 | Q(0); |
220 | 0 | Q(1); |
221 | 0 | Q(2); |
222 | 0 | Q(3); |
223 | 0 | Q(4); |
224 | 0 | Q(5); |
225 | | |
226 | | // Perform 6 reverse quad rounds |
227 | 0 | QBar(6); |
228 | 0 | QBar(7); |
229 | 0 | QBar(8); |
230 | 0 | QBar(9); |
231 | 0 | QBar(10); |
232 | 0 | QBar(11); |
233 | |
|
234 | 0 | Block::Put(xorBlock, outBlock)(block[0])(block[1])(block[2])(block[3]); |
235 | 0 | } |
236 | | |
237 | | /* Set up a CAST-256 key */ |
238 | | |
239 | | void CAST256::Base::Omega(int i, word32 kappa[8]) |
240 | 0 | { |
241 | 0 | word32 t; |
242 | |
|
243 | 0 | f1(kappa[6],kappa[7],t_m[0][i],t_r[0][i]); |
244 | 0 | f2(kappa[5],kappa[6],t_m[1][i],t_r[1][i]); |
245 | 0 | f3(kappa[4],kappa[5],t_m[2][i],t_r[2][i]); |
246 | 0 | f1(kappa[3],kappa[4],t_m[3][i],t_r[3][i]); |
247 | 0 | f2(kappa[2],kappa[3],t_m[4][i],t_r[4][i]); |
248 | 0 | f3(kappa[1],kappa[2],t_m[5][i],t_r[5][i]); |
249 | 0 | f1(kappa[0],kappa[1],t_m[6][i],t_r[6][i]); |
250 | 0 | f2(kappa[7],kappa[0],t_m[7][i],t_r[7][i]); |
251 | 0 | } |
252 | | |
253 | | void CAST256::Base::UncheckedSetKey(const byte *userKey, unsigned int keylength, const NameValuePairs &) |
254 | 0 | { |
255 | 0 | AssertValidKeyLength(keylength); |
256 | |
|
257 | 0 | GetUserKey(BIG_ENDIAN_ORDER, kappa.begin(), 8, userKey, keylength); |
258 | |
|
259 | 0 | for(int i=0; i<12; ++i) |
260 | 0 | { |
261 | 0 | Omega(2*i,kappa); |
262 | 0 | Omega(2*i+1,kappa); |
263 | |
|
264 | 0 | K[8*i]=kappa[0] & 31; |
265 | 0 | K[8*i+1]=kappa[2] & 31; |
266 | 0 | K[8*i+2]=kappa[4] & 31; |
267 | 0 | K[8*i+3]=kappa[6] & 31; |
268 | 0 | K[8*i+4]=kappa[7]; |
269 | 0 | K[8*i+5]=kappa[5]; |
270 | 0 | K[8*i+6]=kappa[3]; |
271 | 0 | K[8*i+7]=kappa[1]; |
272 | 0 | } |
273 | |
|
274 | 0 | if (!IsForwardTransformation()) |
275 | 0 | { |
276 | 0 | for(int j=0; j<6; ++j) |
277 | 0 | { |
278 | 0 | for(int i=0; i<4; ++i) |
279 | 0 | { |
280 | 0 | int i1=8*j+i; |
281 | 0 | int i2=8*(11-j)+i; |
282 | |
|
283 | 0 | CRYPTOPP_ASSERT(i1<i2); |
284 | |
|
285 | 0 | std::swap(K[i1],K[i2]); |
286 | 0 | std::swap(K[i1+4],K[i2+4]); |
287 | 0 | } |
288 | 0 | } |
289 | 0 | } |
290 | 0 | } |
291 | | |
292 | | NAMESPACE_END |