3 This file is part of the ARM-Crypto-Lib.
4 Copyright (C) 2006-2011 Daniel Otte (daniel.otte@rub.de)
6 This program is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
24 #include "bigint_io.h"
25 #include "rsa_basic.h"
31 #include "uart_lowlevel.h"
32 #include "string-extras.h"
35 void rsa_enc(bigint_t* data, rsa_publickey_t* key){
37 cli_putstr("\r\n -->rsa_enc()\r\n m = ");
38 bigint_print_hex(data);
39 cli_putstr("\r\n e = ");
40 bigint_print_hex(key->exponent);
41 cli_putstr("\r\n n = ");
42 bigint_print_hex(key->modulus);
44 bigint_expmod_u(data, data, key->exponent, key->modulus);
51 h = (m1 - m2) * qinv % p
55 uint8_t rsa_dec_crt_mono(bigint_t* data, rsa_privatekey_t* key){
57 m1.wordv = malloc(key->components[0]->length_B * sizeof(bigint_word_t));
58 m2.wordv = malloc(key->components[1]->length_B * sizeof(bigint_word_t));
59 if(!m1.wordv || !m2.wordv){
61 cli_putstr("\r\nERROR: OOM!");
68 cli_putstr("\r\nDBG: expmod m1 ...");
70 bigint_expmod_u(&m1, data, key->components[2], key->components[0]);
72 cli_putstr("expmod m2 ...");
74 bigint_expmod_u(&m2, data, key->components[3], key->components[1]);
75 bigint_sub_s(&m1, &m1, &m2);
76 while(BIGINT_NEG_MASK & m1.info){
77 bigint_add_s(&m1, &m1, key->components[0]);
81 cli_putstr("\r\nDBG: reduce-mul ...");
83 bigint_reduce(&m1, key->components[0]);
84 bigint_mul_u(data, &m1, key->components[4]);
85 bigint_reduce(data, key->components[0]);
86 bigint_mul_u(data, data, key->components[1]);
87 bigint_add_u(data, data, &m2);
93 uint8_t rsa_dec(bigint_t* data, rsa_privatekey_t* key){
95 bigint_expmod_u(data, data, key->components[0], key->modulus);
99 if (rsa_dec_crt_mono(data, key)){
104 if(key->n<8 || (key->n-5)%3 != 0){
107 //rsa_dec_crt_multi(data, key, (key->n-5)/3);
111 void rsa_os2ip(bigint_t* dest, const void* data, uint32_t length_B){
112 #if BIGINT_WORD_SIZE == 8
114 memcpy(dest->wordv, data, length_B)
116 dest->length_B = length_B;
119 off = (sizeof(bigint_word_t) - length_B % sizeof(bigint_word_t)) % sizeof(bigint_word_t);
121 cli_putstr("\r\nDBG: off = 0x");
122 cli_hexdump_byte(off);
126 dest->wordv = realloc(dest->wordv, length_B + sizeof(bigint_word_t) - off);
127 memmove((uint8_t*)dest->wordv+off, dest->wordv, length_B);
128 memset(dest->wordv, 0, off);
131 memcpy((uint8_t*)dest->wordv + off, data, length_B);
133 memset(dest->wordv, 0, off);
136 dest->length_B = (length_B + off) / sizeof(bigint_word_t);
138 cli_putstr("\r\nDBG: dest->length_B = 0x");
139 cli_hexdump_rev(&(dest->length_B), 2);
142 bigint_changeendianess(dest);
146 void rsa_i2osp(void* dest, bigint_t* src, uint16_t* out_length_B){
147 #if BIGINT_WORD_SIZE == 8
149 uint8_t *e = src->wordv + src->length_B;
151 for(i=src->length_B; i>0; --i){
152 *((uint8_t*)dest) = *--e;
153 dest = (uint8_t*)dest + 1;
156 bigint_changeendianess(src);
159 *out_length_B = src->length_B;
161 *out_length_B = bigint_get_first_set_bit(src) / 8 + 1;
164 for(i=*out_length_B; i>0; --i){
165 *((uint8_t*)dest) = ((uint8_t*)src->wordv)[i-1];
166 dest = (uint8_t*)dest + 1;
170 bigint_changeendianess(src);
173 off = bigint_get_last_set_bit(src)/8;
175 memmove(src->wordv, (uint8_t*)src->wordv+off, *out_length_B);