camellia.c 34 KB

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