serpent.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600
  1. /*
  2. * Cryptographic API.
  3. *
  4. * Serpent Cipher Algorithm.
  5. *
  6. * Copyright (C) 2002 Dag Arne Osvik <osvik@ii.uib.no>
  7. * 2003 Herbert Valerio Riedel <hvr@gnu.org>
  8. *
  9. * Added tnepres support: Ruben Jesus Garcia Hernandez <ruben@ugr.es>, 18.10.2004
  10. * Based on code by hvr
  11. *
  12. * This program is free software; you can redistribute it and/or modify
  13. * it under the terms of the GNU General Public License as published by
  14. * the Free Software Foundation; either version 2 of the License, or
  15. * (at your option) any later version.
  16. */
  17. #include <linux/init.h>
  18. #include <linux/module.h>
  19. #include <linux/errno.h>
  20. #include <asm/byteorder.h>
  21. #include <linux/crypto.h>
  22. #include <linux/types.h>
  23. /* Key is padded to the maximum of 256 bits before round key generation.
  24. * Any key length <= 256 bits (32 bytes) is allowed by the algorithm.
  25. */
  26. #define SERPENT_MIN_KEY_SIZE 0
  27. #define SERPENT_MAX_KEY_SIZE 32
  28. #define SERPENT_EXPKEY_WORDS 132
  29. #define SERPENT_BLOCK_SIZE 16
  30. #define PHI 0x9e3779b9UL
  31. #define keyiter(a,b,c,d,i,j) \
  32. b ^= d; b ^= c; b ^= a; b ^= PHI ^ i; b = rol32(b,11); k[j] = b;
  33. #define loadkeys(x0,x1,x2,x3,i) \
  34. x0=k[i]; x1=k[i+1]; x2=k[i+2]; x3=k[i+3];
  35. #define storekeys(x0,x1,x2,x3,i) \
  36. k[i]=x0; k[i+1]=x1; k[i+2]=x2; k[i+3]=x3;
  37. #define K(x0,x1,x2,x3,i) \
  38. x3 ^= k[4*(i)+3]; x2 ^= k[4*(i)+2]; \
  39. x1 ^= k[4*(i)+1]; x0 ^= k[4*(i)+0];
  40. #define LK(x0,x1,x2,x3,x4,i) \
  41. x0=rol32(x0,13);\
  42. x2=rol32(x2,3); x1 ^= x0; x4 = x0 << 3; \
  43. x3 ^= x2; x1 ^= x2; \
  44. x1=rol32(x1,1); x3 ^= x4; \
  45. x3=rol32(x3,7); x4 = x1; \
  46. x0 ^= x1; x4 <<= 7; x2 ^= x3; \
  47. x0 ^= x3; x2 ^= x4; x3 ^= k[4*i+3]; \
  48. x1 ^= k[4*i+1]; x0=rol32(x0,5); x2=rol32(x2,22);\
  49. x0 ^= k[4*i+0]; x2 ^= k[4*i+2];
  50. #define KL(x0,x1,x2,x3,x4,i) \
  51. x0 ^= k[4*i+0]; x1 ^= k[4*i+1]; x2 ^= k[4*i+2]; \
  52. x3 ^= k[4*i+3]; x0=ror32(x0,5); x2=ror32(x2,22);\
  53. x4 = x1; x2 ^= x3; x0 ^= x3; \
  54. x4 <<= 7; x0 ^= x1; x1=ror32(x1,1); \
  55. x2 ^= x4; x3=ror32(x3,7); x4 = x0 << 3; \
  56. x1 ^= x0; x3 ^= x4; x0=ror32(x0,13);\
  57. x1 ^= x2; x3 ^= x2; x2=ror32(x2,3);
  58. #define S0(x0,x1,x2,x3,x4) \
  59. x4 = x3; \
  60. x3 |= x0; x0 ^= x4; x4 ^= x2; \
  61. x4 =~ x4; x3 ^= x1; x1 &= x0; \
  62. x1 ^= x4; x2 ^= x0; x0 ^= x3; \
  63. x4 |= x0; x0 ^= x2; x2 &= x1; \
  64. x3 ^= x2; x1 =~ x1; x2 ^= x4; \
  65. x1 ^= x2;
  66. #define S1(x0,x1,x2,x3,x4) \
  67. x4 = x1; \
  68. x1 ^= x0; x0 ^= x3; x3 =~ x3; \
  69. x4 &= x1; x0 |= x1; x3 ^= x2; \
  70. x0 ^= x3; x1 ^= x3; x3 ^= x4; \
  71. x1 |= x4; x4 ^= x2; x2 &= x0; \
  72. x2 ^= x1; x1 |= x0; x0 =~ x0; \
  73. x0 ^= x2; x4 ^= x1;
  74. #define S2(x0,x1,x2,x3,x4) \
  75. x3 =~ x3; \
  76. x1 ^= x0; x4 = x0; x0 &= x2; \
  77. x0 ^= x3; x3 |= x4; x2 ^= x1; \
  78. x3 ^= x1; x1 &= x0; x0 ^= x2; \
  79. x2 &= x3; x3 |= x1; x0 =~ x0; \
  80. x3 ^= x0; x4 ^= x0; x0 ^= x2; \
  81. x1 |= x2;
  82. #define S3(x0,x1,x2,x3,x4) \
  83. x4 = x1; \
  84. x1 ^= x3; x3 |= x0; x4 &= x0; \
  85. x0 ^= x2; x2 ^= x1; x1 &= x3; \
  86. x2 ^= x3; x0 |= x4; x4 ^= x3; \
  87. x1 ^= x0; x0 &= x3; x3 &= x4; \
  88. x3 ^= x2; x4 |= x1; x2 &= x1; \
  89. x4 ^= x3; x0 ^= x3; x3 ^= x2;
  90. #define S4(x0,x1,x2,x3,x4) \
  91. x4 = x3; \
  92. x3 &= x0; x0 ^= x4; \
  93. x3 ^= x2; x2 |= x4; x0 ^= x1; \
  94. x4 ^= x3; x2 |= x0; \
  95. x2 ^= x1; x1 &= x0; \
  96. x1 ^= x4; x4 &= x2; x2 ^= x3; \
  97. x4 ^= x0; x3 |= x1; x1 =~ x1; \
  98. x3 ^= x0;
  99. #define S5(x0,x1,x2,x3,x4) \
  100. x4 = x1; x1 |= x0; \
  101. x2 ^= x1; x3 =~ x3; x4 ^= x0; \
  102. x0 ^= x2; x1 &= x4; x4 |= x3; \
  103. x4 ^= x0; x0 &= x3; x1 ^= x3; \
  104. x3 ^= x2; x0 ^= x1; x2 &= x4; \
  105. x1 ^= x2; x2 &= x0; \
  106. x3 ^= x2;
  107. #define S6(x0,x1,x2,x3,x4) \
  108. x4 = x1; \
  109. x3 ^= x0; x1 ^= x2; x2 ^= x0; \
  110. x0 &= x3; x1 |= x3; x4 =~ x4; \
  111. x0 ^= x1; x1 ^= x2; \
  112. x3 ^= x4; x4 ^= x0; x2 &= x0; \
  113. x4 ^= x1; x2 ^= x3; x3 &= x1; \
  114. x3 ^= x0; x1 ^= x2;
  115. #define S7(x0,x1,x2,x3,x4) \
  116. x1 =~ x1; \
  117. x4 = x1; x0 =~ x0; x1 &= x2; \
  118. x1 ^= x3; x3 |= x4; x4 ^= x2; \
  119. x2 ^= x3; x3 ^= x0; x0 |= x1; \
  120. x2 &= x0; x0 ^= x4; x4 ^= x3; \
  121. x3 &= x0; x4 ^= x1; \
  122. x2 ^= x4; x3 ^= x1; x4 |= x0; \
  123. x4 ^= x1;
  124. #define SI0(x0,x1,x2,x3,x4) \
  125. x4 = x3; x1 ^= x0; \
  126. x3 |= x1; x4 ^= x1; x0 =~ x0; \
  127. x2 ^= x3; x3 ^= x0; x0 &= x1; \
  128. x0 ^= x2; x2 &= x3; x3 ^= x4; \
  129. x2 ^= x3; x1 ^= x3; x3 &= x0; \
  130. x1 ^= x0; x0 ^= x2; x4 ^= x3;
  131. #define SI1(x0,x1,x2,x3,x4) \
  132. x1 ^= x3; x4 = x0; \
  133. x0 ^= x2; x2 =~ x2; x4 |= x1; \
  134. x4 ^= x3; x3 &= x1; x1 ^= x2; \
  135. x2 &= x4; x4 ^= x1; x1 |= x3; \
  136. x3 ^= x0; x2 ^= x0; x0 |= x4; \
  137. x2 ^= x4; x1 ^= x0; \
  138. x4 ^= x1;
  139. #define SI2(x0,x1,x2,x3,x4) \
  140. x2 ^= x1; x4 = x3; x3 =~ x3; \
  141. x3 |= x2; x2 ^= x4; x4 ^= x0; \
  142. x3 ^= x1; x1 |= x2; x2 ^= x0; \
  143. x1 ^= x4; x4 |= x3; x2 ^= x3; \
  144. x4 ^= x2; x2 &= x1; \
  145. x2 ^= x3; x3 ^= x4; x4 ^= x0;
  146. #define SI3(x0,x1,x2,x3,x4) \
  147. x2 ^= x1; \
  148. x4 = x1; x1 &= x2; \
  149. x1 ^= x0; x0 |= x4; x4 ^= x3; \
  150. x0 ^= x3; x3 |= x1; x1 ^= x2; \
  151. x1 ^= x3; x0 ^= x2; x2 ^= x3; \
  152. x3 &= x1; x1 ^= x0; x0 &= x2; \
  153. x4 ^= x3; x3 ^= x0; x0 ^= x1;
  154. #define SI4(x0,x1,x2,x3,x4) \
  155. x2 ^= x3; x4 = x0; x0 &= x1; \
  156. x0 ^= x2; x2 |= x3; x4 =~ x4; \
  157. x1 ^= x0; x0 ^= x2; x2 &= x4; \
  158. x2 ^= x0; x0 |= x4; \
  159. x0 ^= x3; x3 &= x2; \
  160. x4 ^= x3; x3 ^= x1; x1 &= x0; \
  161. x4 ^= x1; x0 ^= x3;
  162. #define SI5(x0,x1,x2,x3,x4) \
  163. x4 = x1; x1 |= x2; \
  164. x2 ^= x4; x1 ^= x3; x3 &= x4; \
  165. x2 ^= x3; x3 |= x0; x0 =~ x0; \
  166. x3 ^= x2; x2 |= x0; x4 ^= x1; \
  167. x2 ^= x4; x4 &= x0; x0 ^= x1; \
  168. x1 ^= x3; x0 &= x2; x2 ^= x3; \
  169. x0 ^= x2; x2 ^= x4; x4 ^= x3;
  170. #define SI6(x0,x1,x2,x3,x4) \
  171. x0 ^= x2; \
  172. x4 = x0; x0 &= x3; x2 ^= x3; \
  173. x0 ^= x2; x3 ^= x1; x2 |= x4; \
  174. x2 ^= x3; x3 &= x0; x0 =~ x0; \
  175. x3 ^= x1; x1 &= x2; x4 ^= x0; \
  176. x3 ^= x4; x4 ^= x2; x0 ^= x1; \
  177. x2 ^= x0;
  178. #define SI7(x0,x1,x2,x3,x4) \
  179. x4 = x3; x3 &= x0; x0 ^= x2; \
  180. x2 |= x4; x4 ^= x1; x0 =~ x0; \
  181. x1 |= x3; x4 ^= x0; x0 &= x2; \
  182. x0 ^= x1; x1 &= x2; x3 ^= x2; \
  183. x4 ^= x3; x2 &= x3; x3 |= x0; \
  184. x1 ^= x4; x3 ^= x4; x4 &= x0; \
  185. x4 ^= x2;
  186. struct serpent_ctx {
  187. u32 expkey[SERPENT_EXPKEY_WORDS];
  188. };
  189. static int serpent_setkey(struct crypto_tfm *tfm, const u8 *key,
  190. unsigned int keylen, u32 *flags)
  191. {
  192. struct serpent_ctx *ctx = crypto_tfm_ctx(tfm);
  193. u32 *k = ctx->expkey;
  194. u8 *k8 = (u8 *)k;
  195. u32 r0,r1,r2,r3,r4;
  196. int i;
  197. if ((keylen < SERPENT_MIN_KEY_SIZE)
  198. || (keylen > SERPENT_MAX_KEY_SIZE))
  199. {
  200. *flags |= CRYPTO_TFM_RES_BAD_KEY_LEN;
  201. return -EINVAL;
  202. }
  203. /* Copy key, add padding */
  204. for (i = 0; i < keylen; ++i)
  205. k8[i] = key[i];
  206. if (i < SERPENT_MAX_KEY_SIZE)
  207. k8[i++] = 1;
  208. while (i < SERPENT_MAX_KEY_SIZE)
  209. k8[i++] = 0;
  210. /* Expand key using polynomial */
  211. r0 = le32_to_cpu(k[3]);
  212. r1 = le32_to_cpu(k[4]);
  213. r2 = le32_to_cpu(k[5]);
  214. r3 = le32_to_cpu(k[6]);
  215. r4 = le32_to_cpu(k[7]);
  216. keyiter(le32_to_cpu(k[0]),r0,r4,r2,0,0);
  217. keyiter(le32_to_cpu(k[1]),r1,r0,r3,1,1);
  218. keyiter(le32_to_cpu(k[2]),r2,r1,r4,2,2);
  219. keyiter(le32_to_cpu(k[3]),r3,r2,r0,3,3);
  220. keyiter(le32_to_cpu(k[4]),r4,r3,r1,4,4);
  221. keyiter(le32_to_cpu(k[5]),r0,r4,r2,5,5);
  222. keyiter(le32_to_cpu(k[6]),r1,r0,r3,6,6);
  223. keyiter(le32_to_cpu(k[7]),r2,r1,r4,7,7);
  224. keyiter(k[ 0],r3,r2,r0, 8, 8); keyiter(k[ 1],r4,r3,r1, 9, 9);
  225. keyiter(k[ 2],r0,r4,r2, 10, 10); keyiter(k[ 3],r1,r0,r3, 11, 11);
  226. keyiter(k[ 4],r2,r1,r4, 12, 12); keyiter(k[ 5],r3,r2,r0, 13, 13);
  227. keyiter(k[ 6],r4,r3,r1, 14, 14); keyiter(k[ 7],r0,r4,r2, 15, 15);
  228. keyiter(k[ 8],r1,r0,r3, 16, 16); keyiter(k[ 9],r2,r1,r4, 17, 17);
  229. keyiter(k[ 10],r3,r2,r0, 18, 18); keyiter(k[ 11],r4,r3,r1, 19, 19);
  230. keyiter(k[ 12],r0,r4,r2, 20, 20); keyiter(k[ 13],r1,r0,r3, 21, 21);
  231. keyiter(k[ 14],r2,r1,r4, 22, 22); keyiter(k[ 15],r3,r2,r0, 23, 23);
  232. keyiter(k[ 16],r4,r3,r1, 24, 24); keyiter(k[ 17],r0,r4,r2, 25, 25);
  233. keyiter(k[ 18],r1,r0,r3, 26, 26); keyiter(k[ 19],r2,r1,r4, 27, 27);
  234. keyiter(k[ 20],r3,r2,r0, 28, 28); keyiter(k[ 21],r4,r3,r1, 29, 29);
  235. keyiter(k[ 22],r0,r4,r2, 30, 30); keyiter(k[ 23],r1,r0,r3, 31, 31);
  236. k += 50;
  237. keyiter(k[-26],r2,r1,r4, 32,-18); keyiter(k[-25],r3,r2,r0, 33,-17);
  238. keyiter(k[-24],r4,r3,r1, 34,-16); keyiter(k[-23],r0,r4,r2, 35,-15);
  239. keyiter(k[-22],r1,r0,r3, 36,-14); keyiter(k[-21],r2,r1,r4, 37,-13);
  240. keyiter(k[-20],r3,r2,r0, 38,-12); keyiter(k[-19],r4,r3,r1, 39,-11);
  241. keyiter(k[-18],r0,r4,r2, 40,-10); keyiter(k[-17],r1,r0,r3, 41, -9);
  242. keyiter(k[-16],r2,r1,r4, 42, -8); keyiter(k[-15],r3,r2,r0, 43, -7);
  243. keyiter(k[-14],r4,r3,r1, 44, -6); keyiter(k[-13],r0,r4,r2, 45, -5);
  244. keyiter(k[-12],r1,r0,r3, 46, -4); keyiter(k[-11],r2,r1,r4, 47, -3);
  245. keyiter(k[-10],r3,r2,r0, 48, -2); keyiter(k[ -9],r4,r3,r1, 49, -1);
  246. keyiter(k[ -8],r0,r4,r2, 50, 0); keyiter(k[ -7],r1,r0,r3, 51, 1);
  247. keyiter(k[ -6],r2,r1,r4, 52, 2); keyiter(k[ -5],r3,r2,r0, 53, 3);
  248. keyiter(k[ -4],r4,r3,r1, 54, 4); keyiter(k[ -3],r0,r4,r2, 55, 5);
  249. keyiter(k[ -2],r1,r0,r3, 56, 6); keyiter(k[ -1],r2,r1,r4, 57, 7);
  250. keyiter(k[ 0],r3,r2,r0, 58, 8); keyiter(k[ 1],r4,r3,r1, 59, 9);
  251. keyiter(k[ 2],r0,r4,r2, 60, 10); keyiter(k[ 3],r1,r0,r3, 61, 11);
  252. keyiter(k[ 4],r2,r1,r4, 62, 12); keyiter(k[ 5],r3,r2,r0, 63, 13);
  253. keyiter(k[ 6],r4,r3,r1, 64, 14); keyiter(k[ 7],r0,r4,r2, 65, 15);
  254. keyiter(k[ 8],r1,r0,r3, 66, 16); keyiter(k[ 9],r2,r1,r4, 67, 17);
  255. keyiter(k[ 10],r3,r2,r0, 68, 18); keyiter(k[ 11],r4,r3,r1, 69, 19);
  256. keyiter(k[ 12],r0,r4,r2, 70, 20); keyiter(k[ 13],r1,r0,r3, 71, 21);
  257. keyiter(k[ 14],r2,r1,r4, 72, 22); keyiter(k[ 15],r3,r2,r0, 73, 23);
  258. keyiter(k[ 16],r4,r3,r1, 74, 24); keyiter(k[ 17],r0,r4,r2, 75, 25);
  259. keyiter(k[ 18],r1,r0,r3, 76, 26); keyiter(k[ 19],r2,r1,r4, 77, 27);
  260. keyiter(k[ 20],r3,r2,r0, 78, 28); keyiter(k[ 21],r4,r3,r1, 79, 29);
  261. keyiter(k[ 22],r0,r4,r2, 80, 30); keyiter(k[ 23],r1,r0,r3, 81, 31);
  262. k += 50;
  263. keyiter(k[-26],r2,r1,r4, 82,-18); keyiter(k[-25],r3,r2,r0, 83,-17);
  264. keyiter(k[-24],r4,r3,r1, 84,-16); keyiter(k[-23],r0,r4,r2, 85,-15);
  265. keyiter(k[-22],r1,r0,r3, 86,-14); keyiter(k[-21],r2,r1,r4, 87,-13);
  266. keyiter(k[-20],r3,r2,r0, 88,-12); keyiter(k[-19],r4,r3,r1, 89,-11);
  267. keyiter(k[-18],r0,r4,r2, 90,-10); keyiter(k[-17],r1,r0,r3, 91, -9);
  268. keyiter(k[-16],r2,r1,r4, 92, -8); keyiter(k[-15],r3,r2,r0, 93, -7);
  269. keyiter(k[-14],r4,r3,r1, 94, -6); keyiter(k[-13],r0,r4,r2, 95, -5);
  270. keyiter(k[-12],r1,r0,r3, 96, -4); keyiter(k[-11],r2,r1,r4, 97, -3);
  271. keyiter(k[-10],r3,r2,r0, 98, -2); keyiter(k[ -9],r4,r3,r1, 99, -1);
  272. keyiter(k[ -8],r0,r4,r2,100, 0); keyiter(k[ -7],r1,r0,r3,101, 1);
  273. keyiter(k[ -6],r2,r1,r4,102, 2); keyiter(k[ -5],r3,r2,r0,103, 3);
  274. keyiter(k[ -4],r4,r3,r1,104, 4); keyiter(k[ -3],r0,r4,r2,105, 5);
  275. keyiter(k[ -2],r1,r0,r3,106, 6); keyiter(k[ -1],r2,r1,r4,107, 7);
  276. keyiter(k[ 0],r3,r2,r0,108, 8); keyiter(k[ 1],r4,r3,r1,109, 9);
  277. keyiter(k[ 2],r0,r4,r2,110, 10); keyiter(k[ 3],r1,r0,r3,111, 11);
  278. keyiter(k[ 4],r2,r1,r4,112, 12); keyiter(k[ 5],r3,r2,r0,113, 13);
  279. keyiter(k[ 6],r4,r3,r1,114, 14); keyiter(k[ 7],r0,r4,r2,115, 15);
  280. keyiter(k[ 8],r1,r0,r3,116, 16); keyiter(k[ 9],r2,r1,r4,117, 17);
  281. keyiter(k[ 10],r3,r2,r0,118, 18); keyiter(k[ 11],r4,r3,r1,119, 19);
  282. keyiter(k[ 12],r0,r4,r2,120, 20); keyiter(k[ 13],r1,r0,r3,121, 21);
  283. keyiter(k[ 14],r2,r1,r4,122, 22); keyiter(k[ 15],r3,r2,r0,123, 23);
  284. keyiter(k[ 16],r4,r3,r1,124, 24); keyiter(k[ 17],r0,r4,r2,125, 25);
  285. keyiter(k[ 18],r1,r0,r3,126, 26); keyiter(k[ 19],r2,r1,r4,127, 27);
  286. keyiter(k[ 20],r3,r2,r0,128, 28); keyiter(k[ 21],r4,r3,r1,129, 29);
  287. keyiter(k[ 22],r0,r4,r2,130, 30); keyiter(k[ 23],r1,r0,r3,131, 31);
  288. /* Apply S-boxes */
  289. S3(r3,r4,r0,r1,r2); storekeys(r1,r2,r4,r3, 28); loadkeys(r1,r2,r4,r3, 24);
  290. S4(r1,r2,r4,r3,r0); storekeys(r2,r4,r3,r0, 24); loadkeys(r2,r4,r3,r0, 20);
  291. S5(r2,r4,r3,r0,r1); storekeys(r1,r2,r4,r0, 20); loadkeys(r1,r2,r4,r0, 16);
  292. S6(r1,r2,r4,r0,r3); storekeys(r4,r3,r2,r0, 16); loadkeys(r4,r3,r2,r0, 12);
  293. S7(r4,r3,r2,r0,r1); storekeys(r1,r2,r0,r4, 12); loadkeys(r1,r2,r0,r4, 8);
  294. S0(r1,r2,r0,r4,r3); storekeys(r0,r2,r4,r1, 8); loadkeys(r0,r2,r4,r1, 4);
  295. S1(r0,r2,r4,r1,r3); storekeys(r3,r4,r1,r0, 4); loadkeys(r3,r4,r1,r0, 0);
  296. S2(r3,r4,r1,r0,r2); storekeys(r2,r4,r3,r0, 0); loadkeys(r2,r4,r3,r0, -4);
  297. S3(r2,r4,r3,r0,r1); storekeys(r0,r1,r4,r2, -4); loadkeys(r0,r1,r4,r2, -8);
  298. S4(r0,r1,r4,r2,r3); storekeys(r1,r4,r2,r3, -8); loadkeys(r1,r4,r2,r3,-12);
  299. S5(r1,r4,r2,r3,r0); storekeys(r0,r1,r4,r3,-12); loadkeys(r0,r1,r4,r3,-16);
  300. S6(r0,r1,r4,r3,r2); storekeys(r4,r2,r1,r3,-16); loadkeys(r4,r2,r1,r3,-20);
  301. S7(r4,r2,r1,r3,r0); storekeys(r0,r1,r3,r4,-20); loadkeys(r0,r1,r3,r4,-24);
  302. S0(r0,r1,r3,r4,r2); storekeys(r3,r1,r4,r0,-24); loadkeys(r3,r1,r4,r0,-28);
  303. k -= 50;
  304. S1(r3,r1,r4,r0,r2); storekeys(r2,r4,r0,r3, 22); loadkeys(r2,r4,r0,r3, 18);
  305. S2(r2,r4,r0,r3,r1); storekeys(r1,r4,r2,r3, 18); loadkeys(r1,r4,r2,r3, 14);
  306. S3(r1,r4,r2,r3,r0); storekeys(r3,r0,r4,r1, 14); loadkeys(r3,r0,r4,r1, 10);
  307. S4(r3,r0,r4,r1,r2); storekeys(r0,r4,r1,r2, 10); loadkeys(r0,r4,r1,r2, 6);
  308. S5(r0,r4,r1,r2,r3); storekeys(r3,r0,r4,r2, 6); loadkeys(r3,r0,r4,r2, 2);
  309. S6(r3,r0,r4,r2,r1); storekeys(r4,r1,r0,r2, 2); loadkeys(r4,r1,r0,r2, -2);
  310. S7(r4,r1,r0,r2,r3); storekeys(r3,r0,r2,r4, -2); loadkeys(r3,r0,r2,r4, -6);
  311. S0(r3,r0,r2,r4,r1); storekeys(r2,r0,r4,r3, -6); loadkeys(r2,r0,r4,r3,-10);
  312. S1(r2,r0,r4,r3,r1); storekeys(r1,r4,r3,r2,-10); loadkeys(r1,r4,r3,r2,-14);
  313. S2(r1,r4,r3,r2,r0); storekeys(r0,r4,r1,r2,-14); loadkeys(r0,r4,r1,r2,-18);
  314. S3(r0,r4,r1,r2,r3); storekeys(r2,r3,r4,r0,-18); loadkeys(r2,r3,r4,r0,-22);
  315. k -= 50;
  316. S4(r2,r3,r4,r0,r1); storekeys(r3,r4,r0,r1, 28); loadkeys(r3,r4,r0,r1, 24);
  317. S5(r3,r4,r0,r1,r2); storekeys(r2,r3,r4,r1, 24); loadkeys(r2,r3,r4,r1, 20);
  318. S6(r2,r3,r4,r1,r0); storekeys(r4,r0,r3,r1, 20); loadkeys(r4,r0,r3,r1, 16);
  319. S7(r4,r0,r3,r1,r2); storekeys(r2,r3,r1,r4, 16); loadkeys(r2,r3,r1,r4, 12);
  320. S0(r2,r3,r1,r4,r0); storekeys(r1,r3,r4,r2, 12); loadkeys(r1,r3,r4,r2, 8);
  321. S1(r1,r3,r4,r2,r0); storekeys(r0,r4,r2,r1, 8); loadkeys(r0,r4,r2,r1, 4);
  322. S2(r0,r4,r2,r1,r3); storekeys(r3,r4,r0,r1, 4); loadkeys(r3,r4,r0,r1, 0);
  323. S3(r3,r4,r0,r1,r2); storekeys(r1,r2,r4,r3, 0);
  324. return 0;
  325. }
  326. static void serpent_encrypt(struct crypto_tfm *tfm, u8 *dst, const u8 *src)
  327. {
  328. struct serpent_ctx *ctx = crypto_tfm_ctx(tfm);
  329. const u32
  330. *k = ctx->expkey,
  331. *s = (const u32 *)src;
  332. u32 *d = (u32 *)dst,
  333. r0, r1, r2, r3, r4;
  334. /*
  335. * Note: The conversions between u8* and u32* might cause trouble
  336. * on architectures with stricter alignment rules than x86
  337. */
  338. r0 = le32_to_cpu(s[0]);
  339. r1 = le32_to_cpu(s[1]);
  340. r2 = le32_to_cpu(s[2]);
  341. r3 = le32_to_cpu(s[3]);
  342. K(r0,r1,r2,r3,0);
  343. S0(r0,r1,r2,r3,r4); LK(r2,r1,r3,r0,r4,1);
  344. S1(r2,r1,r3,r0,r4); LK(r4,r3,r0,r2,r1,2);
  345. S2(r4,r3,r0,r2,r1); LK(r1,r3,r4,r2,r0,3);
  346. S3(r1,r3,r4,r2,r0); LK(r2,r0,r3,r1,r4,4);
  347. S4(r2,r0,r3,r1,r4); LK(r0,r3,r1,r4,r2,5);
  348. S5(r0,r3,r1,r4,r2); LK(r2,r0,r3,r4,r1,6);
  349. S6(r2,r0,r3,r4,r1); LK(r3,r1,r0,r4,r2,7);
  350. S7(r3,r1,r0,r4,r2); LK(r2,r0,r4,r3,r1,8);
  351. S0(r2,r0,r4,r3,r1); LK(r4,r0,r3,r2,r1,9);
  352. S1(r4,r0,r3,r2,r1); LK(r1,r3,r2,r4,r0,10);
  353. S2(r1,r3,r2,r4,r0); LK(r0,r3,r1,r4,r2,11);
  354. S3(r0,r3,r1,r4,r2); LK(r4,r2,r3,r0,r1,12);
  355. S4(r4,r2,r3,r0,r1); LK(r2,r3,r0,r1,r4,13);
  356. S5(r2,r3,r0,r1,r4); LK(r4,r2,r3,r1,r0,14);
  357. S6(r4,r2,r3,r1,r0); LK(r3,r0,r2,r1,r4,15);
  358. S7(r3,r0,r2,r1,r4); LK(r4,r2,r1,r3,r0,16);
  359. S0(r4,r2,r1,r3,r0); LK(r1,r2,r3,r4,r0,17);
  360. S1(r1,r2,r3,r4,r0); LK(r0,r3,r4,r1,r2,18);
  361. S2(r0,r3,r4,r1,r2); LK(r2,r3,r0,r1,r4,19);
  362. S3(r2,r3,r0,r1,r4); LK(r1,r4,r3,r2,r0,20);
  363. S4(r1,r4,r3,r2,r0); LK(r4,r3,r2,r0,r1,21);
  364. S5(r4,r3,r2,r0,r1); LK(r1,r4,r3,r0,r2,22);
  365. S6(r1,r4,r3,r0,r2); LK(r3,r2,r4,r0,r1,23);
  366. S7(r3,r2,r4,r0,r1); LK(r1,r4,r0,r3,r2,24);
  367. S0(r1,r4,r0,r3,r2); LK(r0,r4,r3,r1,r2,25);
  368. S1(r0,r4,r3,r1,r2); LK(r2,r3,r1,r0,r4,26);
  369. S2(r2,r3,r1,r0,r4); LK(r4,r3,r2,r0,r1,27);
  370. S3(r4,r3,r2,r0,r1); LK(r0,r1,r3,r4,r2,28);
  371. S4(r0,r1,r3,r4,r2); LK(r1,r3,r4,r2,r0,29);
  372. S5(r1,r3,r4,r2,r0); LK(r0,r1,r3,r2,r4,30);
  373. S6(r0,r1,r3,r2,r4); LK(r3,r4,r1,r2,r0,31);
  374. S7(r3,r4,r1,r2,r0); K(r0,r1,r2,r3,32);
  375. d[0] = cpu_to_le32(r0);
  376. d[1] = cpu_to_le32(r1);
  377. d[2] = cpu_to_le32(r2);
  378. d[3] = cpu_to_le32(r3);
  379. }
  380. static void serpent_decrypt(struct crypto_tfm *tfm, u8 *dst, const u8 *src)
  381. {
  382. struct serpent_ctx *ctx = crypto_tfm_ctx(tfm);
  383. const u32
  384. *k = ((struct serpent_ctx *)ctx)->expkey,
  385. *s = (const u32 *)src;
  386. u32 *d = (u32 *)dst,
  387. r0, r1, r2, r3, r4;
  388. r0 = le32_to_cpu(s[0]);
  389. r1 = le32_to_cpu(s[1]);
  390. r2 = le32_to_cpu(s[2]);
  391. r3 = le32_to_cpu(s[3]);
  392. K(r0,r1,r2,r3,32);
  393. SI7(r0,r1,r2,r3,r4); KL(r1,r3,r0,r4,r2,31);
  394. SI6(r1,r3,r0,r4,r2); KL(r0,r2,r4,r1,r3,30);
  395. SI5(r0,r2,r4,r1,r3); KL(r2,r3,r0,r4,r1,29);
  396. SI4(r2,r3,r0,r4,r1); KL(r2,r0,r1,r4,r3,28);
  397. SI3(r2,r0,r1,r4,r3); KL(r1,r2,r3,r4,r0,27);
  398. SI2(r1,r2,r3,r4,r0); KL(r2,r0,r4,r3,r1,26);
  399. SI1(r2,r0,r4,r3,r1); KL(r1,r0,r4,r3,r2,25);
  400. SI0(r1,r0,r4,r3,r2); KL(r4,r2,r0,r1,r3,24);
  401. SI7(r4,r2,r0,r1,r3); KL(r2,r1,r4,r3,r0,23);
  402. SI6(r2,r1,r4,r3,r0); KL(r4,r0,r3,r2,r1,22);
  403. SI5(r4,r0,r3,r2,r1); KL(r0,r1,r4,r3,r2,21);
  404. SI4(r0,r1,r4,r3,r2); KL(r0,r4,r2,r3,r1,20);
  405. SI3(r0,r4,r2,r3,r1); KL(r2,r0,r1,r3,r4,19);
  406. SI2(r2,r0,r1,r3,r4); KL(r0,r4,r3,r1,r2,18);
  407. SI1(r0,r4,r3,r1,r2); KL(r2,r4,r3,r1,r0,17);
  408. SI0(r2,r4,r3,r1,r0); KL(r3,r0,r4,r2,r1,16);
  409. SI7(r3,r0,r4,r2,r1); KL(r0,r2,r3,r1,r4,15);
  410. SI6(r0,r2,r3,r1,r4); KL(r3,r4,r1,r0,r2,14);
  411. SI5(r3,r4,r1,r0,r2); KL(r4,r2,r3,r1,r0,13);
  412. SI4(r4,r2,r3,r1,r0); KL(r4,r3,r0,r1,r2,12);
  413. SI3(r4,r3,r0,r1,r2); KL(r0,r4,r2,r1,r3,11);
  414. SI2(r0,r4,r2,r1,r3); KL(r4,r3,r1,r2,r0,10);
  415. SI1(r4,r3,r1,r2,r0); KL(r0,r3,r1,r2,r4,9);
  416. SI0(r0,r3,r1,r2,r4); KL(r1,r4,r3,r0,r2,8);
  417. SI7(r1,r4,r3,r0,r2); KL(r4,r0,r1,r2,r3,7);
  418. SI6(r4,r0,r1,r2,r3); KL(r1,r3,r2,r4,r0,6);
  419. SI5(r1,r3,r2,r4,r0); KL(r3,r0,r1,r2,r4,5);
  420. SI4(r3,r0,r1,r2,r4); KL(r3,r1,r4,r2,r0,4);
  421. SI3(r3,r1,r4,r2,r0); KL(r4,r3,r0,r2,r1,3);
  422. SI2(r4,r3,r0,r2,r1); KL(r3,r1,r2,r0,r4,2);
  423. SI1(r3,r1,r2,r0,r4); KL(r4,r1,r2,r0,r3,1);
  424. SI0(r4,r1,r2,r0,r3); K(r2,r3,r1,r4,0);
  425. d[0] = cpu_to_le32(r2);
  426. d[1] = cpu_to_le32(r3);
  427. d[2] = cpu_to_le32(r1);
  428. d[3] = cpu_to_le32(r4);
  429. }
  430. static struct crypto_alg serpent_alg = {
  431. .cra_name = "serpent",
  432. .cra_flags = CRYPTO_ALG_TYPE_CIPHER,
  433. .cra_blocksize = SERPENT_BLOCK_SIZE,
  434. .cra_ctxsize = sizeof(struct serpent_ctx),
  435. .cra_alignmask = 3,
  436. .cra_module = THIS_MODULE,
  437. .cra_list = LIST_HEAD_INIT(serpent_alg.cra_list),
  438. .cra_u = { .cipher = {
  439. .cia_min_keysize = SERPENT_MIN_KEY_SIZE,
  440. .cia_max_keysize = SERPENT_MAX_KEY_SIZE,
  441. .cia_setkey = serpent_setkey,
  442. .cia_encrypt = serpent_encrypt,
  443. .cia_decrypt = serpent_decrypt } }
  444. };
  445. static int tnepres_setkey(struct crypto_tfm *tfm, const u8 *key,
  446. unsigned int keylen, u32 *flags)
  447. {
  448. u8 rev_key[SERPENT_MAX_KEY_SIZE];
  449. int i;
  450. if ((keylen < SERPENT_MIN_KEY_SIZE)
  451. || (keylen > SERPENT_MAX_KEY_SIZE)) {
  452. *flags |= CRYPTO_TFM_RES_BAD_KEY_LEN;
  453. return -EINVAL;
  454. }
  455. for (i = 0; i < keylen; ++i)
  456. rev_key[keylen - i - 1] = key[i];
  457. return serpent_setkey(tfm, rev_key, keylen, flags);
  458. }
  459. static void tnepres_encrypt(struct crypto_tfm *tfm, u8 *dst, const u8 *src)
  460. {
  461. const u32 * const s = (const u32 * const)src;
  462. u32 * const d = (u32 * const)dst;
  463. u32 rs[4], rd[4];
  464. rs[0] = swab32(s[3]);
  465. rs[1] = swab32(s[2]);
  466. rs[2] = swab32(s[1]);
  467. rs[3] = swab32(s[0]);
  468. serpent_encrypt(tfm, (u8 *)rd, (u8 *)rs);
  469. d[0] = swab32(rd[3]);
  470. d[1] = swab32(rd[2]);
  471. d[2] = swab32(rd[1]);
  472. d[3] = swab32(rd[0]);
  473. }
  474. static void tnepres_decrypt(struct crypto_tfm *tfm, u8 *dst, const u8 *src)
  475. {
  476. const u32 * const s = (const u32 * const)src;
  477. u32 * const d = (u32 * const)dst;
  478. u32 rs[4], rd[4];
  479. rs[0] = swab32(s[3]);
  480. rs[1] = swab32(s[2]);
  481. rs[2] = swab32(s[1]);
  482. rs[3] = swab32(s[0]);
  483. serpent_decrypt(tfm, (u8 *)rd, (u8 *)rs);
  484. d[0] = swab32(rd[3]);
  485. d[1] = swab32(rd[2]);
  486. d[2] = swab32(rd[1]);
  487. d[3] = swab32(rd[0]);
  488. }
  489. static struct crypto_alg tnepres_alg = {
  490. .cra_name = "tnepres",
  491. .cra_flags = CRYPTO_ALG_TYPE_CIPHER,
  492. .cra_blocksize = SERPENT_BLOCK_SIZE,
  493. .cra_ctxsize = sizeof(struct serpent_ctx),
  494. .cra_alignmask = 3,
  495. .cra_module = THIS_MODULE,
  496. .cra_list = LIST_HEAD_INIT(serpent_alg.cra_list),
  497. .cra_u = { .cipher = {
  498. .cia_min_keysize = SERPENT_MIN_KEY_SIZE,
  499. .cia_max_keysize = SERPENT_MAX_KEY_SIZE,
  500. .cia_setkey = tnepres_setkey,
  501. .cia_encrypt = tnepres_encrypt,
  502. .cia_decrypt = tnepres_decrypt } }
  503. };
  504. static int __init init(void)
  505. {
  506. int ret = crypto_register_alg(&serpent_alg);
  507. if (ret)
  508. return ret;
  509. ret = crypto_register_alg(&tnepres_alg);
  510. if (ret)
  511. crypto_unregister_alg(&serpent_alg);
  512. return ret;
  513. }
  514. static void __exit fini(void)
  515. {
  516. crypto_unregister_alg(&tnepres_alg);
  517. crypto_unregister_alg(&serpent_alg);
  518. }
  519. module_init(init);
  520. module_exit(fini);
  521. MODULE_LICENSE("GPL");
  522. MODULE_DESCRIPTION("Serpent and tnepres (kerneli compatible serpent reversed) Cipher Algorithm");
  523. MODULE_AUTHOR("Dag Arne Osvik <osvik@ii.uib.no>");
  524. MODULE_ALIAS("tnepres");