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 8.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332
  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. static const int mapping_size = 64 * 8192 + 1;
  31. static const int max_seg = 32;
  32. static const int random_fuzz_cnt = 10000;
  33. static void *
  34. create_mapping (int mapping_len, guchar **beg, guchar **end)
  35. {
  36. void *map;
  37. int psize = getpagesize ();
  38. map = mmap (NULL, mapping_len + psize * 3, PROT_READ|PROT_WRITE,
  39. MAP_ANON|MAP_SHARED, -1, 0);
  40. g_assert (map != 0);
  41. memset (map, 0, mapping_len + psize * 3);
  42. mprotect (map, psize, PROT_NONE);
  43. /* Misalign pointer */
  44. *beg = ((guchar *)map) + psize + 1;
  45. *end = *beg + mapping_len;
  46. mprotect (*beg + mapping_len - 1 + psize, psize, PROT_NONE);
  47. return map;
  48. }
  49. static void
  50. check_result (const rspamd_nm_t key, const rspamd_nonce_t nonce,
  51. const rspamd_sig_t mac, guchar *begin, guchar *end)
  52. {
  53. guint64 *t = (guint64 *)begin;
  54. g_assert (rspamd_cryptobox_decrypt_nm_inplace (begin, end - begin, nonce, key,
  55. mac));
  56. while (t < (guint64 *)end) {
  57. g_assert (*t == 0);
  58. t ++;
  59. }
  60. }
  61. static int
  62. create_random_split (struct rspamd_cryptobox_segment *seg, int mseg,
  63. guchar *begin, guchar *end)
  64. {
  65. gsize remain = end - begin;
  66. gint used = 0;
  67. while (remain > 0 && used < mseg - 1) {
  68. seg->data = begin;
  69. seg->len = ottery_rand_range (remain - 1) + 1;
  70. begin += seg->len;
  71. remain -= seg->len;
  72. used ++;
  73. seg ++;
  74. }
  75. if (remain > 0) {
  76. seg->data = begin;
  77. seg->len = remain;
  78. used ++;
  79. }
  80. return used;
  81. }
  82. static int
  83. create_realistic_split (struct rspamd_cryptobox_segment *seg, int mseg,
  84. guchar *begin, guchar *end)
  85. {
  86. gsize remain = end - begin;
  87. gint used = 0;
  88. static const int small_seg = 512, medium_seg = 2048;
  89. while (remain > 0 && used < mseg - 1) {
  90. seg->data = begin;
  91. if (ottery_rand_uint32 () % 2 == 0) {
  92. seg->len = ottery_rand_range (small_seg) + 1;
  93. }
  94. else {
  95. seg->len = ottery_rand_range (medium_seg) +
  96. small_seg;
  97. }
  98. if (seg->len > remain) {
  99. seg->len = remain;
  100. }
  101. begin += seg->len;
  102. remain -= seg->len;
  103. used ++;
  104. seg ++;
  105. }
  106. if (remain > 0) {
  107. seg->data = begin;
  108. seg->len = remain;
  109. used ++;
  110. }
  111. return used;
  112. }
  113. static int
  114. create_constrainted_split (struct rspamd_cryptobox_segment *seg, int mseg,
  115. int constraint,
  116. guchar *begin, guchar *end)
  117. {
  118. gsize remain = end - begin;
  119. gint used = 0;
  120. while (remain > 0 && used < mseg - 1) {
  121. seg->data = begin;
  122. seg->len = constraint;
  123. if (seg->len > remain) {
  124. seg->len = remain;
  125. }
  126. begin += seg->len;
  127. remain -= seg->len;
  128. used ++;
  129. seg ++;
  130. }
  131. if (remain > 0) {
  132. seg->data = begin;
  133. seg->len = remain;
  134. used ++;
  135. }
  136. return used;
  137. }
  138. void
  139. rspamd_cryptobox_test_func (void)
  140. {
  141. void *map;
  142. guchar *begin, *end;
  143. rspamd_nm_t key;
  144. rspamd_nonce_t nonce;
  145. rspamd_sig_t mac;
  146. struct rspamd_cryptobox_segment *seg;
  147. double t1, t2;
  148. gint i, cnt, ms;
  149. map = create_mapping (mapping_size, &begin, &end);
  150. ottery_rand_bytes (key, sizeof (key));
  151. ottery_rand_bytes (nonce, sizeof (nonce));
  152. memset (mac, 0, sizeof (mac));
  153. seg = g_slice_alloc0 (sizeof (*seg) * max_seg * 10);
  154. /* Test baseline */
  155. t1 = rspamd_get_ticks ();
  156. rspamd_cryptobox_encrypt_nm_inplace (begin, end - begin, nonce, key, mac);
  157. t2 = rspamd_get_ticks ();
  158. check_result (key, nonce, mac, begin, end);
  159. msg_info ("baseline encryption: %.6f", t2 - t1);
  160. /* A single chunk as vector */
  161. seg[0].data = begin;
  162. seg[0].len = end - begin;
  163. t1 = rspamd_get_ticks ();
  164. rspamd_cryptobox_encryptv_nm_inplace (seg, 1, nonce, key, mac);
  165. t2 = rspamd_get_ticks ();
  166. check_result (key, nonce, mac, begin, end);
  167. msg_info ("bulk encryption: %.6f", t2 - t1);
  168. /* Two chunks as vector */
  169. seg[0].data = begin;
  170. seg[0].len = (end - begin) / 2;
  171. seg[1].data = begin + seg[0].len;
  172. seg[1].len = (end - begin) - seg[0].len;
  173. t1 = rspamd_get_ticks ();
  174. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  175. t2 = rspamd_get_ticks ();
  176. check_result (key, nonce, mac, begin, end);
  177. msg_info ("2 equal chunks encryption: %.6f", t2 - t1);
  178. seg[0].data = begin;
  179. seg[0].len = 1;
  180. seg[1].data = begin + seg[0].len;
  181. seg[1].len = (end - begin) - seg[0].len;
  182. t1 = rspamd_get_ticks ();
  183. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  184. t2 = rspamd_get_ticks ();
  185. check_result (key, nonce, mac, begin, end);
  186. msg_info ("small and large chunks encryption: %.6f", t2 - t1);
  187. seg[0].data = begin;
  188. seg[0].len = (end - begin) - 3;
  189. seg[1].data = begin + seg[0].len;
  190. seg[1].len = (end - begin) - seg[0].len;
  191. t1 = rspamd_get_ticks ();
  192. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  193. t2 = rspamd_get_ticks ();
  194. check_result (key, nonce, mac, begin, end);
  195. msg_info ("large and small chunks encryption: %.6f", t2 - t1);
  196. /* Random two chunks as vector */
  197. seg[0].data = begin;
  198. seg[0].len = ottery_rand_range (end - begin - 1) + 1;
  199. seg[1].data = begin + seg[0].len;
  200. seg[1].len = (end - begin) - seg[0].len;
  201. t1 = rspamd_get_ticks ();
  202. rspamd_cryptobox_encryptv_nm_inplace (seg, 2, nonce, key, mac);
  203. t2 = rspamd_get_ticks ();
  204. check_result (key, nonce, mac, begin, end);
  205. msg_info ("random 2 chunks encryption: %.6f", t2 - t1);
  206. /* 3 specific chunks */
  207. seg[0].data = begin;
  208. seg[0].len = 2;
  209. seg[1].data = begin + seg[0].len;
  210. seg[1].len = 2049;
  211. seg[2].data = begin + seg[0].len + seg[1].len;
  212. seg[2].len = (end - begin) - seg[0].len - seg[1].len;
  213. t1 = rspamd_get_ticks ();
  214. rspamd_cryptobox_encryptv_nm_inplace (seg, 3, nonce, key, mac);
  215. t2 = rspamd_get_ticks ();
  216. check_result (key, nonce, mac, begin, end);
  217. msg_info ("small, medium and large chunks encryption: %.6f", t2 - t1);
  218. cnt = create_random_split (seg, max_seg, begin, end);
  219. t1 = rspamd_get_ticks ();
  220. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  221. t2 = rspamd_get_ticks ();
  222. check_result (key, nonce, mac, begin, end);
  223. msg_info ("random split of %d chunks encryption: %.6f", cnt, t2 - t1);
  224. cnt = create_realistic_split (seg, max_seg, begin, end);
  225. t1 = rspamd_get_ticks ();
  226. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  227. t2 = rspamd_get_ticks ();
  228. check_result (key, nonce, mac, begin, end);
  229. msg_info ("realistic split of %d chunks encryption: %.6f", cnt, t2 - t1);
  230. cnt = create_constrainted_split (seg, max_seg + 1, 32, begin, end);
  231. t1 = rspamd_get_ticks ();
  232. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  233. t2 = rspamd_get_ticks ();
  234. check_result (key, nonce, mac, begin, end);
  235. msg_info ("constrainted split of %d chunks encryption: %.6f", cnt, t2 - t1);
  236. for (i = 0; i < random_fuzz_cnt; i ++) {
  237. ms = ottery_rand_range (i % max_seg * 2) + 1;
  238. cnt = create_random_split (seg, ms, begin, end);
  239. t1 = rspamd_get_ticks ();
  240. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  241. t2 = rspamd_get_ticks ();
  242. check_result (key, nonce, mac, begin, end);
  243. if (i % 1000 == 0) {
  244. msg_info ("random fuzz iterations: %d", i);
  245. }
  246. }
  247. for (i = 0; i < random_fuzz_cnt; i ++) {
  248. ms = ottery_rand_range (i % max_seg * 2) + 1;
  249. cnt = create_realistic_split (seg, ms, begin, end);
  250. t1 = rspamd_get_ticks ();
  251. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  252. t2 = rspamd_get_ticks ();
  253. check_result (key, nonce, mac, begin, end);
  254. if (i % 1000 == 0) {
  255. msg_info ("realistic fuzz iterations: %d", i);
  256. }
  257. }
  258. for (i = 0; i < random_fuzz_cnt; i ++) {
  259. ms = ottery_rand_range (i % max_seg * 10) + 1;
  260. cnt = create_constrainted_split (seg, ms, i, begin, end);
  261. t1 = rspamd_get_ticks ();
  262. rspamd_cryptobox_encryptv_nm_inplace (seg, cnt, nonce, key, mac);
  263. t2 = rspamd_get_ticks ();
  264. check_result (key, nonce, mac, begin, end);
  265. if (i % 1000 == 0) {
  266. msg_info ("constrainted fuzz iterations: %d", i);
  267. }
  268. }
  269. }