1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* Copyright (C) 2005-2006 Martin Willi
* Copyright (C) 2005 Jan Hutter
* Hochschule fuer Technik Rapperswil
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*/
#include <string.h>
#include "prf_plus.h"
typedef struct private_prf_plus_t private_prf_plus_t;
/**
* Private data of an prf_plus_t object.
*
*/
struct private_prf_plus_t {
/**
* Public interface of prf_plus_t.
*/
prf_plus_t public;
/**
* PRF to use.
*/
prf_t *prf;
/**
* Initial seed.
*/
chunk_t seed;
/**
* Octet which will be appended to the seed, 0 if not used
*/
u_int8_t counter;
/**
* Already given out bytes in current buffer.
*/
size_t used;
/**
* Buffer to store current PRF result.
*/
chunk_t buffer;
};
METHOD(prf_plus_t, get_bytes, bool,
private_prf_plus_t *this, size_t length, u_int8_t *buffer)
{
size_t round, written = 0;
while (length > 0)
{
if (this->buffer.len == this->used)
{ /* buffer used, get next round */
if (!this->prf->get_bytes(this->prf, this->buffer, NULL))
{
return FALSE;
}
if (this->counter)
{
if (!this->prf->get_bytes(this->prf, this->seed, NULL) ||
!this->prf->get_bytes(this->prf,
chunk_from_thing(this->counter), this->buffer.ptr))
{
return FALSE;
}
this->counter++;
}
else
{
if (!this->prf->get_bytes(this->prf, this->seed,
this->buffer.ptr))
{
return FALSE;
}
}
this->used = 0;
}
round = min(length, this->buffer.len - this->used);
memcpy(buffer + written, this->buffer.ptr + this->used, round);
length -= round;
this->used += round;
written += round;
}
return TRUE;
}
METHOD(prf_plus_t, allocate_bytes, bool,
private_prf_plus_t *this, size_t length, chunk_t *chunk)
{
if (length)
{
*chunk = chunk_alloc(length);
return get_bytes(this, length, chunk->ptr);
}
*chunk = chunk_empty;
return TRUE;
}
METHOD(prf_plus_t, destroy, void,
private_prf_plus_t *this)
{
free(this->buffer.ptr);
free(this->seed.ptr);
free(this);
}
/*
* Description in header.
*/
prf_plus_t *prf_plus_create(prf_t *prf, bool counter, chunk_t seed)
{
private_prf_plus_t *this;
INIT(this,
.public = {
.get_bytes = _get_bytes,
.allocate_bytes = _allocate_bytes,
.destroy = _destroy,
},
.prf = prf,
.seed = chunk_clone(seed),
.buffer = chunk_alloc(prf->get_block_size(prf)),
);
if (counter)
{
this->counter = 0x01;
if (!this->prf->get_bytes(this->prf, this->seed, NULL) ||
!this->prf->get_bytes(this->prf, chunk_from_thing(this->counter),
this->buffer.ptr))
{
destroy(this);
return NULL;
}
this->counter++;
}
else
{
if (!this->prf->get_bytes(this->prf, this->seed, this->buffer.ptr))
{
destroy(this);
return NULL;
}
}
return &this->public;
}
|
