forked from briansmith/ring
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpoly1305.rs
376 lines (324 loc) · 12 KB
/
poly1305.rs
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
// Copyright 2015-2016 Brian Smith.
// Portions Copyright (c) 2014, 2015, Google Inc.
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
// WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
// MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
// SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
// WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
// OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
// CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
// TODO: enforce maximum input length.
// Work around compiler bug?
#![allow(non_shorthand_field_patterns)]
use {c, chacha, constant_time, error, polyfill};
use core;
// The assembly functions we call expect the state to be 8-byte aligned. We do
// this manually, by copying the data into an aligned slice, rather than by
// asking the compiler to align the `Opaque` struct.
fn with_aligned<F>(opaque: &mut Opaque, f: F)
where F: FnOnce(&mut Opaque)
{
let mut buf = [0u8; OPAQUE_LEN + 7];
let aligned_start = (buf.as_ptr() as usize + 7) & !7;
let offset = aligned_start - (buf.as_ptr() as usize);
let aligned_buf =
slice_as_array_ref_mut!(
&mut buf[offset..(offset + OPAQUE_LEN)], OPAQUE_LEN).unwrap();
aligned_buf.copy_from_slice(&opaque[..]);
f(aligned_buf);
opaque.copy_from_slice(aligned_buf);
}
impl SigningContext {
#[inline]
pub fn from_key(key: Key) -> SigningContext {
#[inline]
fn read_u32(buf: &[u8]) -> u32 {
polyfill::slice::u32_from_le_u8(slice_as_array_ref!(buf, 4).unwrap())
}
let (key, nonce) = key.bytes.split_at(16);
let key = slice_as_array_ref!(key, 16).unwrap();
let mut ctx = SigningContext {
opaque: [0u8; OPAQUE_LEN],
// TODO: When we can get explicit alignment, make `nonce` an
// aligned `u8[16]` and get rid of this `u8[16]` -> `u32[4]`
// conversion.
nonce: [
read_u32(&nonce[0..4]),
read_u32(&nonce[4..8]),
read_u32(&nonce[8..12]),
read_u32(&nonce[12..16]),
],
buf: [0; BLOCK_LEN],
buf_used: 0,
func: Funcs {
blocks_fn: GFp_poly1305_blocks,
emit_fn: GFp_poly1305_emit
}
};
{ // borrow ctx
let &mut SigningContext {
opaque: ref mut opaque,
func: ref mut func,
..
} = &mut ctx;
with_aligned(opaque, |opaque| {
// On some platforms `init()` doesn't initialize `funcs`. The
// return value of `init()` indicates whether it did or not. Since
// we already gave `func` a default value above, we can ignore the
// return value assuming `init()` doesn't change `func` if it chose
// not to initialize it. Note that this is different than what
// BoringSSL does.
let _ = init(opaque, key, func);
});
}
ctx
}
pub fn update(&mut self, mut input: &[u8]) {
let &mut SigningContext {
opaque: ref mut opaque,
buf: ref mut buf,
buf_used: ref mut buf_used,
func: ref func,
..
} = self;
with_aligned(opaque, |opaque: &mut Opaque| {
if *buf_used != 0 {
let todo = core::cmp::min(input.len(), BLOCK_LEN - *buf_used);
buf[*buf_used..(*buf_used + todo)].copy_from_slice(
&input[..todo]);
*buf_used += todo;
input = &input[todo..];
if *buf_used == BLOCK_LEN {
func.blocks(opaque, buf, Pad::Pad);
*buf_used = 0;
}
}
if input.len() >= BLOCK_LEN {
let todo = input.len() & !(BLOCK_LEN - 1);
let (complete_blocks, remainder) = input.split_at(todo);
func.blocks(opaque, complete_blocks, Pad::Pad);
input = remainder;
}
if input.len() != 0 {
buf[..input.len()].copy_from_slice(input);
*buf_used = input.len();
}
});
}
pub fn sign(mut self, tag_out: &mut Tag) {
let &mut SigningContext {
opaque: ref mut opaque,
nonce: ref nonce,
buf: ref mut buf,
buf_used: buf_used,
func: ref func,
} = &mut self;
with_aligned(opaque, |opaque| {
if buf_used != 0 {
buf[buf_used] = 1;
for byte in &mut buf[(buf_used + 1)..] {
*byte = 0;
}
func.blocks(opaque, &buf[..], Pad::AlreadyPadded);
}
func.emit(opaque, tag_out, nonce);
});
}
}
pub fn verify(key: Key, msg: &[u8], tag: &Tag)
-> Result<(), error::Unspecified> {
let mut calculated_tag = [0u8; TAG_LEN];
sign(key, msg, &mut calculated_tag);
constant_time::verify_slices_are_equal(&calculated_tag[..], tag)
}
pub fn sign(key: Key, msg: &[u8], tag: &mut Tag) {
let mut ctx = SigningContext::from_key(key);
ctx.update(msg);
ctx.sign(tag)
}
#[cfg(test)]
pub fn check_state_layout() {
let required_state_size =
if cfg!(target_arch = "x86") {
// See comment above `_poly1305_init_sse2` in poly1305-x86.pl.
Some(4 * (5 + 1 + 4 + 2 + 4 * 9))
} else if cfg!(target_arch = "x86_64") {
// See comment above `__poly1305_block` in poly1305-x86_64.pl.
Some(4 * (5 + 1 + 2 * 2 + 2 + 4 * 9))
} else {
// TODO(davidben): Figure out the layout of the struct. For now,
// `OPAQUE_LEN` is taken from OpenSSL.
None
};
if let Some(required_state_size) = required_state_size {
assert!(core::mem::size_of::<Opaque>() >= required_state_size);
}
}
/// A Poly1305 key.
pub struct Key {
bytes: KeyAndNonceBytes,
}
impl Key {
pub fn derive_using_chacha(chacha20_key: &chacha::Key,
counter: &chacha::Counter) -> Key {
let mut bytes = [0u8; KEY_LEN];
chacha::chacha20_xor_in_place(chacha20_key, counter, &mut bytes);
Key { bytes: bytes }
}
#[cfg(test)]
pub fn from_test_vector(bytes: &[u8; KEY_LEN]) -> Key {
Key { bytes: *bytes }
}
}
type KeyAndNonceBytes = [u8; 2 * BLOCK_LEN];
type KeyBytes = [u8; BLOCK_LEN];
type Nonce = [u32; BLOCK_LEN / 4];
/// The length of a `key`.
pub const KEY_LEN: usize = 32;
/// A Poly1305 tag.
pub type Tag = [u8; TAG_LEN];
/// The length of a `Tag`.
pub const TAG_LEN: usize = BLOCK_LEN;
const BLOCK_LEN: usize = 16;
/// The memory manipulated by the assembly.
type Opaque = [u8; OPAQUE_LEN];
const OPAQUE_LEN: usize = 192;
#[repr(C)]
struct Funcs {
blocks_fn: unsafe extern fn(&mut Opaque, input: *const u8,
input_len: c::size_t, should_pad: Pad),
emit_fn: unsafe extern fn(&mut Opaque, &mut Tag, nonce: &Nonce),
}
#[inline]
fn init(state: &mut Opaque, key: &KeyBytes, func: &mut Funcs) -> i32 {
debug_assert_eq!(state.as_ptr() as usize % 8, 0);
unsafe {
GFp_poly1305_init_asm(state, key, func)
}
}
#[repr(u32)]
enum Pad {
AlreadyPadded = 0,
Pad = 1,
}
impl Funcs {
#[inline]
fn blocks(&self, state: &mut Opaque, data: &[u8], should_pad: Pad) {
debug_assert_eq!(state.as_ptr() as usize % 8, 0);
unsafe {
(self.blocks_fn)(state, data.as_ptr(), data.len(), should_pad);
}
}
#[inline]
fn emit(&self, state: &mut Opaque, tag_out: &mut Tag, nonce: &Nonce) {
debug_assert_eq!(state.as_ptr() as usize % 8, 0);
unsafe {
(self.emit_fn)(state, tag_out, nonce);
}
}
}
pub struct SigningContext {
opaque: Opaque,
nonce: [u32; 4],
buf: [u8; BLOCK_LEN],
buf_used: usize,
func: Funcs
}
extern {
fn GFp_poly1305_init_asm(state: &mut Opaque, key: &KeyBytes,
out_func: &mut Funcs) -> c::int;
fn GFp_poly1305_blocks(state: &mut Opaque, input: *const u8, len: c::size_t,
should_pad: Pad);
fn GFp_poly1305_emit(state: &mut Opaque, mac: &mut Tag, nonce: &Nonce);
}
#[cfg(test)]
mod tests {
use {error, test};
use core;
use super::*;
#[test]
pub fn test_state_layout() {
check_state_layout();
}
// Adapted from BoringSSL's crypto/poly1305/poly1305_test.cc.
#[test]
pub fn test_poly1305() {
test::from_file("src/poly1305_test.txt", |section, test_case| {
assert_eq!(section, "");
let key = test_case.consume_bytes("Key");
let key = slice_as_array_ref!(&key, KEY_LEN).unwrap();
let input = test_case.consume_bytes("Input");
let expected_mac = test_case.consume_bytes("MAC");
let expected_mac =
slice_as_array_ref!(&expected_mac, TAG_LEN).unwrap();
// Test single-shot operation.
{
let key = Key::from_test_vector(&key);
let mut ctx = SigningContext::from_key(key);
ctx.update(&input);
let mut actual_mac = [0; TAG_LEN];
ctx.sign(&mut actual_mac);
assert_eq!(&expected_mac[..], &actual_mac[..]);
}
{
let key = Key::from_test_vector(&key);
let mut actual_mac = [0; TAG_LEN];
sign(key, &input, &mut actual_mac);
assert_eq!(&expected_mac[..], &actual_mac[..]);
}
{
let key = Key::from_test_vector(&key);
assert_eq!(Ok(()), verify(key, &input, &expected_mac));
}
// Test streaming byte-by-byte.
{
let key = Key::from_test_vector(&key);
let mut ctx = SigningContext::from_key(key);
for chunk in input.chunks(1) {
ctx.update(chunk);
}
let mut actual_mac = [0u8; TAG_LEN];
ctx.sign(&mut actual_mac);
assert_eq!(&expected_mac[..], &actual_mac[..]);
}
try!(test_poly1305_simd(0, key, &input, expected_mac));
try!(test_poly1305_simd(16, key, &input, expected_mac));
try!(test_poly1305_simd(32, key, &input, expected_mac));
try!(test_poly1305_simd(48, key, &input, expected_mac));
Ok(())
})
}
fn test_poly1305_simd(excess: usize, key: &[u8; KEY_LEN], input: &[u8],
expected_mac: &[u8; TAG_LEN])
-> Result<(), error::Unspecified> {
let key = Key::from_test_vector(&key);
let mut ctx = SigningContext::from_key(key);
// Some implementations begin in non-SIMD mode and upgrade on demand.
// Stress the upgrade path.
let init = core::cmp::min(input.len(), 16);
ctx.update(&input[..init]);
let long_chunk_len = 128 + excess;
for chunk in input[init..].chunks(long_chunk_len + excess) {
if chunk.len() > long_chunk_len {
let (long, short) = chunk.split_at(long_chunk_len);
// Feed 128 + |excess| bytes to test SIMD mode.
ctx.update(long);
// Feed |excess| bytes to ensure SIMD mode can handle short
// inputs.
ctx.update(short);
} else {
// Handle the last chunk.
ctx.update(chunk);
}
}
let mut actual_mac = [0u8; TAG_LEN];
ctx.sign(&mut actual_mac);
assert_eq!(&expected_mac[..], &actual_mac);
Ok(())
}
}