modtrezorcrypto: cleanup random

This commit is contained in:
Pavol Rusnak 2017-12-15 16:56:08 +01:00
parent 1a32e46e5d
commit be302480fd
No known key found for this signature in database
GPG Key ID: 91F3B339B9A02A3D
8 changed files with 38 additions and 53 deletions

View File

@ -223,6 +223,7 @@ SOURCE_UNIX = [
'vendor/micropython/ports/unix/alloc.c',
'embed/unix/common.c',
'embed/unix/flash.c',
'embed/unix/rng.c',
'embed/unix/sdcard.c',
'embed/unix/sbu.c',
'embed/unix/touch.c',

View File

@ -43,13 +43,23 @@ STATIC MP_DEFINE_CONST_FUN_OBJ_1(mod_trezorcrypto_random_bytes_obj, mod_trezorcr
/// Shuffles items of given list (in-place).
/// '''
STATIC mp_obj_t mod_trezorcrypto_random_shuffle(mp_obj_t data) {
size_t item_cnt;
size_t count;
mp_obj_t *items;
mp_obj_get_array(data, &item_cnt, &items);
if (item_cnt > 256) {
mp_obj_get_array(data, &count, &items);
if (count > 256) {
mp_raise_ValueError("Maximum list size is 256 items");
}
random_permute(items, sizeof(mp_obj_t *), item_cnt);
if (count <= 1) {
return mp_const_none;
}
// Fisher-Yates shuffle
mp_obj_t t;
for (size_t i = count - 1; i >= 1; i--) {
size_t j = random_uniform(i + 1);
t = items[i];
items[i] = items[j];
items[j] = t;
}
return mp_const_none;
}
STATIC MP_DEFINE_CONST_FUN_OBJ_1(mod_trezorcrypto_random_shuffle_obj, mod_trezorcrypto_random_shuffle);

View File

@ -5,32 +5,12 @@
* see LICENSE file for details
*/
#include <string.h>
#include "rand.h"
#ifdef UNIX
#include <stdio.h>
#include <assert.h>
static FILE *frand = NULL;
#else
uint32_t rng_get(void);
#endif
#include "rng.h"
uint32_t random32(void)
{
#ifdef UNIX
uint32_t r;
size_t len = sizeof(r);
if (!frand) {
frand = fopen("/dev/urandom", "r");
}
size_t len_read = fread(&r, 1, len, frand);
(void)len_read;
assert(len_read == len);
return r;
#else
return rng_get();
#endif
}
uint32_t random_uniform(uint32_t n)
@ -42,36 +22,11 @@ uint32_t random_uniform(uint32_t n)
void random_buffer(uint8_t *buf, size_t len)
{
#ifdef UNIX
if (!frand) {
frand = fopen("/dev/urandom", "r");
}
size_t len_read = fread(buf, 1, len, frand);
(void)len_read;
assert(len_read == len);
#else
size_t i;
uint32_t r = 0;
for (i = 0; i < len; i++) {
for (size_t i = 0; i < len; i++) {
if (i % 4 == 0) {
r = random32();
}
buf[i] = (r >> ((i % 4) * 8)) & 0xFF;
}
#endif
}
void random_permute(void *buf, size_t size, size_t count)
{
if (count < 1 || size < 1) {
return;
}
uint8_t *d = (uint8_t *)buf;
uint8_t t[size];
for (size_t i = count - 1; i >= 1; i--) {
size_t j = random_uniform(i + 1);
memcpy(t, d + j * size, size);
memcpy(d + j * size, d + i * size, size);
memcpy(d + i * size, t, size);
}
}

View File

@ -14,6 +14,5 @@
uint32_t random32(void);
uint32_t random_uniform(uint32_t n);
void random_buffer(uint8_t *buf, size_t len);
void random_permute(void *buf, size_t size, size_t count);
#endif

View File

@ -1,5 +1,7 @@
#include "rng.h"
#include STM32_HAL_H
#pragma GCC optimize("no-stack-protector") // applies to all functions in this file
void rng_init(void)

View File

@ -1,7 +1,7 @@
#ifndef TREZORHAL_RNG_H
#define TREZORHAL_RNG_H
#include STM32_HAL_H
#include <stdint.h>
void rng_init(void);
uint32_t rng_read(const uint32_t previous, const uint32_t compare_previous);

17
embed/unix/rng.c Normal file
View File

@ -0,0 +1,17 @@
#include <stdio.h>
#include <stdlib.h>
#include "common.h"
#include "rng.h"
uint32_t rng_get(void)
{
static FILE *frand = NULL;
if (!frand) {
frand = fopen("/dev/urandom", "r");
}
ensure(sectrue * (frand != NULL), "fopen failed");
uint32_t r;
ensure(sectrue * (sizeof(r) == fread(&r, 1, sizeof(r), frand)), "fread failed");
return r;
}

1
embed/unix/rng.h Symbolic link
View File

@ -0,0 +1 @@
../trezorhal/rng.h