camellia.c 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077
  1. /*
  2. * Camellia implementation
  3. *
  4. * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
  5. * SPDX-License-Identifier: Apache-2.0
  6. *
  7. * Licensed under the Apache License, Version 2.0 (the "License"); you may
  8. * not use this file except in compliance with the License.
  9. * You may obtain a copy of the License at
  10. *
  11. * http://www.apache.org/licenses/LICENSE-2.0
  12. *
  13. * Unless required by applicable law or agreed to in writing, software
  14. * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
  15. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  16. * See the License for the specific language governing permissions and
  17. * limitations under the License.
  18. *
  19. * This file is part of mbed TLS (https://tls.mbed.org)
  20. */
  21. /*
  22. * The Camellia block cipher was designed by NTT and Mitsubishi Electric
  23. * Corporation.
  24. *
  25. * http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/01espec.pdf
  26. */
  27. #if !defined(MBEDTLS_CONFIG_FILE)
  28. #include "mbedtls/config.h"
  29. #else
  30. #include MBEDTLS_CONFIG_FILE
  31. #endif
  32. #if defined(MBEDTLS_CAMELLIA_C)
  33. #include "mbedtls/camellia.h"
  34. #include <string.h>
  35. #if defined(MBEDTLS_SELF_TEST)
  36. #if defined(MBEDTLS_PLATFORM_C)
  37. #include "mbedtls/platform.h"
  38. #else
  39. #ifdef PRINTF_STDLIB
  40. #include <stdio.h>
  41. #endif
  42. #ifdef PRINTF_CUSTOM
  43. #include "tinystdio.h"
  44. #endif
  45. #define mbedtls_printf printf
  46. #endif /* MBEDTLS_PLATFORM_C */
  47. #endif /* MBEDTLS_SELF_TEST */
  48. #if !defined(MBEDTLS_CAMELLIA_ALT)
  49. /* Implementation that should never be optimized out by the compiler */
  50. static void mbedtls_zeroize( void *v, size_t n ) {
  51. volatile unsigned char *p = (unsigned char*)v; while( n-- ) *p++ = 0;
  52. }
  53. /*
  54. * 32-bit integer manipulation macros (big endian)
  55. */
  56. #ifndef GET_UINT32_BE
  57. #define GET_UINT32_BE(n,b,i) \
  58. { \
  59. (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
  60. | ( (uint32_t) (b)[(i) + 1] << 16 ) \
  61. | ( (uint32_t) (b)[(i) + 2] << 8 ) \
  62. | ( (uint32_t) (b)[(i) + 3] ); \
  63. }
  64. #endif
  65. #ifndef PUT_UINT32_BE
  66. #define PUT_UINT32_BE(n,b,i) \
  67. { \
  68. (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
  69. (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
  70. (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
  71. (b)[(i) + 3] = (unsigned char) ( (n) ); \
  72. }
  73. #endif
  74. static const unsigned char SIGMA_CHARS[6][8] =
  75. {
  76. { 0xa0, 0x9e, 0x66, 0x7f, 0x3b, 0xcc, 0x90, 0x8b },
  77. { 0xb6, 0x7a, 0xe8, 0x58, 0x4c, 0xaa, 0x73, 0xb2 },
  78. { 0xc6, 0xef, 0x37, 0x2f, 0xe9, 0x4f, 0x82, 0xbe },
  79. { 0x54, 0xff, 0x53, 0xa5, 0xf1, 0xd3, 0x6f, 0x1c },
  80. { 0x10, 0xe5, 0x27, 0xfa, 0xde, 0x68, 0x2d, 0x1d },
  81. { 0xb0, 0x56, 0x88, 0xc2, 0xb3, 0xe6, 0xc1, 0xfd }
  82. };
  83. #if defined(MBEDTLS_CAMELLIA_SMALL_MEMORY)
  84. static const unsigned char FSb[256] =
  85. {
  86. 112,130, 44,236,179, 39,192,229,228,133, 87, 53,234, 12,174, 65,
  87. 35,239,107,147, 69, 25,165, 33,237, 14, 79, 78, 29,101,146,189,
  88. 134,184,175,143,124,235, 31,206, 62, 48,220, 95, 94,197, 11, 26,
  89. 166,225, 57,202,213, 71, 93, 61,217, 1, 90,214, 81, 86,108, 77,
  90. 139, 13,154,102,251,204,176, 45,116, 18, 43, 32,240,177,132,153,
  91. 223, 76,203,194, 52,126,118, 5,109,183,169, 49,209, 23, 4,215,
  92. 20, 88, 58, 97,222, 27, 17, 28, 50, 15,156, 22, 83, 24,242, 34,
  93. 254, 68,207,178,195,181,122,145, 36, 8,232,168, 96,252,105, 80,
  94. 170,208,160,125,161,137, 98,151, 84, 91, 30,149,224,255,100,210,
  95. 16,196, 0, 72,163,247,117,219,138, 3,230,218, 9, 63,221,148,
  96. 135, 92,131, 2,205, 74,144, 51,115,103,246,243,157,127,191,226,
  97. 82,155,216, 38,200, 55,198, 59,129,150,111, 75, 19,190, 99, 46,
  98. 233,121,167,140,159,110,188,142, 41,245,249,182, 47,253,180, 89,
  99. 120,152, 6,106,231, 70,113,186,212, 37,171, 66,136,162,141,250,
  100. 114, 7,185, 85,248,238,172, 10, 54, 73, 42,104, 60, 56,241,164,
  101. 64, 40,211,123,187,201, 67,193, 21,227,173,244,119,199,128,158
  102. };
  103. #define SBOX1(n) FSb[(n)]
  104. #define SBOX2(n) (unsigned char)((FSb[(n)] >> 7 ^ FSb[(n)] << 1) & 0xff)
  105. #define SBOX3(n) (unsigned char)((FSb[(n)] >> 1 ^ FSb[(n)] << 7) & 0xff)
  106. #define SBOX4(n) FSb[((n) << 1 ^ (n) >> 7) &0xff]
  107. #else /* MBEDTLS_CAMELLIA_SMALL_MEMORY */
  108. static const unsigned char FSb[256] =
  109. {
  110. 112, 130, 44, 236, 179, 39, 192, 229, 228, 133, 87, 53, 234, 12, 174, 65,
  111. 35, 239, 107, 147, 69, 25, 165, 33, 237, 14, 79, 78, 29, 101, 146, 189,
  112. 134, 184, 175, 143, 124, 235, 31, 206, 62, 48, 220, 95, 94, 197, 11, 26,
  113. 166, 225, 57, 202, 213, 71, 93, 61, 217, 1, 90, 214, 81, 86, 108, 77,
  114. 139, 13, 154, 102, 251, 204, 176, 45, 116, 18, 43, 32, 240, 177, 132, 153,
  115. 223, 76, 203, 194, 52, 126, 118, 5, 109, 183, 169, 49, 209, 23, 4, 215,
  116. 20, 88, 58, 97, 222, 27, 17, 28, 50, 15, 156, 22, 83, 24, 242, 34,
  117. 254, 68, 207, 178, 195, 181, 122, 145, 36, 8, 232, 168, 96, 252, 105, 80,
  118. 170, 208, 160, 125, 161, 137, 98, 151, 84, 91, 30, 149, 224, 255, 100, 210,
  119. 16, 196, 0, 72, 163, 247, 117, 219, 138, 3, 230, 218, 9, 63, 221, 148,
  120. 135, 92, 131, 2, 205, 74, 144, 51, 115, 103, 246, 243, 157, 127, 191, 226,
  121. 82, 155, 216, 38, 200, 55, 198, 59, 129, 150, 111, 75, 19, 190, 99, 46,
  122. 233, 121, 167, 140, 159, 110, 188, 142, 41, 245, 249, 182, 47, 253, 180, 89,
  123. 120, 152, 6, 106, 231, 70, 113, 186, 212, 37, 171, 66, 136, 162, 141, 250,
  124. 114, 7, 185, 85, 248, 238, 172, 10, 54, 73, 42, 104, 60, 56, 241, 164,
  125. 64, 40, 211, 123, 187, 201, 67, 193, 21, 227, 173, 244, 119, 199, 128, 158
  126. };
  127. static const unsigned char FSb2[256] =
  128. {
  129. 224, 5, 88, 217, 103, 78, 129, 203, 201, 11, 174, 106, 213, 24, 93, 130,
  130. 70, 223, 214, 39, 138, 50, 75, 66, 219, 28, 158, 156, 58, 202, 37, 123,
  131. 13, 113, 95, 31, 248, 215, 62, 157, 124, 96, 185, 190, 188, 139, 22, 52,
  132. 77, 195, 114, 149, 171, 142, 186, 122, 179, 2, 180, 173, 162, 172, 216, 154,
  133. 23, 26, 53, 204, 247, 153, 97, 90, 232, 36, 86, 64, 225, 99, 9, 51,
  134. 191, 152, 151, 133, 104, 252, 236, 10, 218, 111, 83, 98, 163, 46, 8, 175,
  135. 40, 176, 116, 194, 189, 54, 34, 56, 100, 30, 57, 44, 166, 48, 229, 68,
  136. 253, 136, 159, 101, 135, 107, 244, 35, 72, 16, 209, 81, 192, 249, 210, 160,
  137. 85, 161, 65, 250, 67, 19, 196, 47, 168, 182, 60, 43, 193, 255, 200, 165,
  138. 32, 137, 0, 144, 71, 239, 234, 183, 21, 6, 205, 181, 18, 126, 187, 41,
  139. 15, 184, 7, 4, 155, 148, 33, 102, 230, 206, 237, 231, 59, 254, 127, 197,
  140. 164, 55, 177, 76, 145, 110, 141, 118, 3, 45, 222, 150, 38, 125, 198, 92,
  141. 211, 242, 79, 25, 63, 220, 121, 29, 82, 235, 243, 109, 94, 251, 105, 178,
  142. 240, 49, 12, 212, 207, 140, 226, 117, 169, 74, 87, 132, 17, 69, 27, 245,
  143. 228, 14, 115, 170, 241, 221, 89, 20, 108, 146, 84, 208, 120, 112, 227, 73,
  144. 128, 80, 167, 246, 119, 147, 134, 131, 42, 199, 91, 233, 238, 143, 1, 61
  145. };
  146. static const unsigned char FSb3[256] =
  147. {
  148. 56, 65, 22, 118, 217, 147, 96, 242, 114, 194, 171, 154, 117, 6, 87, 160,
  149. 145, 247, 181, 201, 162, 140, 210, 144, 246, 7, 167, 39, 142, 178, 73, 222,
  150. 67, 92, 215, 199, 62, 245, 143, 103, 31, 24, 110, 175, 47, 226, 133, 13,
  151. 83, 240, 156, 101, 234, 163, 174, 158, 236, 128, 45, 107, 168, 43, 54, 166,
  152. 197, 134, 77, 51, 253, 102, 88, 150, 58, 9, 149, 16, 120, 216, 66, 204,
  153. 239, 38, 229, 97, 26, 63, 59, 130, 182, 219, 212, 152, 232, 139, 2, 235,
  154. 10, 44, 29, 176, 111, 141, 136, 14, 25, 135, 78, 11, 169, 12, 121, 17,
  155. 127, 34, 231, 89, 225, 218, 61, 200, 18, 4, 116, 84, 48, 126, 180, 40,
  156. 85, 104, 80, 190, 208, 196, 49, 203, 42, 173, 15, 202, 112, 255, 50, 105,
  157. 8, 98, 0, 36, 209, 251, 186, 237, 69, 129, 115, 109, 132, 159, 238, 74,
  158. 195, 46, 193, 1, 230, 37, 72, 153, 185, 179, 123, 249, 206, 191, 223, 113,
  159. 41, 205, 108, 19, 100, 155, 99, 157, 192, 75, 183, 165, 137, 95, 177, 23,
  160. 244, 188, 211, 70, 207, 55, 94, 71, 148, 250, 252, 91, 151, 254, 90, 172,
  161. 60, 76, 3, 53, 243, 35, 184, 93, 106, 146, 213, 33, 68, 81, 198, 125,
  162. 57, 131, 220, 170, 124, 119, 86, 5, 27, 164, 21, 52, 30, 28, 248, 82,
  163. 32, 20, 233, 189, 221, 228, 161, 224, 138, 241, 214, 122, 187, 227, 64, 79
  164. };
  165. static const unsigned char FSb4[256] =
  166. {
  167. 112, 44, 179, 192, 228, 87, 234, 174, 35, 107, 69, 165, 237, 79, 29, 146,
  168. 134, 175, 124, 31, 62, 220, 94, 11, 166, 57, 213, 93, 217, 90, 81, 108,
  169. 139, 154, 251, 176, 116, 43, 240, 132, 223, 203, 52, 118, 109, 169, 209, 4,
  170. 20, 58, 222, 17, 50, 156, 83, 242, 254, 207, 195, 122, 36, 232, 96, 105,
  171. 170, 160, 161, 98, 84, 30, 224, 100, 16, 0, 163, 117, 138, 230, 9, 221,
  172. 135, 131, 205, 144, 115, 246, 157, 191, 82, 216, 200, 198, 129, 111, 19, 99,
  173. 233, 167, 159, 188, 41, 249, 47, 180, 120, 6, 231, 113, 212, 171, 136, 141,
  174. 114, 185, 248, 172, 54, 42, 60, 241, 64, 211, 187, 67, 21, 173, 119, 128,
  175. 130, 236, 39, 229, 133, 53, 12, 65, 239, 147, 25, 33, 14, 78, 101, 189,
  176. 184, 143, 235, 206, 48, 95, 197, 26, 225, 202, 71, 61, 1, 214, 86, 77,
  177. 13, 102, 204, 45, 18, 32, 177, 153, 76, 194, 126, 5, 183, 49, 23, 215,
  178. 88, 97, 27, 28, 15, 22, 24, 34, 68, 178, 181, 145, 8, 168, 252, 80,
  179. 208, 125, 137, 151, 91, 149, 255, 210, 196, 72, 247, 219, 3, 218, 63, 148,
  180. 92, 2, 74, 51, 103, 243, 127, 226, 155, 38, 55, 59, 150, 75, 190, 46,
  181. 121, 140, 110, 142, 245, 182, 253, 89, 152, 106, 70, 186, 37, 66, 162, 250,
  182. 7, 85, 238, 10, 73, 104, 56, 164, 40, 123, 201, 193, 227, 244, 199, 158
  183. };
  184. #define SBOX1(n) FSb[(n)]
  185. #define SBOX2(n) FSb2[(n)]
  186. #define SBOX3(n) FSb3[(n)]
  187. #define SBOX4(n) FSb4[(n)]
  188. #endif /* MBEDTLS_CAMELLIA_SMALL_MEMORY */
  189. static const unsigned char shifts[2][4][4] =
  190. {
  191. {
  192. { 1, 1, 1, 1 }, /* KL */
  193. { 0, 0, 0, 0 }, /* KR */
  194. { 1, 1, 1, 1 }, /* KA */
  195. { 0, 0, 0, 0 } /* KB */
  196. },
  197. {
  198. { 1, 0, 1, 1 }, /* KL */
  199. { 1, 1, 0, 1 }, /* KR */
  200. { 1, 1, 1, 0 }, /* KA */
  201. { 1, 1, 0, 1 } /* KB */
  202. }
  203. };
  204. static const signed char indexes[2][4][20] =
  205. {
  206. {
  207. { 0, 1, 2, 3, 8, 9, 10, 11, 38, 39,
  208. 36, 37, 23, 20, 21, 22, 27, -1, -1, 26 }, /* KL -> RK */
  209. { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  210. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 }, /* KR -> RK */
  211. { 4, 5, 6, 7, 12, 13, 14, 15, 16, 17,
  212. 18, 19, -1, 24, 25, -1, 31, 28, 29, 30 }, /* KA -> RK */
  213. { -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  214. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1 } /* KB -> RK */
  215. },
  216. {
  217. { 0, 1, 2, 3, 61, 62, 63, 60, -1, -1,
  218. -1, -1, 27, 24, 25, 26, 35, 32, 33, 34 }, /* KL -> RK */
  219. { -1, -1, -1, -1, 8, 9, 10, 11, 16, 17,
  220. 18, 19, -1, -1, -1, -1, 39, 36, 37, 38 }, /* KR -> RK */
  221. { -1, -1, -1, -1, 12, 13, 14, 15, 58, 59,
  222. 56, 57, 31, 28, 29, 30, -1, -1, -1, -1 }, /* KA -> RK */
  223. { 4, 5, 6, 7, 65, 66, 67, 64, 20, 21,
  224. 22, 23, -1, -1, -1, -1, 43, 40, 41, 42 } /* KB -> RK */
  225. }
  226. };
  227. static const signed char transposes[2][20] =
  228. {
  229. {
  230. 21, 22, 23, 20,
  231. -1, -1, -1, -1,
  232. 18, 19, 16, 17,
  233. 11, 8, 9, 10,
  234. 15, 12, 13, 14
  235. },
  236. {
  237. 25, 26, 27, 24,
  238. 29, 30, 31, 28,
  239. 18, 19, 16, 17,
  240. -1, -1, -1, -1,
  241. -1, -1, -1, -1
  242. }
  243. };
  244. /* Shift macro for 128 bit strings with rotation smaller than 32 bits (!) */
  245. #define ROTL(DEST, SRC, SHIFT) \
  246. { \
  247. (DEST)[0] = (SRC)[0] << (SHIFT) ^ (SRC)[1] >> (32 - (SHIFT)); \
  248. (DEST)[1] = (SRC)[1] << (SHIFT) ^ (SRC)[2] >> (32 - (SHIFT)); \
  249. (DEST)[2] = (SRC)[2] << (SHIFT) ^ (SRC)[3] >> (32 - (SHIFT)); \
  250. (DEST)[3] = (SRC)[3] << (SHIFT) ^ (SRC)[0] >> (32 - (SHIFT)); \
  251. }
  252. #define FL(XL, XR, KL, KR) \
  253. { \
  254. (XR) = ((((XL) & (KL)) << 1) | (((XL) & (KL)) >> 31)) ^ (XR); \
  255. (XL) = ((XR) | (KR)) ^ (XL); \
  256. }
  257. #define FLInv(YL, YR, KL, KR) \
  258. { \
  259. (YL) = ((YR) | (KR)) ^ (YL); \
  260. (YR) = ((((YL) & (KL)) << 1) | (((YL) & (KL)) >> 31)) ^ (YR); \
  261. }
  262. #define SHIFT_AND_PLACE(INDEX, OFFSET) \
  263. { \
  264. TK[0] = KC[(OFFSET) * 4 + 0]; \
  265. TK[1] = KC[(OFFSET) * 4 + 1]; \
  266. TK[2] = KC[(OFFSET) * 4 + 2]; \
  267. TK[3] = KC[(OFFSET) * 4 + 3]; \
  268. \
  269. for( i = 1; i <= 4; i++ ) \
  270. if( shifts[(INDEX)][(OFFSET)][i -1] ) \
  271. ROTL(TK + i * 4, TK, ( 15 * i ) % 32); \
  272. \
  273. for( i = 0; i < 20; i++ ) \
  274. if( indexes[(INDEX)][(OFFSET)][i] != -1 ) { \
  275. RK[indexes[(INDEX)][(OFFSET)][i]] = TK[ i ]; \
  276. } \
  277. }
  278. static void camellia_feistel( const uint32_t x[2], const uint32_t k[2],
  279. uint32_t z[2])
  280. {
  281. uint32_t I0, I1;
  282. I0 = x[0] ^ k[0];
  283. I1 = x[1] ^ k[1];
  284. I0 = ((uint32_t) SBOX1((I0 >> 24) & 0xFF) << 24) |
  285. ((uint32_t) SBOX2((I0 >> 16) & 0xFF) << 16) |
  286. ((uint32_t) SBOX3((I0 >> 8) & 0xFF) << 8) |
  287. ((uint32_t) SBOX4((I0 ) & 0xFF) );
  288. I1 = ((uint32_t) SBOX2((I1 >> 24) & 0xFF) << 24) |
  289. ((uint32_t) SBOX3((I1 >> 16) & 0xFF) << 16) |
  290. ((uint32_t) SBOX4((I1 >> 8) & 0xFF) << 8) |
  291. ((uint32_t) SBOX1((I1 ) & 0xFF) );
  292. I0 ^= (I1 << 8) | (I1 >> 24);
  293. I1 ^= (I0 << 16) | (I0 >> 16);
  294. I0 ^= (I1 >> 8) | (I1 << 24);
  295. I1 ^= (I0 >> 8) | (I0 << 24);
  296. z[0] ^= I1;
  297. z[1] ^= I0;
  298. }
  299. void mbedtls_camellia_init( mbedtls_camellia_context *ctx )
  300. {
  301. memset( ctx, 0, sizeof( mbedtls_camellia_context ) );
  302. }
  303. void mbedtls_camellia_free( mbedtls_camellia_context *ctx )
  304. {
  305. if( ctx == NULL )
  306. return;
  307. mbedtls_zeroize( ctx, sizeof( mbedtls_camellia_context ) );
  308. }
  309. /*
  310. * Camellia key schedule (encryption)
  311. */
  312. int mbedtls_camellia_setkey_enc( mbedtls_camellia_context *ctx, const unsigned char *key,
  313. unsigned int keybits )
  314. {
  315. int idx;
  316. size_t i;
  317. uint32_t *RK;
  318. unsigned char t[64];
  319. uint32_t SIGMA[6][2];
  320. uint32_t KC[16];
  321. uint32_t TK[20];
  322. RK = ctx->rk;
  323. memset( t, 0, 64 );
  324. memset( RK, 0, sizeof(ctx->rk) );
  325. switch( keybits )
  326. {
  327. case 128: ctx->nr = 3; idx = 0; break;
  328. case 192:
  329. case 256: ctx->nr = 4; idx = 1; break;
  330. default : return( MBEDTLS_ERR_CAMELLIA_INVALID_KEY_LENGTH );
  331. }
  332. for( i = 0; i < keybits / 8; ++i )
  333. t[i] = key[i];
  334. if( keybits == 192 ) {
  335. for( i = 0; i < 8; i++ )
  336. t[24 + i] = ~t[16 + i];
  337. }
  338. /*
  339. * Prepare SIGMA values
  340. */
  341. for( i = 0; i < 6; i++ ) {
  342. GET_UINT32_BE( SIGMA[i][0], SIGMA_CHARS[i], 0 );
  343. GET_UINT32_BE( SIGMA[i][1], SIGMA_CHARS[i], 4 );
  344. }
  345. /*
  346. * Key storage in KC
  347. * Order: KL, KR, KA, KB
  348. */
  349. memset( KC, 0, sizeof(KC) );
  350. /* Store KL, KR */
  351. for( i = 0; i < 8; i++ )
  352. GET_UINT32_BE( KC[i], t, i * 4 );
  353. /* Generate KA */
  354. for( i = 0; i < 4; ++i )
  355. KC[8 + i] = KC[i] ^ KC[4 + i];
  356. camellia_feistel( KC + 8, SIGMA[0], KC + 10 );
  357. camellia_feistel( KC + 10, SIGMA[1], KC + 8 );
  358. for( i = 0; i < 4; ++i )
  359. KC[8 + i] ^= KC[i];
  360. camellia_feistel( KC + 8, SIGMA[2], KC + 10 );
  361. camellia_feistel( KC + 10, SIGMA[3], KC + 8 );
  362. if( keybits > 128 ) {
  363. /* Generate KB */
  364. for( i = 0; i < 4; ++i )
  365. KC[12 + i] = KC[4 + i] ^ KC[8 + i];
  366. camellia_feistel( KC + 12, SIGMA[4], KC + 14 );
  367. camellia_feistel( KC + 14, SIGMA[5], KC + 12 );
  368. }
  369. /*
  370. * Generating subkeys
  371. */
  372. /* Manipulating KL */
  373. SHIFT_AND_PLACE( idx, 0 );
  374. /* Manipulating KR */
  375. if( keybits > 128 ) {
  376. SHIFT_AND_PLACE( idx, 1 );
  377. }
  378. /* Manipulating KA */
  379. SHIFT_AND_PLACE( idx, 2 );
  380. /* Manipulating KB */
  381. if( keybits > 128 ) {
  382. SHIFT_AND_PLACE( idx, 3 );
  383. }
  384. /* Do transpositions */
  385. for( i = 0; i < 20; i++ ) {
  386. if( transposes[idx][i] != -1 ) {
  387. RK[32 + 12 * idx + i] = RK[transposes[idx][i]];
  388. }
  389. }
  390. return( 0 );
  391. }
  392. /*
  393. * Camellia key schedule (decryption)
  394. */
  395. int mbedtls_camellia_setkey_dec( mbedtls_camellia_context *ctx, const unsigned char *key,
  396. unsigned int keybits )
  397. {
  398. int idx, ret;
  399. size_t i;
  400. mbedtls_camellia_context cty;
  401. uint32_t *RK;
  402. uint32_t *SK;
  403. mbedtls_camellia_init( &cty );
  404. /* Also checks keybits */
  405. if( ( ret = mbedtls_camellia_setkey_enc( &cty, key, keybits ) ) != 0 )
  406. goto exit;
  407. ctx->nr = cty.nr;
  408. idx = ( ctx->nr == 4 );
  409. RK = ctx->rk;
  410. SK = cty.rk + 24 * 2 + 8 * idx * 2;
  411. *RK++ = *SK++;
  412. *RK++ = *SK++;
  413. *RK++ = *SK++;
  414. *RK++ = *SK++;
  415. for( i = 22 + 8 * idx, SK -= 6; i > 0; i--, SK -= 4 )
  416. {
  417. *RK++ = *SK++;
  418. *RK++ = *SK++;
  419. }
  420. SK -= 2;
  421. *RK++ = *SK++;
  422. *RK++ = *SK++;
  423. *RK++ = *SK++;
  424. *RK++ = *SK++;
  425. exit:
  426. mbedtls_camellia_free( &cty );
  427. return( ret );
  428. }
  429. /*
  430. * Camellia-ECB block encryption/decryption
  431. */
  432. int mbedtls_camellia_crypt_ecb( mbedtls_camellia_context *ctx,
  433. int mode,
  434. const unsigned char input[16],
  435. unsigned char output[16] )
  436. {
  437. int NR;
  438. uint32_t *RK, X[4];
  439. ( (void) mode );
  440. NR = ctx->nr;
  441. RK = ctx->rk;
  442. GET_UINT32_BE( X[0], input, 0 );
  443. GET_UINT32_BE( X[1], input, 4 );
  444. GET_UINT32_BE( X[2], input, 8 );
  445. GET_UINT32_BE( X[3], input, 12 );
  446. X[0] ^= *RK++;
  447. X[1] ^= *RK++;
  448. X[2] ^= *RK++;
  449. X[3] ^= *RK++;
  450. while( NR ) {
  451. --NR;
  452. camellia_feistel( X, RK, X + 2 );
  453. RK += 2;
  454. camellia_feistel( X + 2, RK, X );
  455. RK += 2;
  456. camellia_feistel( X, RK, X + 2 );
  457. RK += 2;
  458. camellia_feistel( X + 2, RK, X );
  459. RK += 2;
  460. camellia_feistel( X, RK, X + 2 );
  461. RK += 2;
  462. camellia_feistel( X + 2, RK, X );
  463. RK += 2;
  464. if( NR ) {
  465. FL(X[0], X[1], RK[0], RK[1]);
  466. RK += 2;
  467. FLInv(X[2], X[3], RK[0], RK[1]);
  468. RK += 2;
  469. }
  470. }
  471. X[2] ^= *RK++;
  472. X[3] ^= *RK++;
  473. X[0] ^= *RK++;
  474. X[1] ^= *RK++;
  475. PUT_UINT32_BE( X[2], output, 0 );
  476. PUT_UINT32_BE( X[3], output, 4 );
  477. PUT_UINT32_BE( X[0], output, 8 );
  478. PUT_UINT32_BE( X[1], output, 12 );
  479. return( 0 );
  480. }
  481. #if defined(MBEDTLS_CIPHER_MODE_CBC)
  482. /*
  483. * Camellia-CBC buffer encryption/decryption
  484. */
  485. int mbedtls_camellia_crypt_cbc( mbedtls_camellia_context *ctx,
  486. int mode,
  487. size_t length,
  488. unsigned char iv[16],
  489. const unsigned char *input,
  490. unsigned char *output )
  491. {
  492. int i;
  493. unsigned char temp[16];
  494. if( length % 16 )
  495. return( MBEDTLS_ERR_CAMELLIA_INVALID_INPUT_LENGTH );
  496. if( mode == MBEDTLS_CAMELLIA_DECRYPT )
  497. {
  498. while( length > 0 )
  499. {
  500. memcpy( temp, input, 16 );
  501. mbedtls_camellia_crypt_ecb( ctx, mode, input, output );
  502. for( i = 0; i < 16; i++ )
  503. output[i] = (unsigned char)( output[i] ^ iv[i] );
  504. memcpy( iv, temp, 16 );
  505. input += 16;
  506. output += 16;
  507. length -= 16;
  508. }
  509. }
  510. else
  511. {
  512. while( length > 0 )
  513. {
  514. for( i = 0; i < 16; i++ )
  515. output[i] = (unsigned char)( input[i] ^ iv[i] );
  516. mbedtls_camellia_crypt_ecb( ctx, mode, output, output );
  517. memcpy( iv, output, 16 );
  518. input += 16;
  519. output += 16;
  520. length -= 16;
  521. }
  522. }
  523. return( 0 );
  524. }
  525. #endif /* MBEDTLS_CIPHER_MODE_CBC */
  526. #if defined(MBEDTLS_CIPHER_MODE_CFB)
  527. /*
  528. * Camellia-CFB128 buffer encryption/decryption
  529. */
  530. int mbedtls_camellia_crypt_cfb128( mbedtls_camellia_context *ctx,
  531. int mode,
  532. size_t length,
  533. size_t *iv_off,
  534. unsigned char iv[16],
  535. const unsigned char *input,
  536. unsigned char *output )
  537. {
  538. int c;
  539. size_t n = *iv_off;
  540. if( mode == MBEDTLS_CAMELLIA_DECRYPT )
  541. {
  542. while( length-- )
  543. {
  544. if( n == 0 )
  545. mbedtls_camellia_crypt_ecb( ctx, MBEDTLS_CAMELLIA_ENCRYPT, iv, iv );
  546. c = *input++;
  547. *output++ = (unsigned char)( c ^ iv[n] );
  548. iv[n] = (unsigned char) c;
  549. n = ( n + 1 ) & 0x0F;
  550. }
  551. }
  552. else
  553. {
  554. while( length-- )
  555. {
  556. if( n == 0 )
  557. mbedtls_camellia_crypt_ecb( ctx, MBEDTLS_CAMELLIA_ENCRYPT, iv, iv );
  558. iv[n] = *output++ = (unsigned char)( iv[n] ^ *input++ );
  559. n = ( n + 1 ) & 0x0F;
  560. }
  561. }
  562. *iv_off = n;
  563. return( 0 );
  564. }
  565. #endif /* MBEDTLS_CIPHER_MODE_CFB */
  566. #if defined(MBEDTLS_CIPHER_MODE_CTR)
  567. /*
  568. * Camellia-CTR buffer encryption/decryption
  569. */
  570. int mbedtls_camellia_crypt_ctr( mbedtls_camellia_context *ctx,
  571. size_t length,
  572. size_t *nc_off,
  573. unsigned char nonce_counter[16],
  574. unsigned char stream_block[16],
  575. const unsigned char *input,
  576. unsigned char *output )
  577. {
  578. int c, i;
  579. size_t n = *nc_off;
  580. while( length-- )
  581. {
  582. if( n == 0 ) {
  583. mbedtls_camellia_crypt_ecb( ctx, MBEDTLS_CAMELLIA_ENCRYPT, nonce_counter,
  584. stream_block );
  585. for( i = 16; i > 0; i-- )
  586. if( ++nonce_counter[i - 1] != 0 )
  587. break;
  588. }
  589. c = *input++;
  590. *output++ = (unsigned char)( c ^ stream_block[n] );
  591. n = ( n + 1 ) & 0x0F;
  592. }
  593. *nc_off = n;
  594. return( 0 );
  595. }
  596. #endif /* MBEDTLS_CIPHER_MODE_CTR */
  597. #endif /* !MBEDTLS_CAMELLIA_ALT */
  598. #if defined(MBEDTLS_SELF_TEST)
  599. /*
  600. * Camellia test vectors from:
  601. *
  602. * http://info.isl.ntt.co.jp/crypt/eng/camellia/technology.html:
  603. * http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/cryptrec/intermediate.txt
  604. * http://info.isl.ntt.co.jp/crypt/eng/camellia/dl/cryptrec/t_camellia.txt
  605. * (For each bitlength: Key 0, Nr 39)
  606. */
  607. #define CAMELLIA_TESTS_ECB 2
  608. static const unsigned char camellia_test_ecb_key[3][CAMELLIA_TESTS_ECB][32] =
  609. {
  610. {
  611. { 0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef,
  612. 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32, 0x10 },
  613. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  614. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }
  615. },
  616. {
  617. { 0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef,
  618. 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32, 0x10,
  619. 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77 },
  620. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  621. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  622. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }
  623. },
  624. {
  625. { 0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef,
  626. 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32, 0x10,
  627. 0x00, 0x11, 0x22, 0x33, 0x44, 0x55, 0x66, 0x77,
  628. 0x88, 0x99, 0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff },
  629. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  630. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  631. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  632. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }
  633. },
  634. };
  635. static const unsigned char camellia_test_ecb_plain[CAMELLIA_TESTS_ECB][16] =
  636. {
  637. { 0x01, 0x23, 0x45, 0x67, 0x89, 0xab, 0xcd, 0xef,
  638. 0xfe, 0xdc, 0xba, 0x98, 0x76, 0x54, 0x32, 0x10 },
  639. { 0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00,
  640. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }
  641. };
  642. static const unsigned char camellia_test_ecb_cipher[3][CAMELLIA_TESTS_ECB][16] =
  643. {
  644. {
  645. { 0x67, 0x67, 0x31, 0x38, 0x54, 0x96, 0x69, 0x73,
  646. 0x08, 0x57, 0x06, 0x56, 0x48, 0xea, 0xbe, 0x43 },
  647. { 0x38, 0x3C, 0x6C, 0x2A, 0xAB, 0xEF, 0x7F, 0xDE,
  648. 0x25, 0xCD, 0x47, 0x0B, 0xF7, 0x74, 0xA3, 0x31 }
  649. },
  650. {
  651. { 0xb4, 0x99, 0x34, 0x01, 0xb3, 0xe9, 0x96, 0xf8,
  652. 0x4e, 0xe5, 0xce, 0xe7, 0xd7, 0x9b, 0x09, 0xb9 },
  653. { 0xD1, 0x76, 0x3F, 0xC0, 0x19, 0xD7, 0x7C, 0xC9,
  654. 0x30, 0xBF, 0xF2, 0xA5, 0x6F, 0x7C, 0x93, 0x64 }
  655. },
  656. {
  657. { 0x9a, 0xcc, 0x23, 0x7d, 0xff, 0x16, 0xd7, 0x6c,
  658. 0x20, 0xef, 0x7c, 0x91, 0x9e, 0x3a, 0x75, 0x09 },
  659. { 0x05, 0x03, 0xFB, 0x10, 0xAB, 0x24, 0x1E, 0x7C,
  660. 0xF4, 0x5D, 0x8C, 0xDE, 0xEE, 0x47, 0x43, 0x35 }
  661. }
  662. };
  663. #if defined(MBEDTLS_CIPHER_MODE_CBC)
  664. #define CAMELLIA_TESTS_CBC 3
  665. static const unsigned char camellia_test_cbc_key[3][32] =
  666. {
  667. { 0x2B, 0x7E, 0x15, 0x16, 0x28, 0xAE, 0xD2, 0xA6,
  668. 0xAB, 0xF7, 0x15, 0x88, 0x09, 0xCF, 0x4F, 0x3C }
  669. ,
  670. { 0x8E, 0x73, 0xB0, 0xF7, 0xDA, 0x0E, 0x64, 0x52,
  671. 0xC8, 0x10, 0xF3, 0x2B, 0x80, 0x90, 0x79, 0xE5,
  672. 0x62, 0xF8, 0xEA, 0xD2, 0x52, 0x2C, 0x6B, 0x7B }
  673. ,
  674. { 0x60, 0x3D, 0xEB, 0x10, 0x15, 0xCA, 0x71, 0xBE,
  675. 0x2B, 0x73, 0xAE, 0xF0, 0x85, 0x7D, 0x77, 0x81,
  676. 0x1F, 0x35, 0x2C, 0x07, 0x3B, 0x61, 0x08, 0xD7,
  677. 0x2D, 0x98, 0x10, 0xA3, 0x09, 0x14, 0xDF, 0xF4 }
  678. };
  679. static const unsigned char camellia_test_cbc_iv[16] =
  680. { 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
  681. 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F }
  682. ;
  683. static const unsigned char camellia_test_cbc_plain[CAMELLIA_TESTS_CBC][16] =
  684. {
  685. { 0x6B, 0xC1, 0xBE, 0xE2, 0x2E, 0x40, 0x9F, 0x96,
  686. 0xE9, 0x3D, 0x7E, 0x11, 0x73, 0x93, 0x17, 0x2A },
  687. { 0xAE, 0x2D, 0x8A, 0x57, 0x1E, 0x03, 0xAC, 0x9C,
  688. 0x9E, 0xB7, 0x6F, 0xAC, 0x45, 0xAF, 0x8E, 0x51 },
  689. { 0x30, 0xC8, 0x1C, 0x46, 0xA3, 0x5C, 0xE4, 0x11,
  690. 0xE5, 0xFB, 0xC1, 0x19, 0x1A, 0x0A, 0x52, 0xEF }
  691. };
  692. static const unsigned char camellia_test_cbc_cipher[3][CAMELLIA_TESTS_CBC][16] =
  693. {
  694. {
  695. { 0x16, 0x07, 0xCF, 0x49, 0x4B, 0x36, 0xBB, 0xF0,
  696. 0x0D, 0xAE, 0xB0, 0xB5, 0x03, 0xC8, 0x31, 0xAB },
  697. { 0xA2, 0xF2, 0xCF, 0x67, 0x16, 0x29, 0xEF, 0x78,
  698. 0x40, 0xC5, 0xA5, 0xDF, 0xB5, 0x07, 0x48, 0x87 },
  699. { 0x0F, 0x06, 0x16, 0x50, 0x08, 0xCF, 0x8B, 0x8B,
  700. 0x5A, 0x63, 0x58, 0x63, 0x62, 0x54, 0x3E, 0x54 }
  701. },
  702. {
  703. { 0x2A, 0x48, 0x30, 0xAB, 0x5A, 0xC4, 0xA1, 0xA2,
  704. 0x40, 0x59, 0x55, 0xFD, 0x21, 0x95, 0xCF, 0x93 },
  705. { 0x5D, 0x5A, 0x86, 0x9B, 0xD1, 0x4C, 0xE5, 0x42,
  706. 0x64, 0xF8, 0x92, 0xA6, 0xDD, 0x2E, 0xC3, 0xD5 },
  707. { 0x37, 0xD3, 0x59, 0xC3, 0x34, 0x98, 0x36, 0xD8,
  708. 0x84, 0xE3, 0x10, 0xAD, 0xDF, 0x68, 0xC4, 0x49 }
  709. },
  710. {
  711. { 0xE6, 0xCF, 0xA3, 0x5F, 0xC0, 0x2B, 0x13, 0x4A,
  712. 0x4D, 0x2C, 0x0B, 0x67, 0x37, 0xAC, 0x3E, 0xDA },
  713. { 0x36, 0xCB, 0xEB, 0x73, 0xBD, 0x50, 0x4B, 0x40,
  714. 0x70, 0xB1, 0xB7, 0xDE, 0x2B, 0x21, 0xEB, 0x50 },
  715. { 0xE3, 0x1A, 0x60, 0x55, 0x29, 0x7D, 0x96, 0xCA,
  716. 0x33, 0x30, 0xCD, 0xF1, 0xB1, 0x86, 0x0A, 0x83 }
  717. }
  718. };
  719. #endif /* MBEDTLS_CIPHER_MODE_CBC */
  720. #if defined(MBEDTLS_CIPHER_MODE_CTR)
  721. /*
  722. * Camellia-CTR test vectors from:
  723. *
  724. * http://www.faqs.org/rfcs/rfc5528.html
  725. */
  726. static const unsigned char camellia_test_ctr_key[3][16] =
  727. {
  728. { 0xAE, 0x68, 0x52, 0xF8, 0x12, 0x10, 0x67, 0xCC,
  729. 0x4B, 0xF7, 0xA5, 0x76, 0x55, 0x77, 0xF3, 0x9E },
  730. { 0x7E, 0x24, 0x06, 0x78, 0x17, 0xFA, 0xE0, 0xD7,
  731. 0x43, 0xD6, 0xCE, 0x1F, 0x32, 0x53, 0x91, 0x63 },
  732. { 0x76, 0x91, 0xBE, 0x03, 0x5E, 0x50, 0x20, 0xA8,
  733. 0xAC, 0x6E, 0x61, 0x85, 0x29, 0xF9, 0xA0, 0xDC }
  734. };
  735. static const unsigned char camellia_test_ctr_nonce_counter[3][16] =
  736. {
  737. { 0x00, 0x00, 0x00, 0x30, 0x00, 0x00, 0x00, 0x00,
  738. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01 },
  739. { 0x00, 0x6C, 0xB6, 0xDB, 0xC0, 0x54, 0x3B, 0x59,
  740. 0xDA, 0x48, 0xD9, 0x0B, 0x00, 0x00, 0x00, 0x01 },
  741. { 0x00, 0xE0, 0x01, 0x7B, 0x27, 0x77, 0x7F, 0x3F,
  742. 0x4A, 0x17, 0x86, 0xF0, 0x00, 0x00, 0x00, 0x01 }
  743. };
  744. static const unsigned char camellia_test_ctr_pt[3][48] =
  745. {
  746. { 0x53, 0x69, 0x6E, 0x67, 0x6C, 0x65, 0x20, 0x62,
  747. 0x6C, 0x6F, 0x63, 0x6B, 0x20, 0x6D, 0x73, 0x67 },
  748. { 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
  749. 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
  750. 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
  751. 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F },
  752. { 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
  753. 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F,
  754. 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
  755. 0x18, 0x19, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F,
  756. 0x20, 0x21, 0x22, 0x23 }
  757. };
  758. static const unsigned char camellia_test_ctr_ct[3][48] =
  759. {
  760. { 0xD0, 0x9D, 0xC2, 0x9A, 0x82, 0x14, 0x61, 0x9A,
  761. 0x20, 0x87, 0x7C, 0x76, 0xDB, 0x1F, 0x0B, 0x3F },
  762. { 0xDB, 0xF3, 0xC7, 0x8D, 0xC0, 0x83, 0x96, 0xD4,
  763. 0xDA, 0x7C, 0x90, 0x77, 0x65, 0xBB, 0xCB, 0x44,
  764. 0x2B, 0x8E, 0x8E, 0x0F, 0x31, 0xF0, 0xDC, 0xA7,
  765. 0x2C, 0x74, 0x17, 0xE3, 0x53, 0x60, 0xE0, 0x48 },
  766. { 0xB1, 0x9D, 0x1F, 0xCD, 0xCB, 0x75, 0xEB, 0x88,
  767. 0x2F, 0x84, 0x9C, 0xE2, 0x4D, 0x85, 0xCF, 0x73,
  768. 0x9C, 0xE6, 0x4B, 0x2B, 0x5C, 0x9D, 0x73, 0xF1,
  769. 0x4F, 0x2D, 0x5D, 0x9D, 0xCE, 0x98, 0x89, 0xCD,
  770. 0xDF, 0x50, 0x86, 0x96 }
  771. };
  772. static const int camellia_test_ctr_len[3] =
  773. { 16, 32, 36 };
  774. #endif /* MBEDTLS_CIPHER_MODE_CTR */
  775. /*
  776. * Checkup routine
  777. */
  778. int mbedtls_camellia_self_test( int verbose )
  779. {
  780. int i, j, u, v;
  781. unsigned char key[32];
  782. unsigned char buf[64];
  783. unsigned char src[16];
  784. unsigned char dst[16];
  785. #if defined(MBEDTLS_CIPHER_MODE_CBC)
  786. unsigned char iv[16];
  787. #endif
  788. #if defined(MBEDTLS_CIPHER_MODE_CTR)
  789. size_t offset, len;
  790. unsigned char nonce_counter[16];
  791. unsigned char stream_block[16];
  792. #endif
  793. mbedtls_camellia_context ctx;
  794. memset( key, 0, 32 );
  795. for( j = 0; j < 6; j++ ) {
  796. u = j >> 1;
  797. v = j & 1;
  798. if( verbose != 0 )
  799. mbedtls_printf( " CAMELLIA-ECB-%3d (%s): ", 128 + u * 64,
  800. (v == MBEDTLS_CAMELLIA_DECRYPT) ? "dec" : "enc");
  801. for( i = 0; i < CAMELLIA_TESTS_ECB; i++ ) {
  802. memcpy( key, camellia_test_ecb_key[u][i], 16 + 8 * u );
  803. if( v == MBEDTLS_CAMELLIA_DECRYPT ) {
  804. mbedtls_camellia_setkey_dec( &ctx, key, 128 + u * 64 );
  805. memcpy( src, camellia_test_ecb_cipher[u][i], 16 );
  806. memcpy( dst, camellia_test_ecb_plain[i], 16 );
  807. } else { /* MBEDTLS_CAMELLIA_ENCRYPT */
  808. mbedtls_camellia_setkey_enc( &ctx, key, 128 + u * 64 );
  809. memcpy( src, camellia_test_ecb_plain[i], 16 );
  810. memcpy( dst, camellia_test_ecb_cipher[u][i], 16 );
  811. }
  812. mbedtls_camellia_crypt_ecb( &ctx, v, src, buf );
  813. if( memcmp( buf, dst, 16 ) != 0 )
  814. {
  815. if( verbose != 0 )
  816. mbedtls_printf( "failed\n" );
  817. return( 1 );
  818. }
  819. }
  820. if( verbose != 0 )
  821. mbedtls_printf( "passed\n" );
  822. }
  823. if( verbose != 0 )
  824. mbedtls_printf( "\n" );
  825. #if defined(MBEDTLS_CIPHER_MODE_CBC)
  826. /*
  827. * CBC mode
  828. */
  829. for( j = 0; j < 6; j++ )
  830. {
  831. u = j >> 1;
  832. v = j & 1;
  833. if( verbose != 0 )
  834. mbedtls_printf( " CAMELLIA-CBC-%3d (%s): ", 128 + u * 64,
  835. ( v == MBEDTLS_CAMELLIA_DECRYPT ) ? "dec" : "enc" );
  836. memcpy( src, camellia_test_cbc_iv, 16 );
  837. memcpy( dst, camellia_test_cbc_iv, 16 );
  838. memcpy( key, camellia_test_cbc_key[u], 16 + 8 * u );
  839. if( v == MBEDTLS_CAMELLIA_DECRYPT ) {
  840. mbedtls_camellia_setkey_dec( &ctx, key, 128 + u * 64 );
  841. } else {
  842. mbedtls_camellia_setkey_enc( &ctx, key, 128 + u * 64 );
  843. }
  844. for( i = 0; i < CAMELLIA_TESTS_CBC; i++ ) {
  845. if( v == MBEDTLS_CAMELLIA_DECRYPT ) {
  846. memcpy( iv , src, 16 );
  847. memcpy( src, camellia_test_cbc_cipher[u][i], 16 );
  848. memcpy( dst, camellia_test_cbc_plain[i], 16 );
  849. } else { /* MBEDTLS_CAMELLIA_ENCRYPT */
  850. memcpy( iv , dst, 16 );
  851. memcpy( src, camellia_test_cbc_plain[i], 16 );
  852. memcpy( dst, camellia_test_cbc_cipher[u][i], 16 );
  853. }
  854. mbedtls_camellia_crypt_cbc( &ctx, v, 16, iv, src, buf );
  855. if( memcmp( buf, dst, 16 ) != 0 )
  856. {
  857. if( verbose != 0 )
  858. mbedtls_printf( "failed\n" );
  859. return( 1 );
  860. }
  861. }
  862. if( verbose != 0 )
  863. mbedtls_printf( "passed\n" );
  864. }
  865. #endif /* MBEDTLS_CIPHER_MODE_CBC */
  866. if( verbose != 0 )
  867. mbedtls_printf( "\n" );
  868. #if defined(MBEDTLS_CIPHER_MODE_CTR)
  869. /*
  870. * CTR mode
  871. */
  872. for( i = 0; i < 6; i++ )
  873. {
  874. u = i >> 1;
  875. v = i & 1;
  876. if( verbose != 0 )
  877. mbedtls_printf( " CAMELLIA-CTR-128 (%s): ",
  878. ( v == MBEDTLS_CAMELLIA_DECRYPT ) ? "dec" : "enc" );
  879. memcpy( nonce_counter, camellia_test_ctr_nonce_counter[u], 16 );
  880. memcpy( key, camellia_test_ctr_key[u], 16 );
  881. offset = 0;
  882. mbedtls_camellia_setkey_enc( &ctx, key, 128 );
  883. if( v == MBEDTLS_CAMELLIA_DECRYPT )
  884. {
  885. len = camellia_test_ctr_len[u];
  886. memcpy( buf, camellia_test_ctr_ct[u], len );
  887. mbedtls_camellia_crypt_ctr( &ctx, len, &offset, nonce_counter, stream_block,
  888. buf, buf );
  889. if( memcmp( buf, camellia_test_ctr_pt[u], len ) != 0 )
  890. {
  891. if( verbose != 0 )
  892. mbedtls_printf( "failed\n" );
  893. return( 1 );
  894. }
  895. }
  896. else
  897. {
  898. len = camellia_test_ctr_len[u];
  899. memcpy( buf, camellia_test_ctr_pt[u], len );
  900. mbedtls_camellia_crypt_ctr( &ctx, len, &offset, nonce_counter, stream_block,
  901. buf, buf );
  902. if( memcmp( buf, camellia_test_ctr_ct[u], len ) != 0 )
  903. {
  904. if( verbose != 0 )
  905. mbedtls_printf( "failed\n" );
  906. return( 1 );
  907. }
  908. }
  909. if( verbose != 0 )
  910. mbedtls_printf( "passed\n" );
  911. }
  912. if( verbose != 0 )
  913. mbedtls_printf( "\n" );
  914. #endif /* MBEDTLS_CIPHER_MODE_CTR */
  915. return( 0 );
  916. }
  917. #endif /* MBEDTLS_SELF_TEST */
  918. #endif /* MBEDTLS_CAMELLIA_C */