3 Final key setup processing for the camellia block cipher.
5 Copyright (C) 2006,2007 NTT
6 (Nippon Telegraph and Telephone Corporation).
8 Copyright (C) 2010 Niels Möller
10 This file is part of GNU Nettle.
12 GNU Nettle is free software: you can redistribute it and/or
13 modify it under the terms of either:
15 * the GNU Lesser General Public License as published by the Free
16 Software Foundation; either version 3 of the License, or (at your
17 option) any later version.
21 * the GNU General Public License as published by the Free
22 Software Foundation; either version 2 of the License, or (at your
23 option) any later version.
25 or both in parallel, as here.
27 GNU Nettle is distributed in the hope that it will be useful,
28 but WITHOUT ANY WARRANTY; without even the implied warranty of
29 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
30 General Public License for more details.
32 You should have received copies of the GNU General Public License and
33 the GNU Lesser General Public License along with this program. If
34 not, see http://www.gnu.org/licenses/.
38 * Algorithm Specification
39 * http://info.isl.ntt.co.jp/crypt/eng/camellia/specifications.html
42 /* Based on camellia.c ver 1.2.0, see
43 http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/camellia-LGPL-1.2.0.tar.gz.
50 /* For CHAR_BIT, needed by HAVE_NATIVE_64_BIT */
53 #include "camellia-internal.h"
58 _camellia_absorb(unsigned nkeys, uint64_t *dst, uint64_t *subkey)
64 /* At this point, the subkey array contains the subkeys as described
65 in the spec, 26 for short keys and 34 for large keys. */
67 /* absorb kw2 to other subkeys */
73 for (i = 8; i < nkeys; i += 8)
75 /* FIXME: gcc for x86_32 is smart enough to fetch the 32 low bits
76 and xor the result into the 32 high bits, but it still generates
77 worse code than for explicit 32-bit operations. */
78 kw2 ^= (kw2 & ~subkey[i+1]) << 32;
79 dw = (kw2 & subkey[i+1]) >> 32; kw2 ^= ROTL32(1, dw);
87 /* absorb kw4 to other subkeys */
88 kw4 = subkey[nkeys + 1];
90 for (i = nkeys - 8; i > 0; i -= 8)
95 kw4 ^= (kw4 & ~subkey[i]) << 32;
96 dw = (kw4 & subkey[i]) >> 32; kw4 ^= ROTL32(1, dw);
104 /* key XOR is end of F-function */
105 dst[0] = subkey[0] ^ subkey[2];
108 dst[2] = subkey[2] ^ subkey[4];
109 dst[3] = subkey[3] ^ subkey[5];
110 dst[4] = subkey[4] ^ subkey[6];
111 dst[5] = subkey[5] ^ subkey[7];
113 for (i = 8; i < nkeys; i += 8)
115 tl = (subkey[i+2] >> 32) ^ (subkey[i+2] & ~subkey[i]);
116 dw = tl & (subkey[i] >> 32);
117 tr = subkey[i+2] ^ ROTL32(1, dw);
118 dst[i-2] = subkey[i-2] ^ ( ((uint64_t) tl << 32) | tr);
120 dst[i-1] = subkey[i];
121 dst[i] = subkey[i+1];
123 tl = (subkey[i-1] >> 32) ^ (subkey[i-1] & ~subkey[i+1]);
124 dw = tl & (subkey[i+1] >> 32);
125 tr = subkey[i-1] ^ ROTL32(1, dw);
126 dst[i+1] = subkey[i+3] ^ ( ((uint64_t) tl << 32) | tr);
128 dst[i+2] = subkey[i+2] ^ subkey[i+4];
129 dst[i+3] = subkey[i+3] ^ subkey[i+5];
130 dst[i+4] = subkey[i+4] ^ subkey[i+6];
131 dst[i+5] = subkey[i+5] ^ subkey[i+7];
133 dst[i-2] = subkey[i-2];
134 dst[i-1] = subkey[i] ^ subkey[i-1];
136 #if !HAVE_NATIVE_64_BIT
137 for (i = 0; i < nkeys; i += 8)
139 /* apply the inverse of the last half of F-function */
140 CAMELLIA_F_HALF_INV(dst[i+1]);
141 CAMELLIA_F_HALF_INV(dst[i+2]);
142 CAMELLIA_F_HALF_INV(dst[i+3]);
143 CAMELLIA_F_HALF_INV(dst[i+4]);
144 CAMELLIA_F_HALF_INV(dst[i+5]);
145 CAMELLIA_F_HALF_INV(dst[i+6]);