first idea of RSA (PKCS#1 v1.5)
This commit is contained in:
parent
52867acc0c
commit
3edc70ba3f
|
@ -1,790 +0,0 @@
|
|||
/* bigint.c */
|
||||
/*
|
||||
This file is part of the ARM-Crypto-Lib.
|
||||
Copyright (C) 2008 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
/**
|
||||
* \file bigint.c
|
||||
* \author Daniel Otte
|
||||
* \date 2010-02-22
|
||||
*
|
||||
* \license GPLv3 or later
|
||||
*
|
||||
*/
|
||||
|
||||
|
||||
#define STRING2(x) #x
|
||||
#define STRING(x) STRING2(x)
|
||||
#define STR_LINE STRING(__LINE__)
|
||||
|
||||
#include "bigint.h"
|
||||
#include <string.h>
|
||||
/*
|
||||
#include "cli.h"
|
||||
#include "bigint_io.h"
|
||||
*/
|
||||
#ifndef MAX
|
||||
#define MAX(a,b) (((a)>(b))?(a):(b))
|
||||
#endif
|
||||
|
||||
#ifndef MIN
|
||||
#define MIN(a,b) (((a)<(b))?(a):(b))
|
||||
#endif
|
||||
|
||||
#define SET_FBS(a, v) do{(a)->info &=0xF8; (a)->info |= (v);}while(0)
|
||||
#define GET_FBS(a) ((a)->info&BIGINT_FBS_MASK)
|
||||
#define SET_NEG(a) (a)->info |= BIGINT_NEG_MASK
|
||||
#define SET_POS(a) (a)->info &= ~BIGINT_NEG_MASK
|
||||
#define XCHG(a,b) do{(a)^=(b); (b)^=(a); (a)^=(b);}while(0)
|
||||
#define XCHG_PTR(a,b) do{ a = (void*)(((uint16_t)(a)) ^ ((uint16_t)(b))); \
|
||||
b = (void*)(((uint16_t)(a)) ^ ((uint16_t)(b))); \
|
||||
a = (void*)(((uint16_t)(a)) ^ ((uint16_t)(b)));}while(0)
|
||||
|
||||
#define GET_SIGN(a) ((a)->info&BIGINT_NEG_MASK)
|
||||
|
||||
|
||||
/******************************************************************************/
|
||||
/*
|
||||
void bigint_copy(bigint_t* dest, const bigint_t* src){
|
||||
memcpy(dest->wordv, src->wordv, src->length_B);
|
||||
dest->length_B = src->length_B;
|
||||
dest->info = src->info;
|
||||
}
|
||||
*/
|
||||
/******************************************************************************/
|
||||
|
||||
/* this should be implemented in assembly */
|
||||
/*
|
||||
void bigint_add_u(bigint_t* dest, const bigint_t* a, const bigint_t* b){
|
||||
uint16_t t=0, i;
|
||||
if(a->length_B < b->length_B){
|
||||
XCHG_PTR(a,b);
|
||||
}
|
||||
for(i=0; i<b->length_B; ++i){
|
||||
t = a->wordv[i] + b->wordv[i] + t;
|
||||
dest->wordv[i] = (uint8_t)t;
|
||||
t>>=8;
|
||||
}
|
||||
for(; i<a->length_B; ++i){
|
||||
t = a->wordv[i] + t;
|
||||
dest->wordv[i] = (uint8_t)t;
|
||||
t>>=8;
|
||||
}
|
||||
dest->wordv[i++] = t;
|
||||
dest->length_B = i;
|
||||
bigint_adjust(dest);
|
||||
}
|
||||
*/
|
||||
/******************************************************************************/
|
||||
|
||||
/* this should be implemented in assembly */
|
||||
void bigint_add_scale_u(bigint_t* dest, const bigint_t* a, uint16_t scale){
|
||||
uint16_t i,j=0;
|
||||
uint16_t t=0;
|
||||
if(scale>dest->length_B)
|
||||
memset(dest->wordv+dest->length_B, 0, scale-dest->length_B);
|
||||
for(i=scale; i<a->length_B+scale; ++i,++j){
|
||||
t = a->wordv[j] + t;
|
||||
if(dest->length_B>i){
|
||||
t += dest->wordv[i];
|
||||
}
|
||||
dest->wordv[i] = (uint8_t)t;
|
||||
t>>=8;
|
||||
}
|
||||
while(t){
|
||||
if(dest->length_B>i){
|
||||
t = dest->wordv[i] + t;
|
||||
}
|
||||
dest->wordv[i] = (uint8_t)t;
|
||||
t>>=8;
|
||||
++i;
|
||||
}
|
||||
if(dest->length_B < i){
|
||||
dest->length_B = i;
|
||||
}
|
||||
bigint_adjust(dest);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
/* this should be implemented in assembly */
|
||||
void bigint_sub_u(bigint_t* dest, const bigint_t* a, const bigint_t* b){
|
||||
int8_t borrow=0;
|
||||
int8_t r;
|
||||
int16_t t;
|
||||
uint16_t i, min, max;
|
||||
min = MIN(a->length_B, b->length_B);
|
||||
max = MAX(a->length_B, b->length_B);
|
||||
r = bigint_cmp_u(a,b);
|
||||
if(r==0){
|
||||
dest->length_B = 0;
|
||||
dest->wordv[0] = 0;
|
||||
bigint_adjust(dest);
|
||||
return;
|
||||
}
|
||||
if(b->length_B==0){
|
||||
dest->length_B = a->length_B;
|
||||
memcpy(dest->wordv, a->wordv, a->length_B);
|
||||
dest->info = a->info;
|
||||
SET_POS(dest);
|
||||
return;
|
||||
}
|
||||
if(a->length_B==0){
|
||||
dest->length_B = b->length_B;
|
||||
memcpy(dest->wordv, b->wordv, b->length_B);
|
||||
dest->info = b->info;
|
||||
SET_NEG(dest);
|
||||
return;
|
||||
}
|
||||
if(r<0){
|
||||
bigint_sub_u(dest, b, a);
|
||||
SET_NEG(dest);
|
||||
}else{
|
||||
for(i=0; i<min; ++i){
|
||||
t = a->wordv[i] - b->wordv[i] - borrow;
|
||||
if(t<0){
|
||||
borrow = 1;
|
||||
dest->wordv[i]=(uint8_t)t;
|
||||
}else{
|
||||
borrow = 0;
|
||||
dest->wordv[i]=(uint8_t)t;
|
||||
}
|
||||
}
|
||||
for(;i<max; ++i){
|
||||
t = a->wordv[i] - borrow;
|
||||
if(t<0){
|
||||
borrow = 1;
|
||||
dest->wordv[i]=(uint8_t)t;
|
||||
}else{
|
||||
borrow = 0;
|
||||
dest->wordv[i]=(uint8_t)t;
|
||||
}
|
||||
|
||||
}
|
||||
SET_POS(dest);
|
||||
dest->length_B = i;
|
||||
bigint_adjust(dest);
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
int8_t bigint_cmp_u(const bigint_t* a, const bigint_t* b){
|
||||
if(a->length_B > b->length_B){
|
||||
return 1;
|
||||
}
|
||||
if(a->length_B < b->length_B){
|
||||
return -1;
|
||||
}
|
||||
if(a->length_B==0){
|
||||
return 0;
|
||||
}
|
||||
uint16_t i;
|
||||
i = a->length_B-1;
|
||||
do{
|
||||
if(a->wordv[i]!=b->wordv[i]){
|
||||
if(a->wordv[i]>b->wordv[i]){
|
||||
return 1;
|
||||
}else{
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
}while(i--);
|
||||
return 0;
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_add_s(bigint_t* dest, const bigint_t* a, const bigint_t* b){
|
||||
uint8_t s;
|
||||
s = GET_SIGN(a)?2:0;
|
||||
s |= GET_SIGN(b)?1:0;
|
||||
switch(s){
|
||||
case 0: /* both positive */
|
||||
bigint_add_u(dest, a,b);
|
||||
SET_POS(dest);
|
||||
break;
|
||||
case 1: /* a positive, b negative */
|
||||
bigint_sub_u(dest, a, b);
|
||||
break;
|
||||
case 2: /* a negative, b positive */
|
||||
bigint_sub_u(dest, b, a);
|
||||
break;
|
||||
case 3: /* both negative */
|
||||
bigint_add_u(dest, a, b);
|
||||
SET_NEG(dest);
|
||||
break;
|
||||
default: /* how can this happen?*/
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_sub_s(bigint_t* dest, const bigint_t* a, const bigint_t* b){
|
||||
uint8_t s;
|
||||
s = GET_SIGN(a)?2:0;
|
||||
s |= GET_SIGN(b)?1:0;
|
||||
switch(s){
|
||||
case 0: /* both positive */
|
||||
bigint_sub_u(dest, a,b);
|
||||
break;
|
||||
case 1: /* a positive, b negative */
|
||||
bigint_add_u(dest, a, b);
|
||||
SET_POS(dest);
|
||||
break;
|
||||
case 2: /* a negative, b positive */
|
||||
bigint_add_u(dest, a, b);
|
||||
SET_NEG(dest);
|
||||
break;
|
||||
case 3: /* both negative */
|
||||
bigint_sub_u(dest, b, a);
|
||||
break;
|
||||
default: /* how can this happen?*/
|
||||
break;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
int8_t bigint_cmp_s(const bigint_t* a, const bigint_t* b){
|
||||
uint8_t s;
|
||||
if(a->length_B==0 && b->length_B==0){
|
||||
return 0;
|
||||
}
|
||||
s = GET_SIGN(a)?2:0;
|
||||
s |= GET_SIGN(b)?1:0;
|
||||
switch(s){
|
||||
case 0: /* both positive */
|
||||
return bigint_cmp_u(a, b);
|
||||
break;
|
||||
case 1: /* a positive, b negative */
|
||||
return 1;
|
||||
break;
|
||||
case 2: /* a negative, b positive */
|
||||
return -1;
|
||||
break;
|
||||
case 3: /* both negative */
|
||||
return bigint_cmp_u(b, a);
|
||||
break;
|
||||
default: /* how can this happen?*/
|
||||
break;
|
||||
}
|
||||
return 0; /* just to satisfy the compiler */
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_shiftleft(bigint_t* a, uint16_t shift){
|
||||
uint16_t byteshift;
|
||||
uint16_t i;
|
||||
uint8_t bitshift;
|
||||
uint16_t t=0;
|
||||
byteshift = (shift+3)/8;
|
||||
bitshift = shift&7;
|
||||
memmove(a->wordv+byteshift, a->wordv, a->length_B);
|
||||
memset(a->wordv, 0, byteshift);
|
||||
if(bitshift!=0){
|
||||
if(bitshift<=4){ /* shift to the left */
|
||||
for(i=byteshift; i<a->length_B+byteshift; ++i){
|
||||
t |= (a->wordv[i])<<bitshift;
|
||||
a->wordv[i] = (uint8_t)t;
|
||||
t >>= 8;
|
||||
}
|
||||
a->wordv[i] = (uint8_t)t;
|
||||
byteshift++;
|
||||
}else{ /* shift to the right */
|
||||
for(i=a->length_B+byteshift-1; i>byteshift-1; --i){
|
||||
t |= (a->wordv[i])<<(bitshift);
|
||||
a->wordv[i] = (uint8_t)(t>>8);
|
||||
t <<= 8;
|
||||
}
|
||||
t |= (a->wordv[i])<<(bitshift);
|
||||
a->wordv[i] = (uint8_t)(t>>8);
|
||||
}
|
||||
}
|
||||
a->length_B += byteshift;
|
||||
bigint_adjust(a);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_shiftright(bigint_t* a, uint16_t shift){
|
||||
uint16_t byteshift;
|
||||
uint16_t i;
|
||||
uint8_t bitshift;
|
||||
uint16_t t=0;
|
||||
byteshift = shift/8;
|
||||
bitshift = shift&7;
|
||||
if(byteshift >= a->length_B){ /* we would shift out more than we have */
|
||||
bigint_set_zero(a);
|
||||
return;
|
||||
}
|
||||
if(byteshift == a->length_B-1 && bitshift>GET_FBS(a)){
|
||||
bigint_set_zero(a);
|
||||
return;
|
||||
}
|
||||
if(byteshift){
|
||||
memmove(a->wordv, a->wordv+byteshift, a->length_B-byteshift);
|
||||
memset(a->wordv+a->length_B-byteshift, 0, byteshift);
|
||||
}
|
||||
if(bitshift!=0){
|
||||
/* shift to the right */
|
||||
for(i=a->length_B-byteshift-1; i>0; --i){
|
||||
t |= (a->wordv[i])<<(8-bitshift);
|
||||
a->wordv[i] = (uint8_t)(t>>8);
|
||||
t <<= 8;
|
||||
}
|
||||
t |= (a->wordv[0])<<(8-bitshift);
|
||||
a->wordv[0] = (uint8_t)(t>>8);
|
||||
}
|
||||
a->length_B -= byteshift;
|
||||
bigint_adjust(a);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_xor(bigint_t* dest, const bigint_t* a){
|
||||
uint16_t i;
|
||||
for(i=0; i<a->length_B; ++i){
|
||||
dest->wordv[i] ^= a->wordv[i];
|
||||
}
|
||||
bigint_adjust(dest);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_set_zero(bigint_t* a){
|
||||
a->length_B=0;
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
/* using the Karatsuba-Algorithm */
|
||||
/* x*y = (xh*yh)*b**2n + ((xh+xl)*(yh+yl) - xh*yh - xl*yl)*b**n + yh*yl */
|
||||
void bigint_mul_u(bigint_t* dest, const bigint_t* a, const bigint_t* b){
|
||||
if(a->length_B==0 || b->length_B==0){
|
||||
bigint_set_zero(dest);
|
||||
return;
|
||||
}
|
||||
if(dest==a || dest==b){
|
||||
bigint_t d;
|
||||
uint8_t d_b[a->length_B+b->length_B];
|
||||
d.wordv = d_b;
|
||||
bigint_mul_u(&d, a, b);
|
||||
bigint_copy(dest, &d);
|
||||
return;
|
||||
}
|
||||
if(a->length_B==1 || b->length_B==1){
|
||||
if(a->length_B!=1){
|
||||
XCHG_PTR(a,b);
|
||||
}
|
||||
uint16_t i, t=0;
|
||||
uint8_t x = a->wordv[0];
|
||||
for(i=0; i<b->length_B; ++i){
|
||||
t += b->wordv[i]*x;
|
||||
dest->wordv[i] = (uint8_t)t;
|
||||
t>>=8;
|
||||
}
|
||||
dest->wordv[i] = (uint8_t)t;
|
||||
dest->length_B=i+1;
|
||||
bigint_adjust(dest);
|
||||
return;
|
||||
}
|
||||
if(a->length_B<=4 && b->length_B<=4){
|
||||
uint32_t p=0, q=0;
|
||||
uint64_t r;
|
||||
memcpy(&p, a->wordv, a->length_B);
|
||||
memcpy(&q, b->wordv, b->length_B);
|
||||
r = (uint64_t)p*(uint64_t)q;
|
||||
memcpy(dest->wordv, &r, a->length_B+b->length_B);
|
||||
dest->length_B = a->length_B+b->length_B;
|
||||
bigint_adjust(dest);
|
||||
return;
|
||||
}
|
||||
bigint_set_zero(dest);
|
||||
/* split a in xh & xl; split b in yh & yl */
|
||||
uint16_t n;
|
||||
n=(MAX(a->length_B, b->length_B)+1)/2;
|
||||
bigint_t xl, xh, yl, yh;
|
||||
xl.wordv = a->wordv;
|
||||
yl.wordv = b->wordv;
|
||||
if(a->length_B<=n){
|
||||
xh.info=0;
|
||||
xh.length_B = 0;
|
||||
xl.length_B = a->length_B;
|
||||
xl.info = 0;
|
||||
}else{
|
||||
xl.length_B=n;
|
||||
xl.info = 0;
|
||||
bigint_adjust(&xl);
|
||||
xh.wordv = a->wordv+n;
|
||||
xh.length_B = a->length_B-n;
|
||||
xh.info = 0;
|
||||
}
|
||||
if(b->length_B<=n){
|
||||
yh.info=0;
|
||||
yh.length_B = 0;
|
||||
yl.length_B = b->length_B;
|
||||
yl.info = b->info;
|
||||
}else{
|
||||
yl.length_B=n;
|
||||
yl.info = 0;
|
||||
bigint_adjust(&yl);
|
||||
yh.wordv = b->wordv+n;
|
||||
yh.length_B = b->length_B-n;
|
||||
yh.info = 0;
|
||||
}
|
||||
/* now we have split up a and b */
|
||||
uint8_t tmp_b[2*n+2], m_b[2*(n+1)];
|
||||
bigint_t tmp, tmp2, m;
|
||||
tmp.wordv = tmp_b;
|
||||
tmp2.wordv = tmp_b+n+1;
|
||||
m.wordv = m_b;
|
||||
|
||||
bigint_mul_u(dest, &xl, &yl); /* dest <= xl*yl */
|
||||
bigint_add_u(&tmp2, &xh, &xl); /* tmp2 <= xh+xl */
|
||||
bigint_add_u(&tmp, &yh, &yl); /* tmp <= yh+yl */
|
||||
bigint_mul_u(&m, &tmp2, &tmp); /* m <= tmp2*tmp */
|
||||
bigint_mul_u(&tmp, &xh, &yh); /* h <= xh*yh */
|
||||
bigint_sub_u(&m, &m, dest); /* m <= m-dest */
|
||||
bigint_sub_u(&m, &m, &tmp); /* m <= m-h */
|
||||
bigint_add_scale_u(dest, &m, n);
|
||||
bigint_add_scale_u(dest, &tmp, 2*n);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_mul_s(bigint_t* dest, const bigint_t* a, const bigint_t* b){
|
||||
uint8_t s;
|
||||
s = GET_SIGN(a)?2:0;
|
||||
s |= GET_SIGN(b)?1:0;
|
||||
switch(s){
|
||||
case 0: /* both positive */
|
||||
bigint_mul_u(dest, a,b);
|
||||
SET_POS(dest);
|
||||
break;
|
||||
case 1: /* a positive, b negative */
|
||||
bigint_mul_u(dest, a,b);
|
||||
SET_NEG(dest);
|
||||
break;
|
||||
case 2: /* a negative, b positive */
|
||||
bigint_mul_u(dest, a,b);
|
||||
SET_NEG(dest);
|
||||
break;
|
||||
case 3: /* both negative */
|
||||
bigint_mul_u(dest, a,b);
|
||||
SET_POS(dest);
|
||||
break;
|
||||
default: /* how can this happen?*/
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
/* square */
|
||||
/* (xh*b^n+xl)^2 = xh^2*b^2n + 2*xh*xl*b^n + xl^2 */
|
||||
void bigint_square(bigint_t* dest, const bigint_t* a){
|
||||
if(a->length_B<=4){
|
||||
uint64_t r=0;
|
||||
memcpy(&r, a->wordv, a->length_B);
|
||||
r = r*r;
|
||||
memcpy(dest->wordv, &r, 2*a->length_B);
|
||||
SET_POS(dest);
|
||||
dest->length_B=2*a->length_B;
|
||||
bigint_adjust(dest);
|
||||
return;
|
||||
}
|
||||
if(dest==a){
|
||||
bigint_t d;
|
||||
uint8_t d_b[a->length_B*2];
|
||||
d.wordv = d_b;
|
||||
bigint_square(&d, a);
|
||||
bigint_copy(dest, &d);
|
||||
return;
|
||||
}
|
||||
uint16_t n;
|
||||
n=(a->length_B+1)/2;
|
||||
bigint_t xh, xl, tmp; /* x-high, x-low, temp */
|
||||
uint8_t buffer[2*n+1];
|
||||
xl.wordv = a->wordv;
|
||||
xl.length_B = n;
|
||||
xh.wordv = a->wordv+n;
|
||||
xh.length_B = a->length_B-n;
|
||||
tmp.wordv = buffer;
|
||||
bigint_square(dest, &xl);
|
||||
bigint_square(&tmp, &xh);
|
||||
bigint_add_scale_u(dest, &tmp, 2*n);
|
||||
bigint_mul_u(&tmp, &xl, &xh);
|
||||
bigint_shiftleft(&tmp, 1);
|
||||
bigint_add_scale_u(dest, &tmp, n);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_sub_u_bitscale(bigint_t* a, const bigint_t* b, uint16_t bitscale){
|
||||
bigint_t tmp;
|
||||
uint8_t tmp_b[b->length_B+1];
|
||||
uint16_t i,j,byteshift=bitscale/8;
|
||||
uint8_t borrow=0;
|
||||
int16_t t;
|
||||
|
||||
if(a->length_B < b->length_B+byteshift){
|
||||
bigint_set_zero(a);
|
||||
return;
|
||||
}
|
||||
|
||||
tmp.wordv = tmp_b;
|
||||
bigint_copy(&tmp, b);
|
||||
bigint_shiftleft(&tmp, bitscale&7);
|
||||
|
||||
for(j=0,i=byteshift; i<tmp.length_B+byteshift; ++i, ++j){
|
||||
t = a->wordv[i] - tmp.wordv[j] - borrow;
|
||||
a->wordv[i] = (uint8_t)t;
|
||||
if(t<0){
|
||||
borrow = 1;
|
||||
}else{
|
||||
borrow = 0;
|
||||
}
|
||||
}
|
||||
while(borrow){
|
||||
if(i+1 > a->length_B){
|
||||
bigint_set_zero(a);
|
||||
return;
|
||||
}
|
||||
a->wordv[i] -= borrow;
|
||||
if(a->wordv[i]!=0xff){
|
||||
borrow=0;
|
||||
}
|
||||
++i;
|
||||
}
|
||||
bigint_adjust(a);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_reduce(bigint_t* a, const bigint_t* r){
|
||||
// bigint_adjust(r);
|
||||
uint8_t rfbs = GET_FBS(r);
|
||||
|
||||
if(r->length_B==0 || a->length_B==0){
|
||||
return;
|
||||
}
|
||||
while(a->length_B > r->length_B){
|
||||
bigint_sub_u_bitscale(a, r, (a->length_B-r->length_B)*8+GET_FBS(a)-rfbs-1);
|
||||
}
|
||||
while((GET_FBS(a) > rfbs+1) && (a->length_B == r->length_B)){
|
||||
bigint_sub_u_bitscale(a, r, GET_FBS(a)-rfbs-1);
|
||||
}
|
||||
while(bigint_cmp_u(a,r)>=0){
|
||||
bigint_sub_u(a,a,r);
|
||||
}
|
||||
bigint_adjust(a);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
/* calculate dest = a**exp % r */
|
||||
/* using square&multiply */
|
||||
void bigint_expmod_u(bigint_t* dest, const bigint_t* a, const bigint_t* exp, const bigint_t* r){
|
||||
if(a->length_B==0 || r->length_B==0){
|
||||
return;
|
||||
}
|
||||
|
||||
bigint_t res, base;
|
||||
uint8_t base_b[MAX(a->length_B,r->length_B*2)], res_b[r->length_B*2];
|
||||
uint16_t i;
|
||||
uint8_t j, t;
|
||||
res.wordv = res_b;
|
||||
base.wordv = base_b;
|
||||
bigint_copy(&base, a);
|
||||
bigint_reduce(&base, r);
|
||||
res.wordv[0]=1;
|
||||
res.length_B=1;
|
||||
res.info = 0;
|
||||
bigint_adjust(&res);
|
||||
for(i=0; i+1<exp->length_B; ++i){
|
||||
t=exp->wordv[i];
|
||||
for(j=0; j<8; ++j){
|
||||
if(t&1){
|
||||
bigint_mul_u(&res, &res, &base);
|
||||
bigint_reduce(&res, r);
|
||||
}
|
||||
bigint_square(&base, &base);
|
||||
bigint_reduce(&base, r);
|
||||
t>>=1;
|
||||
}
|
||||
}
|
||||
t=exp->wordv[i];
|
||||
while(t){
|
||||
if(t&1){
|
||||
bigint_mul_u(&res, &res, &base);
|
||||
bigint_reduce(&res, r);
|
||||
}
|
||||
bigint_square(&base, &base);
|
||||
bigint_reduce(&base, r);
|
||||
t>>=1;
|
||||
}
|
||||
SET_POS(&res);
|
||||
bigint_copy(dest, &res);
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
/* gcd <-- gcd(x,y) a*x+b*y=gcd */
|
||||
void bigint_gcdext(bigint_t* gcd, bigint_t* a, bigint_t* b, const bigint_t* x, const bigint_t* y){
|
||||
bigint_t g, x_, y_, u, v, a_, b_, c_, d_;
|
||||
volatile uint16_t i=0;
|
||||
if(x->length_B==0 || y->length_B==0){
|
||||
return;
|
||||
}
|
||||
while(x->wordv[i]==0 && y->wordv[i]==0){
|
||||
++i;
|
||||
}
|
||||
uint8_t g_b[i+2], x_b[x->length_B-i], y_b[y->length_B-i];
|
||||
uint8_t u_b[x->length_B-i], v_b[y->length_B-i];
|
||||
uint8_t a_b[y->length_B+2], c_b[y->length_B+2];
|
||||
uint8_t b_b[x->length_B+2], d_b[x->length_B+2];
|
||||
|
||||
g.wordv = g_b;
|
||||
x_.wordv = x_b;
|
||||
y_.wordv = y_b;
|
||||
memset(g_b, 0, i);
|
||||
g_b[i]=1;
|
||||
g.length_B = i+1;
|
||||
g.info=0;
|
||||
x_.info = y_.info = 0;
|
||||
x_.length_B = x->length_B-i;
|
||||
y_.length_B = y->length_B-i;
|
||||
memcpy(x_.wordv, x->wordv+i, x_.length_B);
|
||||
memcpy(y_.wordv, y->wordv+i, y_.length_B);
|
||||
for(i=0; (x_.wordv[0]&(1<<i))==0 && (y_.wordv[0]&(1<<i))==0; ++i){
|
||||
}
|
||||
|
||||
bigint_adjust(&x_);
|
||||
bigint_adjust(&y_);
|
||||
|
||||
if(i){
|
||||
bigint_shiftleft(&g, i);
|
||||
bigint_shiftright(&x_, i);
|
||||
bigint_shiftright(&y_, i);
|
||||
}
|
||||
u.wordv = u_b;
|
||||
v.wordv = v_b;
|
||||
a_.wordv = a_b;
|
||||
b_.wordv = b_b;
|
||||
c_.wordv = c_b;
|
||||
d_.wordv = d_b;
|
||||
|
||||
bigint_copy(&u, &x_);
|
||||
bigint_copy(&v, &y_);
|
||||
a_.wordv[0] = 1;
|
||||
a_.length_B = 1;
|
||||
a_.info = 0;
|
||||
d_.wordv[0] = 1;
|
||||
d_.length_B = 1;
|
||||
d_.info = 0;
|
||||
bigint_set_zero(&b_);
|
||||
bigint_set_zero(&c_);
|
||||
do{
|
||||
while((u.wordv[0]&1)==0){
|
||||
bigint_shiftright(&u, 1);
|
||||
if((a_.wordv[0]&1) || (b_.wordv[0]&1)){
|
||||
bigint_add_s(&a_, &a_, &y_);
|
||||
bigint_sub_s(&b_, &b_, &x_);
|
||||
}
|
||||
bigint_shiftright(&a_, 1);
|
||||
bigint_shiftright(&b_, 1);
|
||||
}
|
||||
while((v.wordv[0]&1)==0){
|
||||
bigint_shiftright(&v, 1);
|
||||
if((c_.wordv[0]&1) || (d_.wordv[0]&1)){
|
||||
bigint_add_s(&c_, &c_, &y_);
|
||||
bigint_sub_s(&d_, &d_, &x_);
|
||||
}
|
||||
bigint_shiftright(&c_, 1);
|
||||
bigint_shiftright(&d_, 1);
|
||||
|
||||
}
|
||||
if(bigint_cmp_u(&u, &v)>=0){
|
||||
bigint_sub_u(&u, &u, &v);
|
||||
bigint_sub_s(&a_, &a_, &c_);
|
||||
bigint_sub_s(&b_, &b_, &d_);
|
||||
}else{
|
||||
bigint_sub_u(&v, &v, &u);
|
||||
bigint_sub_s(&c_, &c_, &a_);
|
||||
bigint_sub_s(&d_, &d_, &b_);
|
||||
}
|
||||
}while(u.length_B);
|
||||
if(gcd){
|
||||
bigint_mul_s(gcd, &v, &g);
|
||||
}
|
||||
if(a){
|
||||
bigint_copy(a, &c_);
|
||||
}
|
||||
if(b){
|
||||
bigint_copy(b, &d_);
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_inverse(bigint_t* dest, const bigint_t* a, const bigint_t* m){
|
||||
bigint_gcdext(NULL, dest, NULL, a, m);
|
||||
while(dest->info&BIGINT_NEG_MASK){
|
||||
bigint_add_s(dest, dest, m);
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_changeendianess(bigint_t* a){
|
||||
uint8_t t, *p, *q;
|
||||
p = a->wordv;
|
||||
q = p+a->length_B-1;
|
||||
while(p<q){
|
||||
t = *p;
|
||||
*p = *q;
|
||||
*q = t;
|
||||
++p; --q;
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
|
@ -81,6 +81,38 @@ void bigint_adjust(bigint_t* a){
|
|||
|
||||
/******************************************************************************/
|
||||
|
||||
uint32_t bigint_get_first_set_bit(bigint_t* a){
|
||||
if(a->length_B==0){
|
||||
return (uint32_t)(-1);
|
||||
}
|
||||
return (a->length_B-1)*sizeof(bigint_word_t)*8+GET_FBS(a);
|
||||
}
|
||||
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
uint32_t bigint_get_last_set_bit(bigint_t* a){
|
||||
uint32_t r=0;
|
||||
uint8_t b=0;
|
||||
bigint_word_t x=1;
|
||||
if(a->length_B==0){
|
||||
return (uint32_t)(-1);
|
||||
}
|
||||
while(a->wordv[r]==0 && r<a->length_B){
|
||||
++r;
|
||||
}
|
||||
if(a->wordv[r] == 0){
|
||||
return (uint32_t)(-1);
|
||||
}
|
||||
while((x&a->wordv[r])==0){
|
||||
++b;
|
||||
x <<= 1;
|
||||
}
|
||||
return r*BIGINT_WORD_SIZE+b;
|
||||
}
|
||||
|
||||
/******************************************************************************/
|
||||
|
||||
void bigint_copy(bigint_t* dest, const bigint_t* src){
|
||||
memcpy(dest->wordv, src->wordv, src->length_B*sizeof(bigint_word_t));
|
||||
dest->length_B = src->length_B;
|
||||
|
@ -619,7 +651,7 @@ void bigint_sub_u_bitscale(bigint_t* a, const bigint_t* b, uint16_t bitscale){
|
|||
/******************************************************************************/
|
||||
|
||||
void bigint_reduce(bigint_t* a, const bigint_t* r){
|
||||
// bigint_adjust(r);
|
||||
// bigint_adjust((bigint_t*)r);
|
||||
uint8_t rfbs = GET_FBS(r);
|
||||
|
||||
// cli_putstr("\r\nDBG: (a) = "); bigint_print_hex(a);
|
||||
|
@ -640,6 +672,8 @@ void bigint_reduce(bigint_t* a, const bigint_t* r){
|
|||
while(a->length_B > r->length_B){
|
||||
shift = (a->length_B - r->length_B) * 8 * sizeof(bigint_word_t) + GET_FBS(a) - rfbs - 1;
|
||||
// cli_putstr("\r\nDBG: (p) shift = "); cli_hexdump_rev(&shift, 2);
|
||||
// cli_putstr(" a_len = "); cli_hexdump_rev(&a->length_B, 2);
|
||||
// cli_putstr(" r_len = "); cli_hexdump_rev(&r->length_B, 2);
|
||||
// uart_flush(0);
|
||||
bigint_sub_u_bitscale(a, r, shift);
|
||||
// cli_putstr("\r\nDBG: (1) = "); bigint_print_hex(a);
|
||||
|
@ -672,14 +706,21 @@ void bigint_expmod_u(bigint_t* dest, const bigint_t* a, const bigint_t* exp, con
|
|||
bigint_word_t t, base_b[MAX(a->length_B,r->length_B*2)], res_b[r->length_B*2];
|
||||
uint16_t i;
|
||||
uint8_t j;
|
||||
// uint16_t *xaddr = &i;
|
||||
// cli_putstr("\r\npre-alloc (");
|
||||
// cli_hexdump_rev(&xaddr, 4);
|
||||
// cli_putstr(") ...");
|
||||
res.wordv = res_b;
|
||||
base.wordv = base_b;
|
||||
bigint_copy(&base, a);
|
||||
// cli_putstr("\r\npost-copy");
|
||||
bigint_reduce(&base, r);
|
||||
res.wordv[0]=1;
|
||||
res.length_B=1;
|
||||
res.info = 0;
|
||||
// cli_putstr("\r\nadjust ");
|
||||
bigint_adjust(&res);
|
||||
// cli_putstr("\r\nexpmod ");
|
||||
for(i=0; i+1<exp->length_B; ++i){
|
||||
t=exp->wordv[i];
|
||||
for(j=0; j<BIGINT_WORD_SIZE; ++j){
|
||||
|
@ -693,6 +734,8 @@ void bigint_expmod_u(bigint_t* dest, const bigint_t* a, const bigint_t* exp, con
|
|||
}
|
||||
}
|
||||
t=exp->wordv[i];
|
||||
|
||||
// cli_putc('+');
|
||||
while(t){
|
||||
if(t&1){
|
||||
bigint_mul_u(&res, &res, &base);
|
||||
|
|
|
@ -48,6 +48,8 @@ typedef struct{
|
|||
/******************************************************************************/
|
||||
|
||||
void bigint_adjust(bigint_t* a);
|
||||
uint32_t bigint_get_first_set_bit(bigint_t* a);
|
||||
uint32_t bigint_get_last_set_bit(bigint_t* a);
|
||||
void bigint_copy(bigint_t* dest, const bigint_t* src);
|
||||
void bigint_add_u(bigint_t* dest, const bigint_t* a, const bigint_t* b);
|
||||
void bigint_add_scale_u(bigint_t* dest, const bigint_t* a, uint16_t scale);
|
||||
|
|
|
@ -0,0 +1,14 @@
|
|||
# Makefile for RSA
|
||||
ALGO_NAME := RSA
|
||||
|
||||
# comment out the following line for removement of RSA from the build process
|
||||
SIGNATURE += $(ALGO_NAME)
|
||||
|
||||
$(ALGO_NAME)_DIR := rsa/
|
||||
$(ALGO_NAME)_INCDIR := memxor/ bigint/ noekeon/
|
||||
$(ALGO_NAME)_OBJ := bigint.o bigint_io.o rsa_basic.o rsa_pkcs15.o
|
||||
$(ALGO_NAME)_TESTBIN := main-rsa-test.o $(CLI_STD) random_dummy.o \
|
||||
noekeon.o noekeon_prng.o memxor.o
|
||||
|
||||
$(ALGO_NAME)_PERFORMANCE_TEST := performance
|
||||
|
|
@ -70,9 +70,9 @@
|
|||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <crypto/hashfunction_descriptor.h>
|
||||
#include <crypto/hfal-basic.h>
|
||||
#include <crypto/hfal-hmac.h>
|
||||
#include "hashfunction_descriptor.h"
|
||||
#include "hfal-basic.h"
|
||||
#include "hfal-hmac.h"
|
||||
#include "prf_tls12.h"
|
||||
|
||||
uint8_t prf_tls12_init(prf_tls12_ctx_t* ctx, const hfdesc_t* hash,
|
||||
|
|
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
@ -0,0 +1,24 @@
|
|||
/* random_dummy.c */
|
||||
/*
|
||||
This file is part of the ARM-Crypto-Lib.
|
||||
Copyright (C) 2006-2011 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include "random_dummy.h"
|
||||
|
||||
uint8_t(*prng_get_byte)(void);
|
||||
|
|
@ -0,0 +1,27 @@
|
|||
/* random.h */
|
||||
/*
|
||||
This file is part of the AVR-Crypto-Lib.
|
||||
Copyright (C) 2011 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef RANDOM_H_
|
||||
#define RANDOM_H_
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
extern uint8_t(*prng_get_byte)(void);
|
||||
|
||||
#endif /* RANDOM_H_ */
|
|
@ -0,0 +1,77 @@
|
|||
/* rsa_basic.c */
|
||||
/*
|
||||
This file is part of the ARM-Crypto-Lib.
|
||||
Copyright (C) 2006-2011 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "bigint.h"
|
||||
#include "rsa_basic.h"
|
||||
|
||||
#include "cli.h"
|
||||
|
||||
void rsa_enc(bigint_t* data, rsa_publickey_t* key){
|
||||
bigint_expmod_u(data, data, key->exponent, key->modulus);
|
||||
}
|
||||
|
||||
void rsa_dec(bigint_t* data, rsa_privatekey_t* key){
|
||||
bigint_expmod_u(data, data, key->exponent, key->modulus);
|
||||
}
|
||||
|
||||
void rsa_os2ip(bigint_t* dest, const void* data, uint32_t length_B){
|
||||
uint8_t off;
|
||||
off = length_B % sizeof(bigint_word_t);
|
||||
if(!data){
|
||||
if(off){
|
||||
dest->wordv = realloc(dest->wordv, length_B + sizeof(bigint_word_t) - off);
|
||||
memmove((uint8_t*)dest->wordv+off, dest->wordv, length_B);
|
||||
memset(dest->wordv, 0, off);
|
||||
}
|
||||
}else{
|
||||
if(off){
|
||||
memcpy((uint8_t*)dest->wordv + off, data, length_B);
|
||||
memset(dest, 0, off);
|
||||
}else{
|
||||
memcpy(dest->wordv, data, length_B);
|
||||
}
|
||||
}
|
||||
dest->length_B = (length_B + sizeof(bigint_word_t) - 1) / sizeof(bigint_word_t);
|
||||
bigint_changeendianess(dest);
|
||||
bigint_adjust(dest);
|
||||
}
|
||||
|
||||
void rsa_i2osp(void* dest, bigint_t* src, uint16_t* out_length_B){
|
||||
*out_length_B = bigint_get_first_set_bit(src) / 8 + 1;
|
||||
if(dest){
|
||||
uint16_t i;
|
||||
for(i=*out_length_B; i>0; --i){
|
||||
*((uint8_t*)dest) = ((uint8_t*)src->wordv)[i-1];
|
||||
dest = (uint8_t*)dest + 1;
|
||||
}
|
||||
}else{
|
||||
uint8_t off;
|
||||
bigint_changeendianess(src);
|
||||
bigint_adjust(src);
|
||||
|
||||
off = bigint_get_last_set_bit(src)/8;
|
||||
if(off){
|
||||
memmove(src->wordv, (uint8_t*)src->wordv+off, *out_length_B);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,48 @@
|
|||
/* rsa_basic.h */
|
||||
/*
|
||||
This file is part of the AVR-Crypto-Lib.
|
||||
Copyright (C) 2011 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef RSA_BASIC_H_
|
||||
#define RSA_BASIC_H_
|
||||
|
||||
#include "bigint.h"
|
||||
|
||||
typedef struct {
|
||||
bigint_t* exponent;
|
||||
bigint_t* modulus;
|
||||
} rsa_publickey_t;
|
||||
|
||||
typedef struct {
|
||||
bigint_t* exponent;
|
||||
bigint_t* modulus;
|
||||
} rsa_privatekey_t;
|
||||
|
||||
|
||||
typedef struct {
|
||||
bigint_t* public_exponent;
|
||||
bigint_t* private_exponent;
|
||||
bigint_t* modulus;
|
||||
} rsa_fullkey_t;
|
||||
|
||||
|
||||
void rsa_enc(bigint_t* data, rsa_publickey_t* key);
|
||||
void rsa_dec(bigint_t* data, rsa_privatekey_t* key);
|
||||
void rsa_os2ip(bigint_t* dest, const void* data, uint32_t length_B);
|
||||
void rsa_i2osp(void* dest, bigint_t* src, uint16_t* out_length_B);
|
||||
|
||||
#endif /* RSA_BASIC_H_ */
|
|
@ -0,0 +1,94 @@
|
|||
/* rsa_pkcs15.c */
|
||||
/*
|
||||
This file is part of the ARM-Crypto-Lib.
|
||||
Copyright (C) 2006-2011 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "bigint.h"
|
||||
#include "rsa_basic.h"
|
||||
|
||||
#include "bigint_io.h"
|
||||
#include "cli.h"
|
||||
|
||||
#include "random_dummy.h"
|
||||
|
||||
uint8_t rsa_encrypt_pkcs15(void* dest, uint16_t* out_length, const void* src,
|
||||
uint16_t length_B, rsa_publickey_t* key, const void* pad){
|
||||
int16_t pad_length;
|
||||
bigint_t x;
|
||||
pad_length = (bigint_get_first_set_bit(key->modulus) + 7) / 8 - length_B - 3;
|
||||
if(pad_length<8){
|
||||
cli_putstr("\r\nERROR: pad_length<8; pad_length: ");
|
||||
cli_hexdump_rev(&pad_length, 2);
|
||||
return 2; /* message to long */
|
||||
}
|
||||
if(!pad){
|
||||
uint16_t i;
|
||||
uint8_t c;
|
||||
for(i=0; i<pad_length; ++i){
|
||||
do{
|
||||
c = prng_get_byte();
|
||||
}while(c==0);
|
||||
((uint8_t*)dest)[i+2] = c;
|
||||
}
|
||||
}else{
|
||||
memcpy((uint8_t*)dest + 2, pad, pad_length);
|
||||
}
|
||||
((uint8_t*)dest)[0] = 0x00;
|
||||
((uint8_t*)dest)[1] = 0x02;
|
||||
((uint8_t*)dest)[2+pad_length] = 0x00;
|
||||
memcpy((uint8_t*)dest+3+pad_length, src, length_B);
|
||||
x.wordv = dest;
|
||||
x.length_B = (length_B+pad_length+3+sizeof(bigint_word_t)-1)/sizeof(bigint_word_t);
|
||||
bigint_adjust(&x);
|
||||
rsa_os2ip(&x, NULL, length_B+pad_length+3);
|
||||
rsa_enc(&x, key);
|
||||
rsa_i2osp(NULL, &x, out_length);
|
||||
return 0;
|
||||
}
|
||||
|
||||
uint8_t rsa_decrypt_pkcs15(void* dest, uint16_t* out_length, const void* src,
|
||||
uint16_t length_B, rsa_privatekey_t* key, void* pad){
|
||||
bigint_t x;
|
||||
uint16_t m_length, pad_length=0, idx=0;
|
||||
x.wordv = dest;
|
||||
rsa_os2ip(&x, src, length_B);
|
||||
rsa_dec(&x, key);
|
||||
rsa_i2osp(NULL, &x, &m_length);
|
||||
while(((uint8_t*)x.wordv)[idx]==0 && idx<m_length){
|
||||
++idx;
|
||||
}
|
||||
if(((uint8_t*)x.wordv)[idx]!=2 || idx>=m_length){
|
||||
return 1;
|
||||
}
|
||||
++idx;
|
||||
while(((uint8_t*)x.wordv)[idx+pad_length]!=0 && (idx+pad_length)<m_length){
|
||||
++pad_length;
|
||||
}
|
||||
if(pad_length<8 || (idx+pad_length)>=m_length){
|
||||
return 2;
|
||||
}
|
||||
*out_length = m_length - idx - pad_length - 1;
|
||||
memcpy(dest, ((uint8_t*)x.wordv) + idx + pad_length + 1, m_length - idx - pad_length - 1);
|
||||
if(pad){
|
||||
memcpy(pad, ((uint8_t*)x.wordv)+idx, pad_length);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,31 @@
|
|||
/* rsa_pkcs15.h */
|
||||
/*
|
||||
This file is part of the AVR-Crypto-Lib.
|
||||
Copyright (C) 2011 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef RSA_PKCS15_H_
|
||||
#define RSA_PKCS15_H_
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
uint8_t rsa_encrypt_pkcs15(void* dest, uint16_t* out_length, const void* src,
|
||||
uint16_t length_B, rsa_publickey_t* key, const void* pad);
|
||||
|
||||
uint8_t rsa_decrypt_pkcs15(void* dest, uint16_t* out_length, const void* src,
|
||||
uint16_t length_B, rsa_privatekey_t* key, void* pad);
|
||||
|
||||
#endif /* RSA_PKCS15_H_ */
|
|
@ -23,9 +23,9 @@
|
|||
|
||||
#include "main-test-common.h"
|
||||
#include "prf_tls12.h"
|
||||
#include <crypto/hashfunction_descriptor.h>
|
||||
#include <crypto/hfal_sha512.h>
|
||||
#include <crypto/hfal_sha256.h>
|
||||
#include "hashfunction_descriptor.h"
|
||||
#include "hfal_sha512.h"
|
||||
#include "hfal_sha256.h"
|
||||
const char* algo_name = "PRF-TLS1.2";
|
||||
|
||||
/*****************************************************************************
|
||||
|
|
|
@ -0,0 +1,213 @@
|
|||
/* main-dsa-test.c */
|
||||
/*
|
||||
This file is part of the ARM-Crypto-Lib.
|
||||
Copyright (C) 2010 Daniel Otte (daniel.otte@rub.de)
|
||||
|
||||
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 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
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.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
/*
|
||||
* DSA test-suit
|
||||
*
|
||||
*/
|
||||
#include "main-test-common.h"
|
||||
|
||||
#include "noekeon.h"
|
||||
#include "noekeon_prng.h"
|
||||
#include "bigint.h"
|
||||
#include "bigint_io.h"
|
||||
#include "random_dummy.h"
|
||||
#include "rsa_basic.h"
|
||||
#include "rsa_pkcs15.h"
|
||||
|
||||
#include "performance_test.h"
|
||||
|
||||
const char* algo_name = "RSA";
|
||||
|
||||
/*****************************************************************************
|
||||
* additional validation-functions *
|
||||
*****************************************************************************/
|
||||
|
||||
const uint8_t modulus[] = {
|
||||
0xa8, 0xb3, 0xb2, 0x84, 0xaf, 0x8e, 0xb5, 0x0b, 0x38, 0x70, 0x34, 0xa8, 0x60, 0xf1, 0x46, 0xc4,
|
||||
0x91, 0x9f, 0x31, 0x87, 0x63, 0xcd, 0x6c, 0x55, 0x98, 0xc8, 0xae, 0x48, 0x11, 0xa1, 0xe0, 0xab,
|
||||
0xc4, 0xc7, 0xe0, 0xb0, 0x82, 0xd6, 0x93, 0xa5, 0xe7, 0xfc, 0xed, 0x67, 0x5c, 0xf4, 0x66, 0x85,
|
||||
0x12, 0x77, 0x2c, 0x0c, 0xbc, 0x64, 0xa7, 0x42, 0xc6, 0xc6, 0x30, 0xf5, 0x33, 0xc8, 0xcc, 0x72,
|
||||
0xf6, 0x2a, 0xe8, 0x33, 0xc4, 0x0b, 0xf2, 0x58, 0x42, 0xe9, 0x84, 0xbb, 0x78, 0xbd, 0xbf, 0x97,
|
||||
0xc0, 0x10, 0x7d, 0x55, 0xbd, 0xb6, 0x62, 0xf5, 0xc4, 0xe0, 0xfa, 0xb9, 0x84, 0x5c, 0xb5, 0x14,
|
||||
0x8e, 0xf7, 0x39, 0x2d, 0xd3, 0xaa, 0xff, 0x93, 0xae, 0x1e, 0x6b, 0x66, 0x7b, 0xb3, 0xd4, 0x24,
|
||||
0x76, 0x16, 0xd4, 0xf5, 0xba, 0x10, 0xd4, 0xcf, 0xd2, 0x26, 0xde, 0x88, 0xd3, 0x9f, 0x16, 0xfb
|
||||
};
|
||||
|
||||
const uint8_t public_exponent[] = {
|
||||
0x00, 0x01, 0x00, 0x01
|
||||
};
|
||||
|
||||
const uint8_t private_exponent[] = {
|
||||
0x53, 0x33, 0x9c, 0xfd, 0xb7, 0x9f, 0xc8, 0x46, 0x6a, 0x65, 0x5c, 0x73, 0x16, 0xac, 0xa8, 0x5c,
|
||||
0x55, 0xfd, 0x8f, 0x6d, 0xd8, 0x98, 0xfd, 0xaf, 0x11, 0x95, 0x17, 0xef, 0x4f, 0x52, 0xe8, 0xfd,
|
||||
0x8e, 0x25, 0x8d, 0xf9, 0x3f, 0xee, 0x18, 0x0f, 0xa0, 0xe4, 0xab, 0x29, 0x69, 0x3c, 0xd8, 0x3b,
|
||||
0x15, 0x2a, 0x55, 0x3d, 0x4a, 0xc4, 0xd1, 0x81, 0x2b, 0x8b, 0x9f, 0xa5, 0xaf, 0x0e, 0x7f, 0x55,
|
||||
0xfe, 0x73, 0x04, 0xdf, 0x41, 0x57, 0x09, 0x26, 0xf3, 0x31, 0x1f, 0x15, 0xc4, 0xd6, 0x5a, 0x73,
|
||||
0x2c, 0x48, 0x31, 0x16, 0xee, 0x3d, 0x3d, 0x2d, 0x0a, 0xf3, 0x54, 0x9a, 0xd9, 0xbf, 0x7c, 0xbf,
|
||||
0xb7, 0x8a, 0xd8, 0x84, 0xf8, 0x4d, 0x5b, 0xeb, 0x04, 0x72, 0x4d, 0xc7, 0x36, 0x9b, 0x31, 0xde,
|
||||
0xf3, 0x7d, 0x0c, 0xf5, 0x39, 0xe9, 0xcf, 0xcd, 0xd3, 0xde, 0x65, 0x37, 0x29, 0xea, 0xd5, 0xd1
|
||||
};
|
||||
/*
|
||||
# PKCS#1 v1.5 encryption of 20 random messages with random seeds
|
||||
# ---------------------------------------------------------------------------
|
||||
*/
|
||||
|
||||
const uint8_t message[] = {
|
||||
0x66, 0x28, 0x19, 0x4e, 0x12, 0x07, 0x3d, 0xb0, 0x3b, 0xa9, 0x4c, 0xda, 0x9e, 0xf9, 0x53, 0x23,
|
||||
0x97, 0xd5, 0x0d, 0xba, 0x79, 0xb9, 0x87, 0x00, 0x4a, 0xfe, 0xfe, 0x34
|
||||
};
|
||||
|
||||
const uint8_t seed[] = {
|
||||
0x01, 0x73, 0x41, 0xae, 0x38, 0x75, 0xd5, 0xf8, 0x71, 0x01, 0xf8, 0xcc, 0x4f, 0xa9, 0xb9, 0xbc,
|
||||
0x15, 0x6b, 0xb0, 0x46, 0x28, 0xfc, 0xcd, 0xb2, 0xf4, 0xf1, 0x1e, 0x90, 0x5b, 0xd3, 0xa1, 0x55,
|
||||
0xd3, 0x76, 0xf5, 0x93, 0xbd, 0x73, 0x04, 0x21, 0x08, 0x74, 0xeb, 0xa0, 0x8a, 0x5e, 0x22, 0xbc,
|
||||
0xcc, 0xb4, 0xc9, 0xd3, 0x88, 0x2a, 0x93, 0xa5, 0x4d, 0xb0, 0x22, 0xf5, 0x03, 0xd1, 0x63, 0x38,
|
||||
0xb6, 0xb7, 0xce, 0x16, 0xdc, 0x7f, 0x4b, 0xbf, 0x9a, 0x96, 0xb5, 0x97, 0x72, 0xd6, 0x60, 0x6e,
|
||||
0x97, 0x47, 0xc7, 0x64, 0x9b, 0xf9, 0xe0, 0x83, 0xdb, 0x98, 0x18, 0x84, 0xa9, 0x54, 0xab, 0x3c,
|
||||
0x6f
|
||||
};
|
||||
|
||||
const uint8_t encrypted[] = {
|
||||
0x50, 0xb4, 0xc1, 0x41, 0x36, 0xbd, 0x19, 0x8c, 0x2f, 0x3c, 0x3e, 0xd2, 0x43, 0xfc, 0xe0, 0x36,
|
||||
0xe1, 0x68, 0xd5, 0x65, 0x17, 0x98, 0x4a, 0x26, 0x3c, 0xd6, 0x64, 0x92, 0xb8, 0x08, 0x04, 0xf1,
|
||||
0x69, 0xd2, 0x10, 0xf2, 0xb9, 0xbd, 0xfb, 0x48, 0xb1, 0x2f, 0x9e, 0xa0, 0x50, 0x09, 0xc7, 0x7d,
|
||||
0xa2, 0x57, 0xcc, 0x60, 0x0c, 0xce, 0xfe, 0x3a, 0x62, 0x83, 0x78, 0x9d, 0x8e, 0xa0, 0xe6, 0x07,
|
||||
0xac, 0x58, 0xe2, 0x69, 0x0e, 0xc4, 0xeb, 0xc1, 0x01, 0x46, 0xe8, 0xcb, 0xaa, 0x5e, 0xd4, 0xd5,
|
||||
0xcc, 0xe6, 0xfe, 0x7b, 0x0f, 0xf9, 0xef, 0xc1, 0xea, 0xbb, 0x56, 0x4d, 0xbf, 0x49, 0x82, 0x85,
|
||||
0xf4, 0x49, 0xee, 0x61, 0xdd, 0x7b, 0x42, 0xee, 0x5b, 0x58, 0x92, 0xcb, 0x90, 0x60, 0x1f, 0x30,
|
||||
0xcd, 0xa0, 0x7b, 0xf2, 0x64, 0x89, 0x31, 0x0b, 0xcd, 0x23, 0xb5, 0x28, 0xce, 0xab, 0x3c, 0x31
|
||||
};
|
||||
|
||||
rsa_publickey_t pub_key;
|
||||
rsa_privatekey_t priv_key;
|
||||
|
||||
void load_fix_rsa(void){
|
||||
bigint_t *m, *epub, *epriv;
|
||||
m = malloc(sizeof(bigint_t));
|
||||
epub = malloc(sizeof(bigint_t));
|
||||
epriv = malloc(sizeof(bigint_t));
|
||||
if(!m || !epub || !epriv){
|
||||
cli_putstr("\r\nOOM!\r\n");
|
||||
return;
|
||||
}
|
||||
|
||||
m->length_B = (sizeof(modulus) + sizeof(bigint_word_t) - 1) / sizeof(bigint_word_t);
|
||||
epub->length_B = (sizeof(public_exponent) + sizeof(bigint_word_t) - 1) / sizeof(bigint_word_t);
|
||||
epriv->length_B = (sizeof(private_exponent) + sizeof(bigint_word_t) - 1) / sizeof(bigint_word_t);
|
||||
|
||||
m->wordv = malloc(m->length_B * sizeof(bigint_word_t));
|
||||
epub->wordv = malloc(epub->length_B * sizeof(bigint_word_t));
|
||||
epriv->wordv = malloc(epriv->length_B * sizeof(bigint_word_t));
|
||||
|
||||
if(!m->wordv || !epub->wordv || !epriv->wordv){
|
||||
cli_putstr("\r\nOOM!\r\n");
|
||||
return;
|
||||
}
|
||||
|
||||
memcpy(m->wordv, modulus, sizeof(modulus));
|
||||
memcpy(epub->wordv, public_exponent, sizeof(public_exponent));
|
||||
memcpy(epriv->wordv, private_exponent, sizeof(private_exponent));
|
||||
|
||||
pub_key.modulus = priv_key.modulus = m;
|
||||
pub_key.exponent = epub;
|
||||
priv_key.exponent = epriv;
|
||||
|
||||
bigint_changeendianess(m);
|
||||
bigint_adjust(m);
|
||||
bigint_changeendianess(epub);
|
||||
bigint_adjust(epub);
|
||||
bigint_changeendianess(epriv);
|
||||
bigint_adjust(epriv);
|
||||
|
||||
}
|
||||
|
||||
void quick_test(void){
|
||||
uint8_t *ciphertext, *plaintext, rc;
|
||||
uint16_t clen, plen;
|
||||
ciphertext = malloc(clen = pub_key.modulus->length_B * sizeof(bigint_word_t));
|
||||
plaintext = malloc(pub_key.modulus->length_B * sizeof(bigint_word_t));
|
||||
memcpy(ciphertext, message, sizeof(message));
|
||||
cli_putstr("\r\nplaintext:\r\n");
|
||||
cli_hexdump_block(ciphertext, sizeof(message), 4, 8);
|
||||
rc = rsa_encrypt_pkcs15(ciphertext, &clen, message, sizeof(message), &pub_key, seed);
|
||||
if(rc){
|
||||
cli_putstr("\r\nERROR: rsa_encrypt_pkcs15 returned: ");
|
||||
cli_hexdump_byte(rc);
|
||||
return;
|
||||
}
|
||||
cli_putstr("\r\nciphertext:\r\n");
|
||||
cli_hexdump_block(ciphertext, clen, 4, 8);
|
||||
rc = rsa_decrypt_pkcs15(plaintext, &plen, ciphertext, clen, &priv_key, NULL);
|
||||
if(rc){
|
||||
cli_putstr("\r\nERROR: rsa_encrypt_pkcs15 returned: ");
|
||||
cli_hexdump_byte(rc);
|
||||
return;
|
||||
}
|
||||
cli_putstr("\r\nplaintext:\r\n");
|
||||
cli_hexdump_block(plaintext, plen, 4, 8);
|
||||
free(ciphertext);
|
||||
free(plaintext);
|
||||
}
|
||||
|
||||
void reset_prng(void){
|
||||
uint8_t buf[16];
|
||||
memset(buf, 0, 16);
|
||||
random_seed(buf);
|
||||
cli_putstr("\r\nPRNG reset");
|
||||
}
|
||||
|
||||
void rsa_init(void){
|
||||
load_fix_rsa();
|
||||
prng_get_byte = random8;
|
||||
}
|
||||
|
||||
/*****************************************************************************
|
||||
* main *
|
||||
*****************************************************************************/
|
||||
|
||||
const char echo_test_str[] = "echo-test";
|
||||
const char reset_prng_str[] = "reset-prng";
|
||||
const char quick_test_str[] = "quick-test";
|
||||
const char performance_str[] = "performance";
|
||||
const char echo_str[] = "echo";
|
||||
|
||||
cmdlist_entry_t cmdlist[] = {
|
||||
{ reset_prng_str, NULL, reset_prng },
|
||||
{ quick_test_str, NULL, quick_test },
|
||||
// { performance_str, NULL, testrun_performance_bigint },
|
||||
{ echo_str, (void*)1, (void_fpt)echo_ctrl },
|
||||
{ NULL, NULL, NULL }
|
||||
};
|
||||
|
||||
void dump_sp(void){
|
||||
uint8_t x;
|
||||
uint8_t *xa = &x;
|
||||
cli_putstr("\r\nstack pointer: ~");
|
||||
cli_hexdump_rev(&xa, 4);
|
||||
}
|
||||
|
||||
int main (void){
|
||||
main_setup();
|
||||
|
||||
for(;;){
|
||||
welcome_msg(algo_name);
|
||||
rsa_init();
|
||||
cmd_interface(cmdlist);
|
||||
}
|
||||
}
|
Loading…
Reference in New Issue