des.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #include "des.h"
  5. int initial_key_permutaion[] = {57, 49, 41, 33, 25, 17, 9,
  6. 1, 58, 50, 42, 34, 26, 18,
  7. 10, 2, 59, 51, 43, 35, 27,
  8. 19, 11, 3, 60, 52, 44, 36,
  9. 63, 55, 47, 39, 31, 23, 15,
  10. 7, 62, 54, 46, 38, 30, 22,
  11. 14, 6, 61, 53, 45, 37, 29,
  12. 21, 13, 5, 28, 20, 12, 4};
  13. int initial_message_permutation[] = {58, 50, 42, 34, 26, 18, 10, 2,
  14. 60, 52, 44, 36, 28, 20, 12, 4,
  15. 62, 54, 46, 38, 30, 22, 14, 6,
  16. 64, 56, 48, 40, 32, 24, 16, 8,
  17. 57, 49, 41, 33, 25, 17, 9, 1,
  18. 59, 51, 43, 35, 27, 19, 11, 3,
  19. 61, 53, 45, 37, 29, 21, 13, 5,
  20. 63, 55, 47, 39, 31, 23, 15, 7};
  21. int key_shift_sizes[] = {-1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1};
  22. int sub_key_permutation[] = {14, 17, 11, 24, 1, 5,
  23. 3, 28, 15, 6, 21, 10,
  24. 23, 19, 12, 4, 26, 8,
  25. 16, 7, 27, 20, 13, 2,
  26. 41, 52, 31, 37, 47, 55,
  27. 30, 40, 51, 45, 33, 48,
  28. 44, 49, 39, 56, 34, 53,
  29. 46, 42, 50, 36, 29, 32};
  30. int message_expansion[] = {32, 1, 2, 3, 4, 5,
  31. 4, 5, 6, 7, 8, 9,
  32. 8, 9, 10, 11, 12, 13,
  33. 12, 13, 14, 15, 16, 17,
  34. 16, 17, 18, 19, 20, 21,
  35. 20, 21, 22, 23, 24, 25,
  36. 24, 25, 26, 27, 28, 29,
  37. 28, 29, 30, 31, 32, 1};
  38. int S1[] = {14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
  39. 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
  40. 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
  41. 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13};
  42. int S2[] = {15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
  43. 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
  44. 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
  45. 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9};
  46. int S3[] = {10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
  47. 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
  48. 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
  49. 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12};
  50. int S4[] = { 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
  51. 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
  52. 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
  53. 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14};
  54. int S5[] = { 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
  55. 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
  56. 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
  57. 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3};
  58. int S6[] = {12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
  59. 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
  60. 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
  61. 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13};
  62. int S7[] = { 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
  63. 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
  64. 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
  65. 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12};
  66. int S8[] = {13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
  67. 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
  68. 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
  69. 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11};
  70. int right_sub_message_permutation[] = {16, 7, 20, 21,
  71. 29, 12, 28, 17,
  72. 1, 15, 23, 26,
  73. 5, 18, 31, 10,
  74. 2, 8, 24, 14,
  75. 32, 27, 3, 9,
  76. 19, 13, 30, 6,
  77. 22, 11, 4, 25};
  78. int final_message_permutation[] = {40, 8, 48, 16, 56, 24, 64, 32,
  79. 39, 7, 47, 15, 55, 23, 63, 31,
  80. 38, 6, 46, 14, 54, 22, 62, 30,
  81. 37, 5, 45, 13, 53, 21, 61, 29,
  82. 36, 4, 44, 12, 52, 20, 60, 28,
  83. 35, 3, 43, 11, 51, 19, 59, 27,
  84. 34, 2, 42, 10, 50, 18, 58, 26,
  85. 33, 1, 41, 9, 49, 17, 57, 25};
  86. void print_char_as_binary(char input) {
  87. int i;
  88. for (i=0; i<8; i++) {
  89. char shift_byte = 0x01 << (7-i);
  90. if (shift_byte & input) {
  91. printf("1");
  92. } else {
  93. printf("0");
  94. }
  95. }
  96. }
  97. void generate_key(unsigned char* key) {
  98. int i;
  99. for (i=0; i<8; i++) {
  100. key[i] = rand()%255;
  101. }
  102. }
  103. void print_key_set(key_set key_set){
  104. int i;
  105. printf("K: \n");
  106. for (i=0; i<8; i++) {
  107. printf("%02X : ", key_set.k[i]);
  108. print_char_as_binary(key_set.k[i]);
  109. printf("\n");
  110. }
  111. printf("\nC: \n");
  112. for (i=0; i<4; i++) {
  113. printf("%02X : ", key_set.c[i]);
  114. print_char_as_binary(key_set.c[i]);
  115. printf("\n");
  116. }
  117. printf("\nD: \n");
  118. for (i=0; i<4; i++) {
  119. printf("%02X : ", key_set.d[i]);
  120. print_char_as_binary(key_set.d[i]);
  121. printf("\n");
  122. }
  123. printf("\n");
  124. }
  125. void generate_sub_keys(unsigned char* main_key, key_set* key_sets) {
  126. int i, j;
  127. int shift_size;
  128. unsigned char shift_byte, first_shift_bits, second_shift_bits, third_shift_bits, fourth_shift_bits;
  129. for (i=0; i<8; i++) {
  130. key_sets[0].k[i] = 0;
  131. }
  132. for (i=0; i<56; i++) {
  133. shift_size = initial_key_permutaion[i];
  134. shift_byte = 0x80 >> ((shift_size - 1)%8);
  135. shift_byte &= main_key[(shift_size - 1)/8];
  136. shift_byte <<= ((shift_size - 1)%8);
  137. key_sets[0].k[i/8] |= (shift_byte >> i%8);
  138. }
  139. for (i=0; i<3; i++) {
  140. key_sets[0].c[i] = key_sets[0].k[i];
  141. }
  142. key_sets[0].c[3] = key_sets[0].k[3] & 0xF0;
  143. for (i=0; i<3; i++) {
  144. key_sets[0].d[i] = (key_sets[0].k[i+3] & 0x0F) << 4;
  145. key_sets[0].d[i] |= (key_sets[0].k[i+4] & 0xF0) >> 4;
  146. }
  147. key_sets[0].d[3] = (key_sets[0].k[6] & 0x0F) << 4;
  148. for (i=1; i<17; i++) {
  149. for (j=0; j<4; j++) {
  150. key_sets[i].c[j] = key_sets[i-1].c[j];
  151. key_sets[i].d[j] = key_sets[i-1].d[j];
  152. }
  153. shift_size = key_shift_sizes[i];
  154. if (shift_size == 1){
  155. shift_byte = 0x80;
  156. } else {
  157. shift_byte = 0xC0;
  158. }
  159. // Process C
  160. first_shift_bits = shift_byte & key_sets[i].c[0];
  161. second_shift_bits = shift_byte & key_sets[i].c[1];
  162. third_shift_bits = shift_byte & key_sets[i].c[2];
  163. fourth_shift_bits = shift_byte & key_sets[i].c[3];
  164. key_sets[i].c[0] <<= shift_size;
  165. key_sets[i].c[0] |= (second_shift_bits >> (8 - shift_size));
  166. key_sets[i].c[1] <<= shift_size;
  167. key_sets[i].c[1] |= (third_shift_bits >> (8 - shift_size));
  168. key_sets[i].c[2] <<= shift_size;
  169. key_sets[i].c[2] |= (fourth_shift_bits >> (8 - shift_size));
  170. key_sets[i].c[3] <<= shift_size;
  171. key_sets[i].c[3] |= (first_shift_bits >> (4 - shift_size));
  172. // Process D
  173. first_shift_bits = shift_byte & key_sets[i].d[0];
  174. second_shift_bits = shift_byte & key_sets[i].d[1];
  175. third_shift_bits = shift_byte & key_sets[i].d[2];
  176. fourth_shift_bits = shift_byte & key_sets[i].d[3];
  177. key_sets[i].d[0] <<= shift_size;
  178. key_sets[i].d[0] |= (second_shift_bits >> (8 - shift_size));
  179. key_sets[i].d[1] <<= shift_size;
  180. key_sets[i].d[1] |= (third_shift_bits >> (8 - shift_size));
  181. key_sets[i].d[2] <<= shift_size;
  182. key_sets[i].d[2] |= (fourth_shift_bits >> (8 - shift_size));
  183. key_sets[i].d[3] <<= shift_size;
  184. key_sets[i].d[3] |= (first_shift_bits >> (4 - shift_size));
  185. for (j=0; j<48; j++) {
  186. shift_size = sub_key_permutation[j];
  187. if (shift_size <= 28) {
  188. shift_byte = 0x80 >> ((shift_size - 1)%8);
  189. shift_byte &= key_sets[i].c[(shift_size - 1)/8];
  190. shift_byte <<= ((shift_size - 1)%8);
  191. } else {
  192. shift_byte = 0x80 >> ((shift_size - 29)%8);
  193. shift_byte &= key_sets[i].d[(shift_size - 29)/8];
  194. shift_byte <<= ((shift_size - 29)%8);
  195. }
  196. key_sets[i].k[j/8] |= (shift_byte >> j%8);
  197. }
  198. }
  199. }
  200. void process_message(unsigned char* message_piece, unsigned char* processed_piece, key_set* key_sets, int mode) {
  201. int i, k;
  202. int shift_size;
  203. unsigned char shift_byte;
  204. unsigned char initial_permutation[8];
  205. memset(initial_permutation, 0, 8);
  206. memset(processed_piece, 0, 8);
  207. for (i=0; i<64; i++) {
  208. shift_size = initial_message_permutation[i];
  209. shift_byte = 0x80 >> ((shift_size - 1)%8);
  210. shift_byte &= message_piece[(shift_size - 1)/8];
  211. shift_byte <<= ((shift_size - 1)%8);
  212. initial_permutation[i/8] |= (shift_byte >> i%8);
  213. }
  214. unsigned char l[4], r[4];
  215. for (i=0; i<4; i++) {
  216. l[i] = initial_permutation[i];
  217. r[i] = initial_permutation[i+4];
  218. }
  219. unsigned char ln[4], rn[4], er[6], ser[4];
  220. int key_index;
  221. for (k=1; k<=16; k++) {
  222. memcpy(ln, r, 4);
  223. memset(er, 0, 6);
  224. for (i=0; i<48; i++) {
  225. shift_size = message_expansion[i];
  226. shift_byte = 0x80 >> ((shift_size - 1)%8);
  227. shift_byte &= r[(shift_size - 1)/8];
  228. shift_byte <<= ((shift_size - 1)%8);
  229. er[i/8] |= (shift_byte >> i%8);
  230. }
  231. if (mode == DECRYPTION_MODE) {
  232. key_index = 17 - k;
  233. } else {
  234. key_index = k;
  235. }
  236. for (i=0; i<6; i++) {
  237. er[i] ^= key_sets[key_index].k[i];
  238. }
  239. unsigned char row, column;
  240. for (i=0; i<4; i++) {
  241. ser[i] = 0;
  242. }
  243. // 0000 0000 0000 0000 0000 0000
  244. // rccc crrc cccr rccc crrc cccr
  245. // Byte 1
  246. row = 0;
  247. row |= ((er[0] & 0x80) >> 6);
  248. row |= ((er[0] & 0x04) >> 2);
  249. column = 0;
  250. column |= ((er[0] & 0x78) >> 3);
  251. ser[0] |= ((unsigned char)S1[row*16+column] << 4);
  252. row = 0;
  253. row |= (er[0] & 0x02);
  254. row |= ((er[1] & 0x10) >> 4);
  255. column = 0;
  256. column |= ((er[0] & 0x01) << 3);
  257. column |= ((er[1] & 0xE0) >> 5);
  258. ser[0] |= (unsigned char)S2[row*16+column];
  259. // Byte 2
  260. row = 0;
  261. row |= ((er[1] & 0x08) >> 2);
  262. row |= ((er[2] & 0x40) >> 6);
  263. column = 0;
  264. column |= ((er[1] & 0x07) << 1);
  265. column |= ((er[2] & 0x80) >> 7);
  266. ser[1] |= ((unsigned char)S3[row*16+column] << 4);
  267. row = 0;
  268. row |= ((er[2] & 0x20) >> 4);
  269. row |= (er[2] & 0x01);
  270. column = 0;
  271. column |= ((er[2] & 0x1E) >> 1);
  272. ser[1] |= (unsigned char)S4[row*16+column];
  273. // Byte 3
  274. row = 0;
  275. row |= ((er[3] & 0x80) >> 6);
  276. row |= ((er[3] & 0x04) >> 2);
  277. column = 0;
  278. column |= ((er[3] & 0x78) >> 3);
  279. ser[2] |= ((unsigned char)S5[row*16+column] << 4);
  280. row = 0;
  281. row |= (er[3] & 0x02);
  282. row |= ((er[4] & 0x10) >> 4);
  283. column = 0;
  284. column |= ((er[3] & 0x01) << 3);
  285. column |= ((er[4] & 0xE0) >> 5);
  286. ser[2] |= (unsigned char)S6[row*16+column];
  287. // Byte 4
  288. row = 0;
  289. row |= ((er[4] & 0x08) >> 2);
  290. row |= ((er[5] & 0x40) >> 6);
  291. column = 0;
  292. column |= ((er[4] & 0x07) << 1);
  293. column |= ((er[5] & 0x80) >> 7);
  294. ser[3] |= ((unsigned char)S7[row*16+column] << 4);
  295. row = 0;
  296. row |= ((er[5] & 0x20) >> 4);
  297. row |= (er[5] & 0x01);
  298. column = 0;
  299. column |= ((er[5] & 0x1E) >> 1);
  300. ser[3] |= (unsigned char)S8[row*16+column];
  301. for (i=0; i<4; i++) {
  302. rn[i] = 0;
  303. }
  304. for (i=0; i<32; i++) {
  305. shift_size = right_sub_message_permutation[i];
  306. shift_byte = 0x80 >> ((shift_size - 1)%8);
  307. shift_byte &= ser[(shift_size - 1)/8];
  308. shift_byte <<= ((shift_size - 1)%8);
  309. rn[i/8] |= (shift_byte >> i%8);
  310. }
  311. for (i=0; i<4; i++) {
  312. rn[i] ^= l[i];
  313. }
  314. for (i=0; i<4; i++) {
  315. l[i] = ln[i];
  316. r[i] = rn[i];
  317. }
  318. }
  319. unsigned char pre_end_permutation[8];
  320. for (i=0; i<4; i++) {
  321. pre_end_permutation[i] = r[i];
  322. pre_end_permutation[4+i] = l[i];
  323. }
  324. for (i=0; i<64; i++) {
  325. shift_size = final_message_permutation[i];
  326. shift_byte = 0x80 >> ((shift_size - 1)%8);
  327. shift_byte &= pre_end_permutation[(shift_size - 1)/8];
  328. shift_byte <<= ((shift_size - 1)%8);
  329. processed_piece[i/8] |= (shift_byte >> i%8);
  330. }
  331. }