Botan 3.13.0
Crypto and TLS for C&
camellia.cpp
Go to the documentation of this file.
1/*
2* Camellia
3* (C) 2012,2020 Jack Lloyd
4*
5* Botan is released under the Simplified BSD License (see license.txt)
6*/
7
8#include <botan/internal/camellia.h>
9
10#include <botan/internal/loadstor.h>
11#include <botan/internal/prefetch.h>
12#include <botan/internal/rotate.h>
13
14#if defined(BOTAN_HAS_CPUID)
15 #include <botan/internal/cpuid.h>
16#endif
17
18namespace Botan {
19
20namespace {
21
22namespace Camellia_F {
23
24alignas(256) const uint8_t SBOX1[256] = {
25 0x70, 0x82, 0x2C, 0xEC, 0xB3, 0x27, 0xC0, 0xE5, 0xE4, 0x85, 0x57, 0x35, 0xEA, 0x0C, 0xAE, 0x41, 0x23, 0xEF, 0x6B,
26 0x93, 0x45, 0x19, 0xA5, 0x21, 0xED, 0x0E, 0x4F, 0x4E, 0x1D, 0x65, 0x92, 0xBD, 0x86, 0xB8, 0xAF, 0x8F, 0x7C, 0xEB,
27 0x1F, 0xCE, 0x3E, 0x30, 0xDC, 0x5F, 0x5E, 0xC5, 0x0B, 0x1A, 0xA6, 0xE1, 0x39, 0xCA, 0xD5, 0x47, 0x5D, 0x3D, 0xD9,
28 0x01, 0x5A, 0xD6, 0x51, 0x56, 0x6C, 0x4D, 0x8B, 0x0D, 0x9A, 0x66, 0xFB, 0xCC, 0xB0, 0x2D, 0x74, 0x12, 0x2B, 0x20,
29 0xF0, 0xB1, 0x84, 0x99, 0xDF, 0x4C, 0xCB, 0xC2, 0x34, 0x7E, 0x76, 0x05, 0x6D, 0xB7, 0xA9, 0x31, 0xD1, 0x17, 0x04,
30 0xD7, 0x14, 0x58, 0x3A, 0x61, 0xDE, 0x1B, 0x11, 0x1C, 0x32, 0x0F, 0x9C, 0x16, 0x53, 0x18, 0xF2, 0x22, 0xFE, 0x44,
31 0xCF, 0xB2, 0xC3, 0xB5, 0x7A, 0x91, 0x24, 0x08, 0xE8, 0xA8, 0x60, 0xFC, 0x69, 0x50, 0xAA, 0xD0, 0xA0, 0x7D, 0xA1,
32 0x89, 0x62, 0x97, 0x54, 0x5B, 0x1E, 0x95, 0xE0, 0xFF, 0x64, 0xD2, 0x10, 0xC4, 0x00, 0x48, 0xA3, 0xF7, 0x75, 0xDB,
33 0x8A, 0x03, 0xE6, 0xDA, 0x09, 0x3F, 0xDD, 0x94, 0x87, 0x5C, 0x83, 0x02, 0xCD, 0x4A, 0x90, 0x33, 0x73, 0x67, 0xF6,
34 0xF3, 0x9D, 0x7F, 0xBF, 0xE2, 0x52, 0x9B, 0xD8, 0x26, 0xC8, 0x37, 0xC6, 0x3B, 0x81, 0x96, 0x6F, 0x4B, 0x13, 0xBE,
35 0x63, 0x2E, 0xE9, 0x79, 0xA7, 0x8C, 0x9F, 0x6E, 0xBC, 0x8E, 0x29, 0xF5, 0xF9, 0xB6, 0x2F, 0xFD, 0xB4, 0x59, 0x78,
36 0x98, 0x06, 0x6A, 0xE7, 0x46, 0x71, 0xBA, 0xD4, 0x25, 0xAB, 0x42, 0x88, 0xA2, 0x8D, 0xFA, 0x72, 0x07, 0xB9, 0x55,
37 0xF8, 0xEE, 0xAC, 0x0A, 0x36, 0x49, 0x2A, 0x68, 0x3C, 0x38, 0xF1, 0xA4, 0x40, 0x28, 0xD3, 0x7B, 0xBB, 0xC9, 0x43,
38 0xC1, 0x15, 0xE3, 0xAD, 0xF4, 0x77, 0xC7, 0x80, 0x9E};
39
40// SBOX2[x] = rotl<1>(SBOX1[x])
41alignas(256) const uint8_t SBOX2[256] = {
42 0xE0, 0x05, 0x58, 0xD9, 0x67, 0x4E, 0x81, 0xCB, 0xC9, 0x0B, 0xAE, 0x6A, 0xD5, 0x18, 0x5D, 0x82, 0x46, 0xDF, 0xD6,
43 0x27, 0x8A, 0x32, 0x4B, 0x42, 0xDB, 0x1C, 0x9E, 0x9C, 0x3A, 0xCA, 0x25, 0x7B, 0x0D, 0x71, 0x5F, 0x1F, 0xF8, 0xD7,
44 0x3E, 0x9D, 0x7C, 0x60, 0xB9, 0xBE, 0xBC, 0x8B, 0x16, 0x34, 0x4D, 0xC3, 0x72, 0x95, 0xAB, 0x8E, 0xBA, 0x7A, 0xB3,
45 0x02, 0xB4, 0xAD, 0xA2, 0xAC, 0xD8, 0x9A, 0x17, 0x1A, 0x35, 0xCC, 0xF7, 0x99, 0x61, 0x5A, 0xE8, 0x24, 0x56, 0x40,
46 0xE1, 0x63, 0x09, 0x33, 0xBF, 0x98, 0x97, 0x85, 0x68, 0xFC, 0xEC, 0x0A, 0xDA, 0x6F, 0x53, 0x62, 0xA3, 0x2E, 0x08,
47 0xAF, 0x28, 0xB0, 0x74, 0xC2, 0xBD, 0x36, 0x22, 0x38, 0x64, 0x1E, 0x39, 0x2C, 0xA6, 0x30, 0xE5, 0x44, 0xFD, 0x88,
48 0x9F, 0x65, 0x87, 0x6B, 0xF4, 0x23, 0x48, 0x10, 0xD1, 0x51, 0xC0, 0xF9, 0xD2, 0xA0, 0x55, 0xA1, 0x41, 0xFA, 0x43,
49 0x13, 0xC4, 0x2F, 0xA8, 0xB6, 0x3C, 0x2B, 0xC1, 0xFF, 0xC8, 0xA5, 0x20, 0x89, 0x00, 0x90, 0x47, 0xEF, 0xEA, 0xB7,
50 0x15, 0x06, 0xCD, 0xB5, 0x12, 0x7E, 0xBB, 0x29, 0x0F, 0xB8, 0x07, 0x04, 0x9B, 0x94, 0x21, 0x66, 0xE6, 0xCE, 0xED,
51 0xE7, 0x3B, 0xFE, 0x7F, 0xC5, 0xA4, 0x37, 0xB1, 0x4C, 0x91, 0x6E, 0x8D, 0x76, 0x03, 0x2D, 0xDE, 0x96, 0x26, 0x7D,
52 0xC6, 0x5C, 0xD3, 0xF2, 0x4F, 0x19, 0x3F, 0xDC, 0x79, 0x1D, 0x52, 0xEB, 0xF3, 0x6D, 0x5E, 0xFB, 0x69, 0xB2, 0xF0,
53 0x31, 0x0C, 0xD4, 0xCF, 0x8C, 0xE2, 0x75, 0xA9, 0x4A, 0x57, 0x84, 0x11, 0x45, 0x1B, 0xF5, 0xE4, 0x0E, 0x73, 0xAA,
54 0xF1, 0xDD, 0x59, 0x14, 0x6C, 0x92, 0x54, 0xD0, 0x78, 0x70, 0xE3, 0x49, 0x80, 0x50, 0xA7, 0xF6, 0x77, 0x93, 0x86,
55 0x83, 0x2A, 0xC7, 0x5B, 0xE9, 0xEE, 0x8F, 0x01, 0x3D};
56
57// SBOX3[x] = rotl<7>(SBOX1[x])
58alignas(256) const uint8_t SBOX3[256] = {
59 0x38, 0x41, 0x16, 0x76, 0xD9, 0x93, 0x60, 0xF2, 0x72, 0xC2, 0xAB, 0x9A, 0x75, 0x06, 0x57, 0xA0, 0x91, 0xF7, 0xB5,
60 0xC9, 0xA2, 0x8C, 0xD2, 0x90, 0xF6, 0x07, 0xA7, 0x27, 0x8E, 0xB2, 0x49, 0xDE, 0x43, 0x5C, 0xD7, 0xC7, 0x3E, 0xF5,
61 0x8F, 0x67, 0x1F, 0x18, 0x6E, 0xAF, 0x2F, 0xE2, 0x85, 0x0D, 0x53, 0xF0, 0x9C, 0x65, 0xEA, 0xA3, 0xAE, 0x9E, 0xEC,
62 0x80, 0x2D, 0x6B, 0xA8, 0x2B, 0x36, 0xA6, 0xC5, 0x86, 0x4D, 0x33, 0xFD, 0x66, 0x58, 0x96, 0x3A, 0x09, 0x95, 0x10,
63 0x78, 0xD8, 0x42, 0xCC, 0xEF, 0x26, 0xE5, 0x61, 0x1A, 0x3F, 0x3B, 0x82, 0xB6, 0xDB, 0xD4, 0x98, 0xE8, 0x8B, 0x02,
64 0xEB, 0x0A, 0x2C, 0x1D, 0xB0, 0x6F, 0x8D, 0x88, 0x0E, 0x19, 0x87, 0x4E, 0x0B, 0xA9, 0x0C, 0x79, 0x11, 0x7F, 0x22,
65 0xE7, 0x59, 0xE1, 0xDA, 0x3D, 0xC8, 0x12, 0x04, 0x74, 0x54, 0x30, 0x7E, 0xB4, 0x28, 0x55, 0x68, 0x50, 0xBE, 0xD0,
66 0xC4, 0x31, 0xCB, 0x2A, 0xAD, 0x0F, 0xCA, 0x70, 0xFF, 0x32, 0x69, 0x08, 0x62, 0x00, 0x24, 0xD1, 0xFB, 0xBA, 0xED,
67 0x45, 0x81, 0x73, 0x6D, 0x84, 0x9F, 0xEE, 0x4A, 0xC3, 0x2E, 0xC1, 0x01, 0xE6, 0x25, 0x48, 0x99, 0xB9, 0xB3, 0x7B,
68 0xF9, 0xCE, 0xBF, 0xDF, 0x71, 0x29, 0xCD, 0x6C, 0x13, 0x64, 0x9B, 0x63, 0x9D, 0xC0, 0x4B, 0xB7, 0xA5, 0x89, 0x5F,
69 0xB1, 0x17, 0xF4, 0xBC, 0xD3, 0x46, 0xCF, 0x37, 0x5E, 0x47, 0x94, 0xFA, 0xFC, 0x5B, 0x97, 0xFE, 0x5A, 0xAC, 0x3C,
70 0x4C, 0x03, 0x35, 0xF3, 0x23, 0xB8, 0x5D, 0x6A, 0x92, 0xD5, 0x21, 0x44, 0x51, 0xC6, 0x7D, 0x39, 0x83, 0xDC, 0xAA,
71 0x7C, 0x77, 0x56, 0x05, 0x1B, 0xA4, 0x15, 0x34, 0x1E, 0x1C, 0xF8, 0x52, 0x20, 0x14, 0xE9, 0xBD, 0xDD, 0xE4, 0xA1,
72 0xE0, 0x8A, 0xF1, 0xD6, 0x7A, 0xBB, 0xE3, 0x40, 0x4F};
73
74// SBOX4[x] = SBOX1[rotl<1>(x)]
75alignas(256) const uint8_t SBOX4[256] = {
76 0x70, 0x2C, 0xB3, 0xC0, 0xE4, 0x57, 0xEA, 0xAE, 0x23, 0x6B, 0x45, 0xA5, 0xED, 0x4F, 0x1D, 0x92, 0x86, 0xAF, 0x7C,
77 0x1F, 0x3E, 0xDC, 0x5E, 0x0B, 0xA6, 0x39, 0xD5, 0x5D, 0xD9, 0x5A, 0x51, 0x6C, 0x8B, 0x9A, 0xFB, 0xB0, 0x74, 0x2B,
78 0xF0, 0x84, 0xDF, 0xCB, 0x34, 0x76, 0x6D, 0xA9, 0xD1, 0x04, 0x14, 0x3A, 0xDE, 0x11, 0x32, 0x9C, 0x53, 0xF2, 0xFE,
79 0xCF, 0xC3, 0x7A, 0x24, 0xE8, 0x60, 0x69, 0xAA, 0xA0, 0xA1, 0x62, 0x54, 0x1E, 0xE0, 0x64, 0x10, 0x00, 0xA3, 0x75,
80 0x8A, 0xE6, 0x09, 0xDD, 0x87, 0x83, 0xCD, 0x90, 0x73, 0xF6, 0x9D, 0xBF, 0x52, 0xD8, 0xC8, 0xC6, 0x81, 0x6F, 0x13,
81 0x63, 0xE9, 0xA7, 0x9F, 0xBC, 0x29, 0xF9, 0x2F, 0xB4, 0x78, 0x06, 0xE7, 0x71, 0xD4, 0xAB, 0x88, 0x8D, 0x72, 0xB9,
82 0xF8, 0xAC, 0x36, 0x2A, 0x3C, 0xF1, 0x40, 0xD3, 0xBB, 0x43, 0x15, 0xAD, 0x77, 0x80, 0x82, 0xEC, 0x27, 0xE5, 0x85,
83 0x35, 0x0C, 0x41, 0xEF, 0x93, 0x19, 0x21, 0x0E, 0x4E, 0x65, 0xBD, 0xB8, 0x8F, 0xEB, 0xCE, 0x30, 0x5F, 0xC5, 0x1A,
84 0xE1, 0xCA, 0x47, 0x3D, 0x01, 0xD6, 0x56, 0x4D, 0x0D, 0x66, 0xCC, 0x2D, 0x12, 0x20, 0xB1, 0x99, 0x4C, 0xC2, 0x7E,
85 0x05, 0xB7, 0x31, 0x17, 0xD7, 0x58, 0x61, 0x1B, 0x1C, 0x0F, 0x16, 0x18, 0x22, 0x44, 0xB2, 0xB5, 0x91, 0x08, 0xA8,
86 0xFC, 0x50, 0xD0, 0x7D, 0x89, 0x97, 0x5B, 0x95, 0xFF, 0xD2, 0xC4, 0x48, 0xF7, 0xDB, 0x03, 0xDA, 0x3F, 0x94, 0x5C,
87 0x02, 0x4A, 0x33, 0x67, 0xF3, 0x7F, 0xE2, 0x9B, 0x26, 0x37, 0x3B, 0x96, 0x4B, 0xBE, 0x2E, 0x79, 0x8C, 0x6E, 0x8E,
88 0xF5, 0xB6, 0xFD, 0x59, 0x98, 0x6A, 0x46, 0xBA, 0x25, 0x42, 0xA2, 0xFA, 0x07, 0x55, 0xEE, 0x0A, 0x49, 0x68, 0x38,
89 0xA4, 0x28, 0x7B, 0xC9, 0xC1, 0xE3, 0xF4, 0xC7, 0x9E};
90
91/*
92* See Section 4.6 of "Specification of Camellia - A 128-bit Block Cipher"
93* (Aoki, Ichikawa, Kanda, Matsui, Moriai, Nakajima, Tokita)
94* https://www.cryptrec.go.jp/en/cryptrec_03_spec_cypherlist_files/PDF/06_01espec.pdf
95*/
96inline uint64_t P(uint8_t z1, uint8_t z2, uint8_t z3, uint8_t z4, uint8_t z5, uint8_t z6, uint8_t z7, uint8_t z8) {
97 constexpr uint64_t M1 = 0x0101010001000001;
98 constexpr uint64_t M2 = 0x0001010101010000;
99 constexpr uint64_t M3 = 0x0100010100010100;
100 constexpr uint64_t M4 = 0x0101000100000101;
101 constexpr uint64_t M5 = 0x0001010100010101;
102 constexpr uint64_t M6 = 0x0100010101000101;
103 constexpr uint64_t M7 = 0x0101000101010001;
104 constexpr uint64_t M8 = 0x0101010001010100;
105
106 const uint64_t Z1 = M1 * z1;
107 const uint64_t Z2 = M2 * z2;
108 const uint64_t Z3 = M3 * z3;
109 const uint64_t Z4 = M4 * z4;
110 const uint64_t Z5 = M5 * z5;
111 const uint64_t Z6 = M6 * z6;
112 const uint64_t Z7 = M7 * z7;
113 const uint64_t Z8 = M8 * z8;
114
115 return Z1 ^ Z2 ^ Z3 ^ Z4 ^ Z5 ^ Z6 ^ Z7 ^ Z8;
116}
117
118uint64_t F(uint64_t v, uint64_t K) {
119 const uint64_t x = v ^ K;
120
121 return P(SBOX1[get_byte<0>(x)],
122 SBOX2[get_byte<1>(x)],
123 SBOX3[get_byte<2>(x)],
124 SBOX4[get_byte<3>(x)],
125 SBOX2[get_byte<4>(x)],
126 SBOX3[get_byte<5>(x)],
127 SBOX4[get_byte<6>(x)],
128 SBOX1[get_byte<7>(x)]);
129}
130
131uint64_t F_1tab(uint64_t v, uint64_t K) {
132 const uint64_t x = v ^ K;
133
134 return P(SBOX1[get_byte<0>(x)],
135 rotl<1>(SBOX1[get_byte<1>(x)]),
136 rotl<7>(SBOX1[get_byte<2>(x)]),
137 SBOX1[rotl<1>(get_byte<3>(x))],
138 rotl<1>(SBOX1[get_byte<4>(x)]),
139 rotl<7>(SBOX1[get_byte<5>(x)]),
140 SBOX1[rotl<1>(get_byte<6>(x))],
141 SBOX1[get_byte<7>(x)]);
142}
143
144inline uint64_t FL(uint64_t v, uint64_t K) {
145 uint32_t x1 = static_cast<uint32_t>(v >> 32);
146 uint32_t x2 = static_cast<uint32_t>(v & 0xFFFFFFFF);
147
148 const uint32_t k1 = static_cast<uint32_t>(K >> 32);
149 const uint32_t k2 = static_cast<uint32_t>(K & 0xFFFFFFFF);
150
151 x2 ^= rotl<1>(x1 & k1);
152 x1 ^= (x2 | k2);
153
154 return ((static_cast<uint64_t>(x1) << 32) | x2);
155}
156
157inline uint64_t FLINV(uint64_t v, uint64_t K) {
158 uint32_t x1 = static_cast<uint32_t>(v >> 32);
159 uint32_t x2 = static_cast<uint32_t>(v & 0xFFFFFFFF);
160
161 const uint32_t k1 = static_cast<uint32_t>(K >> 32);
162 const uint32_t k2 = static_cast<uint32_t>(K & 0xFFFFFFFF);
163
164 x1 ^= (x2 | k2);
165 x2 ^= rotl<1>(x1 & k1);
166
167 return ((static_cast<uint64_t>(x1) << 32) | x2);
168}
169
170/*
171* Camellia Encryption
172*/
173void encrypt(const uint8_t in[], uint8_t out[], size_t blocks, const secure_vector<uint64_t>& SK, size_t rounds) {
174 prefetch_arrays(SBOX1, SBOX2, SBOX3, SBOX4);
175
176 for(size_t i = 0; i < blocks; ++i) {
177 uint64_t D1 = load_be<uint64_t>(in, 2 * i + 0);
178 uint64_t D2 = load_be<uint64_t>(in, 2 * i + 1);
179
180 const uint64_t* K = SK.data();
181
182 D1 ^= *K++;
183 D2 ^= *K++;
184
185 D2 ^= F(D1, *K++);
186 D1 ^= F(D2, *K++);
187
188 for(size_t r = 1; r != rounds - 1; ++r) {
189 if(r % 3 == 0) {
190 D1 = FL(D1, *K++);
191 D2 = FLINV(D2, *K++);
192 }
193
194 D2 ^= F(D1, *K++);
195 D1 ^= F(D2, *K++);
196 }
197
198 D2 ^= F(D1, *K++);
199 D1 ^= F(D2, *K++);
200
201 D2 ^= *K++;
202 D1 ^= *K++;
203
204 store_be(out + 16 * i, D2, D1);
205 }
206}
207
208/*
209* Camellia Decryption
210*/
211void decrypt(const uint8_t in[], uint8_t out[], size_t blocks, const secure_vector<uint64_t>& SK, size_t rounds) {
212 prefetch_arrays(SBOX1, SBOX2, SBOX3, SBOX4);
213
214 for(size_t i = 0; i < blocks; ++i) {
215 uint64_t D1 = load_be<uint64_t>(in, 2 * i + 0);
216 uint64_t D2 = load_be<uint64_t>(in, 2 * i + 1);
217
218 const uint64_t* K = &SK[SK.size() - 1];
219
220 D2 ^= *K--;
221 D1 ^= *K--;
222
223 D2 ^= F(D1, *K--);
224 D1 ^= F(D2, *K--);
225
226 for(size_t r = 1; r != rounds - 1; ++r) {
227 if(r % 3 == 0) {
228 D1 = FL(D1, *K--);
229 D2 = FLINV(D2, *K--);
230 }
231
232 D2 ^= F(D1, *K--);
233 D1 ^= F(D2, *K--);
234 }
235
236 D2 ^= F(D1, *K--);
237 D1 ^= F(D2, *K--);
238
239 D1 ^= *K--;
240 D2 ^= *K;
241
242 store_be(out + 16 * i, D2, D1);
243 }
244}
245
246inline uint64_t left_rot_hi(uint64_t h, uint64_t l, size_t shift) {
247 if(shift >= 64) {
248 shift -= 64;
249 }
250 return (h << shift) | (l >> (64 - shift));
251}
252
253inline uint64_t left_rot_lo(uint64_t h, uint64_t l, size_t shift) {
254 if(shift >= 64) {
255 shift -= 64;
256 }
257 return (h >> (64 - shift)) | (l << shift);
258}
259
260/*
261* Camellia Key Schedule
262*/
263void key_schedule(secure_vector<uint64_t>& SK, std::span<const uint8_t> key) {
264 prefetch_arrays(SBOX1);
265
266 constexpr uint64_t Sigma1 = 0xA09E667F3BCC908B;
267 constexpr uint64_t Sigma2 = 0xB67AE8584CAA73B2;
268 constexpr uint64_t Sigma3 = 0xC6EF372FE94F82BE;
269 constexpr uint64_t Sigma4 = 0x54FF53A5F1D36F1C;
270 constexpr uint64_t Sigma5 = 0x10E527FADE682D1D;
271 constexpr uint64_t Sigma6 = 0xB05688C2B3E6C1FD;
272
273 const uint64_t KL_H = load_be<uint64_t>(key.data(), 0);
274 const uint64_t KL_L = load_be<uint64_t>(key.data(), 1);
275
276 const uint64_t KR_H = (key.size() >= 24) ? load_be<uint64_t>(key.data(), 2) : 0;
277
278 const uint64_t KR_L = [&]() -> uint64_t {
279 if(key.size() == 32) {
280 return load_be<uint64_t>(key.data(), 3);
281 } else if(key.size() == 24) {
282 return ~KR_H;
283 } else {
284 return 0;
285 }
286 }();
287
288 uint64_t D1 = KL_H ^ KR_H;
289 uint64_t D2 = KL_L ^ KR_L;
290 D2 ^= F_1tab(D1, Sigma1);
291 D1 ^= F_1tab(D2, Sigma2);
292 D1 ^= KL_H;
293 D2 ^= KL_L;
294 D2 ^= F_1tab(D1, Sigma3);
295 D1 ^= F_1tab(D2, Sigma4);
296
297 const uint64_t KA_H = D1;
298 const uint64_t KA_L = D2;
299
300 D1 = KA_H ^ KR_H;
301 D2 = KA_L ^ KR_L;
302 D2 ^= F_1tab(D1, Sigma5);
303 D1 ^= F_1tab(D2, Sigma6);
304
305 const uint64_t KB_H = D1;
306 const uint64_t KB_L = D2;
307
308 if(key.size() == 16) {
309 SK.resize(26);
310
311 SK[0] = KL_H;
312 SK[1] = KL_L;
313 SK[2] = KA_H;
314 SK[3] = KA_L;
315 SK[4] = left_rot_hi(KL_H, KL_L, 15);
316 SK[5] = left_rot_lo(KL_H, KL_L, 15);
317 SK[6] = left_rot_hi(KA_H, KA_L, 15);
318 SK[7] = left_rot_lo(KA_H, KA_L, 15);
319 SK[8] = left_rot_hi(KA_H, KA_L, 30);
320 SK[9] = left_rot_lo(KA_H, KA_L, 30);
321 SK[10] = left_rot_hi(KL_H, KL_L, 45);
322 SK[11] = left_rot_lo(KL_H, KL_L, 45);
323 SK[12] = left_rot_hi(KA_H, KA_L, 45);
324 SK[13] = left_rot_lo(KL_H, KL_L, 60);
325 SK[14] = left_rot_hi(KA_H, KA_L, 60);
326 SK[15] = left_rot_lo(KA_H, KA_L, 60);
327 SK[16] = left_rot_lo(KL_H, KL_L, 77);
328 SK[17] = left_rot_hi(KL_H, KL_L, 77);
329 SK[18] = left_rot_lo(KL_H, KL_L, 94);
330 SK[19] = left_rot_hi(KL_H, KL_L, 94);
331 SK[20] = left_rot_lo(KA_H, KA_L, 94);
332 SK[21] = left_rot_hi(KA_H, KA_L, 94);
333 SK[22] = left_rot_lo(KL_H, KL_L, 111);
334 SK[23] = left_rot_hi(KL_H, KL_L, 111);
335 SK[24] = left_rot_lo(KA_H, KA_L, 111);
336 SK[25] = left_rot_hi(KA_H, KA_L, 111);
337 } else {
338 SK.resize(34);
339
340 SK[0] = KL_H;
341 SK[1] = KL_L;
342 SK[2] = KB_H;
343 SK[3] = KB_L;
344
345 SK[4] = left_rot_hi(KR_H, KR_L, 15);
346 SK[5] = left_rot_lo(KR_H, KR_L, 15);
347 SK[6] = left_rot_hi(KA_H, KA_L, 15);
348 SK[7] = left_rot_lo(KA_H, KA_L, 15);
349
350 SK[8] = left_rot_hi(KR_H, KR_L, 30);
351 SK[9] = left_rot_lo(KR_H, KR_L, 30);
352 SK[10] = left_rot_hi(KB_H, KB_L, 30);
353 SK[11] = left_rot_lo(KB_H, KB_L, 30);
354
355 SK[12] = left_rot_hi(KL_H, KL_L, 45);
356 SK[13] = left_rot_lo(KL_H, KL_L, 45);
357 SK[14] = left_rot_hi(KA_H, KA_L, 45);
358 SK[15] = left_rot_lo(KA_H, KA_L, 45);
359
360 SK[16] = left_rot_hi(KL_H, KL_L, 60);
361 SK[17] = left_rot_lo(KL_H, KL_L, 60);
362 SK[18] = left_rot_hi(KR_H, KR_L, 60);
363 SK[19] = left_rot_lo(KR_H, KR_L, 60);
364 SK[20] = left_rot_hi(KB_H, KB_L, 60);
365 SK[21] = left_rot_lo(KB_H, KB_L, 60);
366
367 SK[22] = left_rot_lo(KL_H, KL_L, 77);
368 SK[23] = left_rot_hi(KL_H, KL_L, 77);
369 SK[24] = left_rot_lo(KA_H, KA_L, 77);
370 SK[25] = left_rot_hi(KA_H, KA_L, 77);
371
372 SK[26] = left_rot_lo(KR_H, KR_L, 94);
373 SK[27] = left_rot_hi(KR_H, KR_L, 94);
374 SK[28] = left_rot_lo(KA_H, KA_L, 94);
375 SK[29] = left_rot_hi(KA_H, KA_L, 94);
376 SK[30] = left_rot_lo(KL_H, KL_L, 111);
377 SK[31] = left_rot_hi(KL_H, KL_L, 111);
378 SK[32] = left_rot_lo(KB_H, KB_L, 111);
379 SK[33] = left_rot_hi(KB_H, KB_L, 111);
380 }
381}
382
383std::string provider() {
384#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
386 return *feat;
387 }
388#endif
389
390#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
391 if(auto feat = CPUID::check(CPUID::Feature::GFNI)) {
392 return *feat;
393 }
394#endif
395
396#if defined(BOTAN_HAS_CAMELLIA_HWAES)
397 if(auto feat = CPUID::check(CPUID::Feature::HW_AES)) {
398 return *feat;
399 }
400#endif
401
402 return "base";
403}
404
405size_t parallelism() {
406#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
408 return 16;
409 }
410#endif
411
412#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
414 return 4;
415 }
416#endif
417
418#if defined(BOTAN_HAS_CAMELLIA_HWAES)
420 return 2;
421 }
422#endif
423
424 return 1;
425}
426
427} // namespace Camellia_F
428
429} // namespace
430
431void Camellia_128::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const {
433
434#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
436 return avx512_gfni_encrypt(in, out, blocks, m_SK);
437 }
438#endif
439
440#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
442 return avx2_gfni_encrypt(in, out, blocks, m_SK);
443 }
444#endif
445
446#if defined(BOTAN_HAS_CAMELLIA_HWAES)
448 return hwaes_encrypt(in, out, blocks, m_SK);
449 }
450#endif
451
452 Camellia_F::encrypt(in, out, blocks, m_SK, 9);
453}
454
455void Camellia_192::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const {
457
458#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
460 return avx512_gfni_encrypt(in, out, blocks, m_SK);
461 }
462#endif
463
464#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
466 return avx2_gfni_encrypt(in, out, blocks, m_SK);
467 }
468#endif
469
470#if defined(BOTAN_HAS_CAMELLIA_HWAES)
472 return hwaes_encrypt(in, out, blocks, m_SK);
473 }
474#endif
475
476 Camellia_F::encrypt(in, out, blocks, m_SK, 12);
477}
478
479void Camellia_256::encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const {
481
482#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
484 return avx512_gfni_encrypt(in, out, blocks, m_SK);
485 }
486#endif
487
488#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
490 return avx2_gfni_encrypt(in, out, blocks, m_SK);
491 }
492#endif
493
494#if defined(BOTAN_HAS_CAMELLIA_HWAES)
496 return hwaes_encrypt(in, out, blocks, m_SK);
497 }
498#endif
499
500 Camellia_F::encrypt(in, out, blocks, m_SK, 12);
501}
502
503void Camellia_128::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const {
505
506#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
508 return avx512_gfni_decrypt(in, out, blocks, m_SK);
509 }
510#endif
511
512#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
514 return avx2_gfni_decrypt(in, out, blocks, m_SK);
515 }
516#endif
517
518#if defined(BOTAN_HAS_CAMELLIA_HWAES)
520 return hwaes_decrypt(in, out, blocks, m_SK);
521 }
522#endif
523
524 Camellia_F::decrypt(in, out, blocks, m_SK, 9);
525}
526
527void Camellia_192::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const {
529
530#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
532 return avx512_gfni_decrypt(in, out, blocks, m_SK);
533 }
534#endif
535
536#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
538 return avx2_gfni_decrypt(in, out, blocks, m_SK);
539 }
540#endif
541
542#if defined(BOTAN_HAS_CAMELLIA_HWAES)
544 return hwaes_decrypt(in, out, blocks, m_SK);
545 }
546#endif
547
548 Camellia_F::decrypt(in, out, blocks, m_SK, 12);
549}
550
551void Camellia_256::decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const {
553
554#if defined(BOTAN_HAS_CAMELLIA_AVX512_GFNI)
556 return avx512_gfni_decrypt(in, out, blocks, m_SK);
557 }
558#endif
559
560#if defined(BOTAN_HAS_CAMELLIA_AVX2_GFNI)
562 return avx2_gfni_decrypt(in, out, blocks, m_SK);
563 }
564#endif
565
566#if defined(BOTAN_HAS_CAMELLIA_HWAES)
568 return hwaes_decrypt(in, out, blocks, m_SK);
569 }
570#endif
571
572 Camellia_F::decrypt(in, out, blocks, m_SK, 12);
573}
574
576 return !m_SK.empty();
577}
578
580 return !m_SK.empty();
581}
582
584 return !m_SK.empty();
585}
586
587void Camellia_128::key_schedule(std::span<const uint8_t> key) {
588 Camellia_F::key_schedule(m_SK, key);
589}
590
591void Camellia_192::key_schedule(std::span<const uint8_t> key) {
592 Camellia_F::key_schedule(m_SK, key);
593}
594
595void Camellia_256::key_schedule(std::span<const uint8_t> key) {
596 Camellia_F::key_schedule(m_SK, key);
597}
598
600 zap(m_SK);
601}
602
604 zap(m_SK);
605}
606
608 zap(m_SK);
609}
610
611std::string Camellia_128::provider() const {
612 return Camellia_F::provider();
613}
614
615std::string Camellia_192::provider() const {
616 return Camellia_F::provider();
617}
618
619std::string Camellia_256::provider() const {
620 return Camellia_F::provider();
621}
622
624 return Camellia_F::parallelism();
625}
626
628 return Camellia_F::parallelism();
629}
630
632 return Camellia_F::parallelism();
633}
634
635} // namespace Botan
static std::optional< std::string > check(CPUID::Feature feat)
Definition cpuid.h:67
static bool has(CPUID::Feature feat)
Definition cpuid.h:94
void decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const override
Definition camellia.cpp:503
void clear() override
Definition camellia.cpp:599
bool has_keying_material() const override
Definition camellia.cpp:575
size_t parallelism() const override
Definition camellia.cpp:623
void encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const override
Definition camellia.cpp:431
std::string provider() const override
Definition camellia.cpp:611
void encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const override
Definition camellia.cpp:455
bool has_keying_material() const override
Definition camellia.cpp:579
std::string provider() const override
Definition camellia.cpp:615
void decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const override
Definition camellia.cpp:527
size_t parallelism() const override
Definition camellia.cpp:627
void clear() override
Definition camellia.cpp:603
void decrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const override
Definition camellia.cpp:551
bool has_keying_material() const override
Definition camellia.cpp:583
std::string provider() const override
Definition camellia.cpp:619
size_t parallelism() const override
Definition camellia.cpp:631
void encrypt_n(const uint8_t in[], uint8_t out[], size_t blocks) const override
Definition camellia.cpp:479
void clear() override
Definition camellia.cpp:607
constexpr uint8_t get_byte(T input)
Definition loadstor.h:79
void zap(std::vector< T, Alloc > &vec)
Definition secmem.h:261
T prefetch_arrays(T(&... arr)[Ns]) noexcept
Definition prefetch.h:34
BOTAN_FORCE_INLINE constexpr T rotl(T input)
Definition rotate.h:23
std::vector< T, secure_allocator< T > > secure_vector
Definition secmem.h:128
constexpr auto store_be(ParamTs &&... params)
Definition loadstor.h:745
constexpr auto load_be(ParamTs &&... params)
Definition loadstor.h:504