You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

rspamd_cryptobox_test.c 9.3KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355
  1. /*
  2. * Copyright (c) 2015, Vsevolod Stakhov
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. * * Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * * Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. *
  13. * THIS SOFTWARE IS PROVIDED BY AUTHOR ''AS IS'' AND ANY
  14. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  15. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  16. * DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY
  17. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  18. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  19. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  20. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  21. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  22. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  23. */
  24. #include "config.h"
  25. #include "rspamd.h"
  26. #include "shingles.h"
  27. #include "fstring.h"
  28. #include "ottery.h"
  29. #include "cryptobox.h"
  30. #include "unix-std.h"
  31. static const int mapping_size = 64 * 8192 + 1;
  32. static const int max_seg = 32;
  33. static const int random_fuzz_cnt = 10000;
  34. static void *
  35. create_mapping (int mapping_len, guchar **beg, guchar **end)
  36. {
  37. void *map;
  38. int psize = getpagesize ();
  39. map = mmap (NULL, mapping_len + psize * 3, PROT_READ|PROT_WRITE,
  40. MAP_ANON|MAP_SHARED, -1, 0);
  41. g_assert (map != 0);
  42. memset (map, 0, mapping_len + psize * 3);
  43. mprotect (map, psize, PROT_NONE);
  44. /* Misalign pointer */
  45. *beg = ((guchar *)map) + psize + 1;
  46. *end = *beg + mapping_len;
  47. mprotect (*beg + mapping_len - 1 + psize, psize, PROT_NONE);
  48. return map;
  49. }
  50. static void
  51. check_result (const rspamd_nm_t key, const rspamd_nonce_t nonce,
  52. const rspamd_sig_t mac, guchar *begin, guchar *end)
  53. {
  54. guint64 *t = (guint64 *)begin;
  55. g_assert (rspamd_cryptobox_decrypt_nm_inplace (begin, end - begin, nonce, key,
  56. mac));
  57. while (t < (guint64 *)end) {
  58. g_assert (*t == 0);
  59. t ++;
  60. }
  61. }
  62. static int
  63. create_random_split (struct rspamd_cryptobox_segment *seg, int mseg,
  64. guchar *begin, guchar *end)
  65. {
  66. gsize remain = end - begin;
  67. gint used = 0;
  68. while (remain > 0 && used < mseg - 1) {
  69. seg->data = begin;
  70. seg->len = ottery_rand_range (remain - 1) + 1;
  71. begin += seg->len;
  72. remain -= seg->len;
  73. used ++;
  74. seg ++;
  75. }
  76. if (remain > 0) {
  77. seg->data = begin;
  78. seg->len = remain;
  79. used ++;
  80. }
  81. return used;
  82. }
  83. static int
  84. create_realistic_split (struct rspamd_cryptobox_segment *seg, int mseg,
  85. guchar *begin, guchar *end)
  86. {
  87. gsize remain = end - begin;
  88. gint used = 0;
  89. static const int small_seg = 512, medium_seg = 2048;
  90. while (remain > 0 && used < mseg - 1) {
  91. seg->data = begin;
  92. if (ottery_rand_uint32 () % 2 == 0) {
  93. seg->len = ottery_rand_range (small_seg) + 1;
  94. }
  95. else {
  96. seg->len = ottery_rand_range (medium_seg) +
  97. small_seg;
  98. }
  99. if (seg->len > remain) {
  100. seg->len = remain;
  101. }
  102. begin += seg->len;
  103. remain -= seg->len;
  104. used ++;
  105. seg ++;
  106. }
  107. if (remain > 0) {
  108. seg->data = begin;
  109. seg->len = remain;
  110. used ++;
  111. }
  112. return used;
  113. }
  114. static int
  115. create_constrainted_split (struct rspamd_cryptobox_segment *seg, int mseg,
  116. int constraint,
  117. guchar *begin, guchar *end)
  118. {
  119. gsize remain = end - begin;
  120. gint used = 0;
  121. while (remain > 0 && used < mseg - 1) {
  122. seg->data = begin;
  123. seg->len = constraint;
  124. if (seg->len > remain) {
  125. seg->len = remain;
  126. }
  127. begin += seg->len;
  128. remain -= seg->len;
  129. used ++;
  130. seg ++;
  131. }
  132. if (remain > 0) {
  133. seg->data = begin;
  134. seg->len = remain;
  135. used ++;
  136. }
  137. return used;
  138. }
  139. void
  140. rspamd_cryptobox_test_func (void)
  141. {
  142. void *map;
  143. guchar *begin, *end;
  144. rspamd_nm_t key;
  145. rspamd_nonce_t nonce;
  146. rspamd_sig_t mac;
  147. struct rspamd_cryptobox_segment *seg;
  148. double t1, t2;
  149. gint i, cnt, ms;
  150. gboolean checked_openssl = FALSE;
  151. map = create_mapping (mapping_size, &begin, &end);
  152. ottery_rand_bytes (key, sizeof (key));
  153. ottery_rand_bytes (nonce, sizeof (nonce));
  154. memset (mac, 0, sizeof (mac));
  155. seg = g_slice_alloc0 (sizeof (*seg) * max_seg * 10);
  156. /* Test baseline */
  157. t1 = rspamd_get_ticks ();
  158. rspamd_cryptobox_encrypt_nm_inplace (begin, end - begin, nonce, key, mac);
  159. t2 = rspamd_get_ticks ();
  160. check_result (key, nonce, mac, begin, end);
  161. msg_info ("baseline encryption: %.6f", t2 - t1);
  162. if (rspamd_cryptobox_openssl_mode (TRUE)) {
  163. t1 = rspamd_get_ticks ();
  164. rspamd_cryptobox_encrypt_nm_inplace (begin,
  165. end - begin,
  166. nonce,
  167. key,
  168. mac);
  169. t2 = rspamd_get_ticks ();
  170. check_result (key, nonce, mac, begin, end);
  171. msg_info ("openssl baseline encryption: %.6f", t2 - t1);
  172. rspamd_cryptobox_openssl_mode (FALSE);
  173. }
  174. start:
  175. /* A single chunk as vector */
  176. seg[0].data = begin;
  177. seg[0].len = end - begin;
  178. t1 = rspamd_get_ticks ();
  179. rspamd_cryptobox_encryptv_nm_inplace (seg, 1, nonce, key, mac);
  180. t2 = rspamd_get_ticks ();
  181. check_result (key, nonce, mac, begin, end);
  182. msg_info ("bulk encryption: %.6f", t2 - t1);
  183. /* Two chunks as vector */
  184. seg[0].data = begin;
  185. seg[0].len = (end - begin) / 2;
  186. seg[1].data = begin + seg[0].len;
  187. seg[1].len = (end - begin) - seg[0].len;
  188. t1 = rspamd_get_ticks ();
  189. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  190. t2 = rspamd_get_ticks ();
  191. check_result (key, nonce, mac, begin, end);
  192. msg_info ("2 equal chunks encryption: %.6f", t2 - t1);
  193. seg[0].data = begin;
  194. seg[0].len = 1;
  195. seg[1].data = begin + seg[0].len;
  196. seg[1].len = (end - begin) - seg[0].len;
  197. t1 = rspamd_get_ticks ();
  198. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  199. t2 = rspamd_get_ticks ();
  200. check_result (key, nonce, mac, begin, end);
  201. msg_info ("small and large chunks encryption: %.6f", t2 - t1);
  202. seg[0].data = begin;
  203. seg[0].len = (end - begin) - 3;
  204. seg[1].data = begin + seg[0].len;
  205. seg[1].len = (end - begin) - seg[0].len;
  206. t1 = rspamd_get_ticks ();
  207. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  208. t2 = rspamd_get_ticks ();
  209. check_result (key, nonce, mac, begin, end);
  210. msg_info ("large and small chunks encryption: %.6f", t2 - t1);
  211. /* Random two chunks as vector */
  212. seg[0].data = begin;
  213. seg[0].len = ottery_rand_range (end - begin - 1) + 1;
  214. seg[1].data = begin + seg[0].len;
  215. seg[1].len = (end - begin) - seg[0].len;
  216. t1 = rspamd_get_ticks ();
  217. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  218. t2 = rspamd_get_ticks ();
  219. check_result (key, nonce, mac, begin, end);
  220. msg_info ("random 2 chunks encryption: %.6f", t2 - t1);
  221. /* 3 specific chunks */
  222. seg[0].data = begin;
  223. seg[0].len = 2;
  224. seg[1].data = begin + seg[0].len;
  225. seg[1].len = 2049;
  226. seg[2].data = begin + seg[0].len + seg[1].len;
  227. seg[2].len = (end - begin) - seg[0].len - seg[1].len;
  228. t1 = rspamd_get_ticks ();
  229. rspamd_cryptobox_encryptv_nm_inplace (seg, 3, nonce, key, mac);
  230. t2 = rspamd_get_ticks ();
  231. check_result (key, nonce, mac, begin, end);
  232. msg_info ("small, medium and large chunks encryption: %.6f", t2 - t1);
  233. cnt = create_random_split (seg, max_seg, begin, end);
  234. t1 = rspamd_get_ticks ();
  235. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  236. t2 = rspamd_get_ticks ();
  237. check_result (key, nonce, mac, begin, end);
  238. msg_info ("random split of %d chunks encryption: %.6f", cnt, t2 - t1);
  239. cnt = create_realistic_split (seg, max_seg, begin, end);
  240. t1 = rspamd_get_ticks ();
  241. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  242. t2 = rspamd_get_ticks ();
  243. check_result (key, nonce, mac, begin, end);
  244. msg_info ("realistic split of %d chunks encryption: %.6f", cnt, t2 - t1);
  245. cnt = create_constrainted_split (seg, max_seg + 1, 32, begin, end);
  246. t1 = rspamd_get_ticks ();
  247. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  248. t2 = rspamd_get_ticks ();
  249. check_result (key, nonce, mac, begin, end);
  250. msg_info ("constrainted split of %d chunks encryption: %.6f", cnt, t2 - t1);
  251. for (i = 0; i < random_fuzz_cnt; i ++) {
  252. ms = ottery_rand_range (i % max_seg * 2) + 1;
  253. cnt = create_random_split (seg, ms, begin, end);
  254. t1 = rspamd_get_ticks ();
  255. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  256. t2 = rspamd_get_ticks ();
  257. check_result (key, nonce, mac, begin, end);
  258. if (i % 1000 == 0) {
  259. msg_info ("random fuzz iterations: %d", i);
  260. }
  261. }
  262. for (i = 0; i < random_fuzz_cnt; i ++) {
  263. ms = ottery_rand_range (i % max_seg * 2) + 1;
  264. cnt = create_realistic_split (seg, ms, begin, end);
  265. t1 = rspamd_get_ticks ();
  266. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  267. t2 = rspamd_get_ticks ();
  268. check_result (key, nonce, mac, begin, end);
  269. if (i % 1000 == 0) {
  270. msg_info ("realistic fuzz iterations: %d", i);
  271. }
  272. }
  273. for (i = 0; i < random_fuzz_cnt; i ++) {
  274. ms = ottery_rand_range (i % max_seg * 10) + 1;
  275. cnt = create_constrainted_split (seg, ms, i, begin, end);
  276. t1 = rspamd_get_ticks ();
  277. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  278. t2 = rspamd_get_ticks ();
  279. check_result (key, nonce, mac, begin, end);
  280. if (i % 1000 == 0) {
  281. msg_info ("constrainted fuzz iterations: %d", i);
  282. }
  283. }
  284. if (!checked_openssl && rspamd_cryptobox_openssl_mode (TRUE)) {
  285. checked_openssl = TRUE;
  286. goto start;
  287. }
  288. }