xref: /freebsd/sys/dev/random/hash.c (revision 13ea0450a9c8742119d36f3bf8f47accdce46e54)
1 /*-
2  * Copyright (c) 2000-2015 Mark R V Murray
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
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer
10  *    in this position and unchanged.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  *
15  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25  *
26  */
27 
28 #include <sys/cdefs.h>
29 __FBSDID("$FreeBSD$");
30 
31 #ifdef _KERNEL
32 #include <sys/param.h>
33 #include <sys/systm.h>
34 #else /* !_KERNEL */
35 #include <sys/param.h>
36 #include <sys/types.h>
37 #include <inttypes.h>
38 #include <stdio.h>
39 #include <stdlib.h>
40 #include <string.h>
41 #include <threads.h>
42 #include "unit_test.h"
43 #endif /* _KERNEL */
44 
45 #include <crypto/rijndael/rijndael-api-fst.h>
46 #include <crypto/sha2/sha256.h>
47 
48 #include <dev/random/hash.h>
49 
50 /* This code presumes that RANDOM_KEYSIZE is twice as large as RANDOM_BLOCKSIZE */
51 CTASSERT(RANDOM_KEYSIZE == 2*RANDOM_BLOCKSIZE);
52 
53 /* Initialise the hash */
54 void
55 randomdev_hash_init(struct randomdev_hash *context)
56 {
57 
58 	SHA256_Init(&context->sha);
59 }
60 
61 /* Iterate the hash */
62 void
63 randomdev_hash_iterate(struct randomdev_hash *context, const void *data, size_t size)
64 {
65 
66 	SHA256_Update(&context->sha, data, size);
67 }
68 
69 /* Conclude by returning the hash in the supplied <*buf> which must be
70  * RANDOM_KEYSIZE bytes long.
71  */
72 void
73 randomdev_hash_finish(struct randomdev_hash *context, void *buf)
74 {
75 
76 	SHA256_Final(buf, &context->sha);
77 }
78 
79 /* Initialise the encryption routine by setting up the key schedule
80  * from the supplied <*data> which must be RANDOM_KEYSIZE bytes of binary
81  * data.
82  */
83 void
84 randomdev_encrypt_init(struct randomdev_key *context, const void *data)
85 {
86 
87 	rijndael_cipherInit(&context->cipher, MODE_ECB, NULL);
88 	rijndael_makeKey(&context->key, DIR_ENCRYPT, RANDOM_KEYSIZE*8, data);
89 }
90 
91 /*
92  * Create a psuedorandom output stream of 'blockcount' blocks using a CTR-mode
93  * cipher or similar.  The 128-bit counter is supplied in the in-out parmeter
94  * 'ctr.'  The output stream goes to 'd_out.'  'blockcount' RANDOM_BLOCKSIZE
95  * bytes are generated.
96  */
97 void
98 randomdev_keystream(struct randomdev_key *context, uint128_t *ctr,
99     void *d_out, u_int blockcount)
100 {
101 	u_int i;
102 
103 	for (i = 0; i < blockcount; i++) {
104 		/*-
105 		 * FS&K - r = r|E(K,C)
106 		 *      - C = C + 1
107 		 */
108 		rijndael_blockEncrypt(&context->cipher, &context->key,
109 		    (void *)ctr, RANDOM_BLOCKSIZE * 8, d_out);
110 		d_out = (char *)d_out + RANDOM_BLOCKSIZE;
111 		uint128_increment(ctr);
112 	}
113 }
114