ansi_cprng.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417
  1. /*
  2. * PRNG: Pseudo Random Number Generator
  3. * Based on NIST Recommended PRNG From ANSI X9.31 Appendix A.2.4 using
  4. * AES 128 cipher
  5. *
  6. * (C) Neil Horman <nhorman@tuxdriver.com>
  7. *
  8. * This program is free software; you can redistribute it and/or modify it
  9. * under the terms of the GNU General Public License as published by the
  10. * Free Software Foundation; either version 2 of the License, or (at your
  11. * any later version.
  12. *
  13. *
  14. */
  15. #include <crypto/internal/rng.h>
  16. #include <linux/err.h>
  17. #include <linux/init.h>
  18. #include <linux/module.h>
  19. #include <linux/moduleparam.h>
  20. #include <linux/string.h>
  21. #include "internal.h"
  22. #define DEFAULT_PRNG_KEY "0123456789abcdef"
  23. #define DEFAULT_PRNG_KSZ 16
  24. #define DEFAULT_BLK_SZ 16
  25. #define DEFAULT_V_SEED "zaybxcwdveuftgsh"
  26. /*
  27. * Flags for the prng_context flags field
  28. */
  29. #define PRNG_FIXED_SIZE 0x1
  30. #define PRNG_NEED_RESET 0x2
  31. /*
  32. * Note: DT is our counter value
  33. * I is our intermediate value
  34. * V is our seed vector
  35. * See http://csrc.nist.gov/groups/STM/cavp/documents/rng/931rngext.pdf
  36. * for implementation details
  37. */
  38. struct prng_context {
  39. spinlock_t prng_lock;
  40. unsigned char rand_data[DEFAULT_BLK_SZ];
  41. unsigned char last_rand_data[DEFAULT_BLK_SZ];
  42. unsigned char DT[DEFAULT_BLK_SZ];
  43. unsigned char I[DEFAULT_BLK_SZ];
  44. unsigned char V[DEFAULT_BLK_SZ];
  45. u32 rand_data_valid;
  46. struct crypto_cipher *tfm;
  47. u32 flags;
  48. };
  49. static int dbg;
  50. static void hexdump(char *note, unsigned char *buf, unsigned int len)
  51. {
  52. if (dbg) {
  53. printk(KERN_CRIT "%s", note);
  54. print_hex_dump(KERN_CONT, "", DUMP_PREFIX_OFFSET,
  55. 16, 1,
  56. buf, len, false);
  57. }
  58. }
  59. #define dbgprint(format, args...) do {\
  60. if (dbg)\
  61. printk(format, ##args);\
  62. } while (0)
  63. static void xor_vectors(unsigned char *in1, unsigned char *in2,
  64. unsigned char *out, unsigned int size)
  65. {
  66. int i;
  67. for (i = 0; i < size; i++)
  68. out[i] = in1[i] ^ in2[i];
  69. }
  70. /*
  71. * Returns DEFAULT_BLK_SZ bytes of random data per call
  72. * returns 0 if generation succeded, <0 if something went wrong
  73. */
  74. static int _get_more_prng_bytes(struct prng_context *ctx)
  75. {
  76. int i;
  77. unsigned char tmp[DEFAULT_BLK_SZ];
  78. unsigned char *output = NULL;
  79. dbgprint(KERN_CRIT "Calling _get_more_prng_bytes for context %p\n",
  80. ctx);
  81. hexdump("Input DT: ", ctx->DT, DEFAULT_BLK_SZ);
  82. hexdump("Input I: ", ctx->I, DEFAULT_BLK_SZ);
  83. hexdump("Input V: ", ctx->V, DEFAULT_BLK_SZ);
  84. /*
  85. * This algorithm is a 3 stage state machine
  86. */
  87. for (i = 0; i < 3; i++) {
  88. switch (i) {
  89. case 0:
  90. /*
  91. * Start by encrypting the counter value
  92. * This gives us an intermediate value I
  93. */
  94. memcpy(tmp, ctx->DT, DEFAULT_BLK_SZ);
  95. output = ctx->I;
  96. hexdump("tmp stage 0: ", tmp, DEFAULT_BLK_SZ);
  97. break;
  98. case 1:
  99. /*
  100. * Next xor I with our secret vector V
  101. * encrypt that result to obtain our
  102. * pseudo random data which we output
  103. */
  104. xor_vectors(ctx->I, ctx->V, tmp, DEFAULT_BLK_SZ);
  105. hexdump("tmp stage 1: ", tmp, DEFAULT_BLK_SZ);
  106. output = ctx->rand_data;
  107. break;
  108. case 2:
  109. /*
  110. * First check that we didn't produce the same
  111. * random data that we did last time around through this
  112. */
  113. if (!memcmp(ctx->rand_data, ctx->last_rand_data,
  114. DEFAULT_BLK_SZ)) {
  115. printk(KERN_ERR
  116. "ctx %p Failed repetition check!\n",
  117. ctx);
  118. ctx->flags |= PRNG_NEED_RESET;
  119. return -EINVAL;
  120. }
  121. memcpy(ctx->last_rand_data, ctx->rand_data,
  122. DEFAULT_BLK_SZ);
  123. /*
  124. * Lastly xor the random data with I
  125. * and encrypt that to obtain a new secret vector V
  126. */
  127. xor_vectors(ctx->rand_data, ctx->I, tmp,
  128. DEFAULT_BLK_SZ);
  129. output = ctx->V;
  130. hexdump("tmp stage 2: ", tmp, DEFAULT_BLK_SZ);
  131. break;
  132. }
  133. /* do the encryption */
  134. crypto_cipher_encrypt_one(ctx->tfm, output, tmp);
  135. }
  136. /*
  137. * Now update our DT value
  138. */
  139. for (i = 0; i < DEFAULT_BLK_SZ; i++) {
  140. ctx->DT[i] += 1;
  141. if (ctx->DT[i] != 0)
  142. break;
  143. }
  144. dbgprint("Returning new block for context %p\n", ctx);
  145. ctx->rand_data_valid = 0;
  146. hexdump("Output DT: ", ctx->DT, DEFAULT_BLK_SZ);
  147. hexdump("Output I: ", ctx->I, DEFAULT_BLK_SZ);
  148. hexdump("Output V: ", ctx->V, DEFAULT_BLK_SZ);
  149. hexdump("New Random Data: ", ctx->rand_data, DEFAULT_BLK_SZ);
  150. return 0;
  151. }
  152. /* Our exported functions */
  153. static int get_prng_bytes(char *buf, size_t nbytes, struct prng_context *ctx)
  154. {
  155. unsigned long flags;
  156. unsigned char *ptr = buf;
  157. unsigned int byte_count = (unsigned int)nbytes;
  158. int err;
  159. if (nbytes < 0)
  160. return -EINVAL;
  161. spin_lock_irqsave(&ctx->prng_lock, flags);
  162. err = -EINVAL;
  163. if (ctx->flags & PRNG_NEED_RESET)
  164. goto done;
  165. /*
  166. * If the FIXED_SIZE flag is on, only return whole blocks of
  167. * pseudo random data
  168. */
  169. err = -EINVAL;
  170. if (ctx->flags & PRNG_FIXED_SIZE) {
  171. if (nbytes < DEFAULT_BLK_SZ)
  172. goto done;
  173. byte_count = DEFAULT_BLK_SZ;
  174. }
  175. err = byte_count;
  176. dbgprint(KERN_CRIT "getting %d random bytes for context %p\n",
  177. byte_count, ctx);
  178. remainder:
  179. if (ctx->rand_data_valid == DEFAULT_BLK_SZ) {
  180. if (_get_more_prng_bytes(ctx) < 0) {
  181. memset(buf, 0, nbytes);
  182. err = -EINVAL;
  183. goto done;
  184. }
  185. }
  186. /*
  187. * Copy up to the next whole block size
  188. */
  189. if (byte_count < DEFAULT_BLK_SZ) {
  190. for (; ctx->rand_data_valid < DEFAULT_BLK_SZ;
  191. ctx->rand_data_valid++) {
  192. *ptr = ctx->rand_data[ctx->rand_data_valid];
  193. ptr++;
  194. byte_count--;
  195. if (byte_count == 0)
  196. goto done;
  197. }
  198. }
  199. /*
  200. * Now copy whole blocks
  201. */
  202. for (; byte_count >= DEFAULT_BLK_SZ; byte_count -= DEFAULT_BLK_SZ) {
  203. if (_get_more_prng_bytes(ctx) < 0) {
  204. memset(buf, 0, nbytes);
  205. err = -EINVAL;
  206. goto done;
  207. }
  208. memcpy(ptr, ctx->rand_data, DEFAULT_BLK_SZ);
  209. ctx->rand_data_valid += DEFAULT_BLK_SZ;
  210. ptr += DEFAULT_BLK_SZ;
  211. }
  212. /*
  213. * Now copy any extra partial data
  214. */
  215. if (byte_count)
  216. goto remainder;
  217. done:
  218. spin_unlock_irqrestore(&ctx->prng_lock, flags);
  219. dbgprint(KERN_CRIT "returning %d from get_prng_bytes in context %p\n",
  220. err, ctx);
  221. return err;
  222. }
  223. static void free_prng_context(struct prng_context *ctx)
  224. {
  225. crypto_free_cipher(ctx->tfm);
  226. }
  227. static int reset_prng_context(struct prng_context *ctx,
  228. unsigned char *key, size_t klen,
  229. unsigned char *V, unsigned char *DT)
  230. {
  231. int ret;
  232. int rc = -EINVAL;
  233. unsigned char *prng_key;
  234. spin_lock(&ctx->prng_lock);
  235. ctx->flags |= PRNG_NEED_RESET;
  236. prng_key = (key != NULL) ? key : (unsigned char *)DEFAULT_PRNG_KEY;
  237. if (!key)
  238. klen = DEFAULT_PRNG_KSZ;
  239. if (V)
  240. memcpy(ctx->V, V, DEFAULT_BLK_SZ);
  241. else
  242. memcpy(ctx->V, DEFAULT_V_SEED, DEFAULT_BLK_SZ);
  243. if (DT)
  244. memcpy(ctx->DT, DT, DEFAULT_BLK_SZ);
  245. else
  246. memset(ctx->DT, 0, DEFAULT_BLK_SZ);
  247. memset(ctx->rand_data, 0, DEFAULT_BLK_SZ);
  248. memset(ctx->last_rand_data, 0, DEFAULT_BLK_SZ);
  249. if (ctx->tfm)
  250. crypto_free_cipher(ctx->tfm);
  251. ctx->tfm = crypto_alloc_cipher("aes", 0, 0);
  252. if (IS_ERR(ctx->tfm)) {
  253. dbgprint(KERN_CRIT "Failed to alloc tfm for context %p\n",
  254. ctx);
  255. ctx->tfm = NULL;
  256. goto out;
  257. }
  258. ctx->rand_data_valid = DEFAULT_BLK_SZ;
  259. ret = crypto_cipher_setkey(ctx->tfm, prng_key, klen);
  260. if (ret) {
  261. dbgprint(KERN_CRIT "PRNG: setkey() failed flags=%x\n",
  262. crypto_cipher_get_flags(ctx->tfm));
  263. crypto_free_cipher(ctx->tfm);
  264. goto out;
  265. }
  266. rc = 0;
  267. ctx->flags &= ~PRNG_NEED_RESET;
  268. out:
  269. spin_unlock(&ctx->prng_lock);
  270. return rc;
  271. }
  272. static int cprng_init(struct crypto_tfm *tfm)
  273. {
  274. struct prng_context *ctx = crypto_tfm_ctx(tfm);
  275. spin_lock_init(&ctx->prng_lock);
  276. return reset_prng_context(ctx, NULL, DEFAULT_PRNG_KSZ, NULL, NULL);
  277. }
  278. static void cprng_exit(struct crypto_tfm *tfm)
  279. {
  280. free_prng_context(crypto_tfm_ctx(tfm));
  281. }
  282. static int cprng_get_random(struct crypto_rng *tfm, u8 *rdata,
  283. unsigned int dlen)
  284. {
  285. struct prng_context *prng = crypto_rng_ctx(tfm);
  286. return get_prng_bytes(rdata, dlen, prng);
  287. }
  288. static int cprng_reset(struct crypto_rng *tfm, u8 *seed, unsigned int slen)
  289. {
  290. struct prng_context *prng = crypto_rng_ctx(tfm);
  291. u8 *key = seed + DEFAULT_PRNG_KSZ;
  292. if (slen < DEFAULT_PRNG_KSZ + DEFAULT_BLK_SZ)
  293. return -EINVAL;
  294. reset_prng_context(prng, key, DEFAULT_PRNG_KSZ, seed, NULL);
  295. if (prng->flags & PRNG_NEED_RESET)
  296. return -EINVAL;
  297. return 0;
  298. }
  299. static struct crypto_alg rng_alg = {
  300. .cra_name = "stdrng",
  301. .cra_driver_name = "ansi_cprng",
  302. .cra_priority = 100,
  303. .cra_flags = CRYPTO_ALG_TYPE_RNG,
  304. .cra_ctxsize = sizeof(struct prng_context),
  305. .cra_type = &crypto_rng_type,
  306. .cra_module = THIS_MODULE,
  307. .cra_list = LIST_HEAD_INIT(rng_alg.cra_list),
  308. .cra_init = cprng_init,
  309. .cra_exit = cprng_exit,
  310. .cra_u = {
  311. .rng = {
  312. .rng_make_random = cprng_get_random,
  313. .rng_reset = cprng_reset,
  314. .seedsize = DEFAULT_PRNG_KSZ + DEFAULT_BLK_SZ,
  315. }
  316. }
  317. };
  318. /* Module initalization */
  319. static int __init prng_mod_init(void)
  320. {
  321. int ret = 0;
  322. if (fips_enabled)
  323. rng_alg.cra_priority += 200;
  324. ret = crypto_register_alg(&rng_alg);
  325. if (ret)
  326. goto out;
  327. out:
  328. return 0;
  329. }
  330. static void __exit prng_mod_fini(void)
  331. {
  332. crypto_unregister_alg(&rng_alg);
  333. return;
  334. }
  335. MODULE_LICENSE("GPL");
  336. MODULE_DESCRIPTION("Software Pseudo Random Number Generator");
  337. MODULE_AUTHOR("Neil Horman <nhorman@tuxdriver.com>");
  338. module_param(dbg, int, 0);
  339. MODULE_PARM_DESC(dbg, "Boolean to enable debugging (0/1 == off/on)");
  340. module_init(prng_mod_init);
  341. module_exit(prng_mod_fini);
  342. MODULE_ALIAS("stdrng");