1e5b75505Sopenharmony_ci/*
2e5b75505Sopenharmony_ci * SHA1 hash implementation and interface functions
3e5b75505Sopenharmony_ci * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi>
4e5b75505Sopenharmony_ci *
5e5b75505Sopenharmony_ci * This software may be distributed under the terms of the BSD license.
6e5b75505Sopenharmony_ci * See README for more details.
7e5b75505Sopenharmony_ci */
8e5b75505Sopenharmony_ci
9e5b75505Sopenharmony_ci#include "includes.h"
10e5b75505Sopenharmony_ci
11e5b75505Sopenharmony_ci#include "common.h"
12e5b75505Sopenharmony_ci#include "sha1.h"
13e5b75505Sopenharmony_ci#include "crypto.h"
14e5b75505Sopenharmony_ci
15e5b75505Sopenharmony_ci
16e5b75505Sopenharmony_ci/**
17e5b75505Sopenharmony_ci * hmac_sha1_vector - HMAC-SHA1 over data vector (RFC 2104)
18e5b75505Sopenharmony_ci * @key: Key for HMAC operations
19e5b75505Sopenharmony_ci * @key_len: Length of the key in bytes
20e5b75505Sopenharmony_ci * @num_elem: Number of elements in the data vector
21e5b75505Sopenharmony_ci * @addr: Pointers to the data areas
22e5b75505Sopenharmony_ci * @len: Lengths of the data blocks
23e5b75505Sopenharmony_ci * @mac: Buffer for the hash (20 bytes)
24e5b75505Sopenharmony_ci * Returns: 0 on success, -1 on failure
25e5b75505Sopenharmony_ci */
26e5b75505Sopenharmony_ciint hmac_sha1_vector(const u8 *key, size_t key_len, size_t num_elem,
27e5b75505Sopenharmony_ci		     const u8 *addr[], const size_t *len, u8 *mac)
28e5b75505Sopenharmony_ci{
29e5b75505Sopenharmony_ci	unsigned char k_pad[64]; /* padding - key XORd with ipad/opad */
30e5b75505Sopenharmony_ci	unsigned char tk[20];
31e5b75505Sopenharmony_ci	const u8 *_addr[6];
32e5b75505Sopenharmony_ci	size_t _len[6], i;
33e5b75505Sopenharmony_ci	int ret;
34e5b75505Sopenharmony_ci
35e5b75505Sopenharmony_ci	if (num_elem > 5) {
36e5b75505Sopenharmony_ci		/*
37e5b75505Sopenharmony_ci		 * Fixed limit on the number of fragments to avoid having to
38e5b75505Sopenharmony_ci		 * allocate memory (which could fail).
39e5b75505Sopenharmony_ci		 */
40e5b75505Sopenharmony_ci		return -1;
41e5b75505Sopenharmony_ci	}
42e5b75505Sopenharmony_ci
43e5b75505Sopenharmony_ci        /* if key is longer than 64 bytes reset it to key = SHA1(key) */
44e5b75505Sopenharmony_ci        if (key_len > 64) {
45e5b75505Sopenharmony_ci		if (sha1_vector(1, &key, &key_len, tk))
46e5b75505Sopenharmony_ci			return -1;
47e5b75505Sopenharmony_ci		key = tk;
48e5b75505Sopenharmony_ci		key_len = 20;
49e5b75505Sopenharmony_ci        }
50e5b75505Sopenharmony_ci
51e5b75505Sopenharmony_ci	/* the HMAC_SHA1 transform looks like:
52e5b75505Sopenharmony_ci	 *
53e5b75505Sopenharmony_ci	 * SHA1(K XOR opad, SHA1(K XOR ipad, text))
54e5b75505Sopenharmony_ci	 *
55e5b75505Sopenharmony_ci	 * where K is an n byte key
56e5b75505Sopenharmony_ci	 * ipad is the byte 0x36 repeated 64 times
57e5b75505Sopenharmony_ci	 * opad is the byte 0x5c repeated 64 times
58e5b75505Sopenharmony_ci	 * and text is the data being protected */
59e5b75505Sopenharmony_ci
60e5b75505Sopenharmony_ci	/* start out by storing key in ipad */
61e5b75505Sopenharmony_ci	os_memset(k_pad, 0, sizeof(k_pad));
62e5b75505Sopenharmony_ci	os_memcpy(k_pad, key, key_len);
63e5b75505Sopenharmony_ci	/* XOR key with ipad values */
64e5b75505Sopenharmony_ci	for (i = 0; i < 64; i++)
65e5b75505Sopenharmony_ci		k_pad[i] ^= 0x36;
66e5b75505Sopenharmony_ci
67e5b75505Sopenharmony_ci	/* perform inner SHA1 */
68e5b75505Sopenharmony_ci	_addr[0] = k_pad;
69e5b75505Sopenharmony_ci	_len[0] = 64;
70e5b75505Sopenharmony_ci	for (i = 0; i < num_elem; i++) {
71e5b75505Sopenharmony_ci		_addr[i + 1] = addr[i];
72e5b75505Sopenharmony_ci		_len[i + 1] = len[i];
73e5b75505Sopenharmony_ci	}
74e5b75505Sopenharmony_ci	if (sha1_vector(1 + num_elem, _addr, _len, mac))
75e5b75505Sopenharmony_ci		return -1;
76e5b75505Sopenharmony_ci
77e5b75505Sopenharmony_ci	os_memset(k_pad, 0, sizeof(k_pad));
78e5b75505Sopenharmony_ci	os_memcpy(k_pad, key, key_len);
79e5b75505Sopenharmony_ci	/* XOR key with opad values */
80e5b75505Sopenharmony_ci	for (i = 0; i < 64; i++)
81e5b75505Sopenharmony_ci		k_pad[i] ^= 0x5c;
82e5b75505Sopenharmony_ci
83e5b75505Sopenharmony_ci	/* perform outer SHA1 */
84e5b75505Sopenharmony_ci	_addr[0] = k_pad;
85e5b75505Sopenharmony_ci	_len[0] = 64;
86e5b75505Sopenharmony_ci	_addr[1] = mac;
87e5b75505Sopenharmony_ci	_len[1] = SHA1_MAC_LEN;
88e5b75505Sopenharmony_ci	ret = sha1_vector(2, _addr, _len, mac);
89e5b75505Sopenharmony_ci	forced_memzero(k_pad, sizeof(k_pad));
90e5b75505Sopenharmony_ci	forced_memzero(tk, sizeof(tk));
91e5b75505Sopenharmony_ci	return ret;
92e5b75505Sopenharmony_ci}
93e5b75505Sopenharmony_ci
94e5b75505Sopenharmony_ci
95e5b75505Sopenharmony_ci/**
96e5b75505Sopenharmony_ci * hmac_sha1 - HMAC-SHA1 over data buffer (RFC 2104)
97e5b75505Sopenharmony_ci * @key: Key for HMAC operations
98e5b75505Sopenharmony_ci * @key_len: Length of the key in bytes
99e5b75505Sopenharmony_ci * @data: Pointers to the data area
100e5b75505Sopenharmony_ci * @data_len: Length of the data area
101e5b75505Sopenharmony_ci * @mac: Buffer for the hash (20 bytes)
102e5b75505Sopenharmony_ci * Returns: 0 on success, -1 of failure
103e5b75505Sopenharmony_ci */
104e5b75505Sopenharmony_ciint hmac_sha1(const u8 *key, size_t key_len, const u8 *data, size_t data_len,
105e5b75505Sopenharmony_ci	       u8 *mac)
106e5b75505Sopenharmony_ci{
107e5b75505Sopenharmony_ci	return hmac_sha1_vector(key, key_len, 1, &data, &data_len, mac);
108e5b75505Sopenharmony_ci}
109