mirror of
https://salsa.debian.org/gnuk-team/gnuk/gnuk.git
synced 2024-09-21 03:10:08 +00:00
229 lines
5.5 KiB
C
229 lines
5.5 KiB
C
/*
|
|
* call-rsa.c -- Glue code between RSA computation and OpenPGP card protocol
|
|
*
|
|
* Copyright (C) 2010, 2011, 2012 Free Software Initiative of Japan
|
|
* Author: NIIBE Yutaka <gniibe@fsij.org>
|
|
*
|
|
* This file is a part of Gnuk, a GnuPG USB Token implementation.
|
|
*
|
|
* Gnuk 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.
|
|
*
|
|
* Gnuk 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 <stdlib.h>
|
|
#include "config.h"
|
|
#include "ch.h"
|
|
#include "gnuk.h"
|
|
#include "openpgp.h"
|
|
#include "polarssl/config.h"
|
|
#include "polarssl/rsa.h"
|
|
|
|
#define RSA_SIGNATURE_LENGTH KEY_CONTENT_LEN
|
|
/* 256 byte == 2048-bit */
|
|
/* 128 byte == 1024-bit */
|
|
|
|
static rsa_context rsa_ctx;
|
|
|
|
int
|
|
rsa_sign (const uint8_t *raw_message, uint8_t *output, int msg_len,
|
|
struct key_data *kd)
|
|
{
|
|
mpi P1, Q1, H;
|
|
int r;
|
|
unsigned char temp[RSA_SIGNATURE_LENGTH];
|
|
|
|
mpi_init (&P1, &Q1, &H, NULL);
|
|
rsa_init (&rsa_ctx, RSA_PKCS_V15, 0);
|
|
|
|
rsa_ctx.len = KEY_CONTENT_LEN;
|
|
mpi_lset (&rsa_ctx.E, 0x10001);
|
|
mpi_read_binary (&rsa_ctx.P, &kd->data[0], rsa_ctx.len / 2);
|
|
mpi_read_binary (&rsa_ctx.Q, &kd->data[KEY_CONTENT_LEN/2], rsa_ctx.len / 2);
|
|
#if 0 /* Using CRT, we don't use N */
|
|
mpi_mul_mpi (&rsa_ctx.N, &rsa_ctx.P, &rsa_ctx.Q);
|
|
#endif
|
|
mpi_sub_int (&P1, &rsa_ctx.P, 1);
|
|
mpi_sub_int (&Q1, &rsa_ctx.Q, 1);
|
|
mpi_mul_mpi (&H, &P1, &Q1);
|
|
mpi_inv_mod (&rsa_ctx.D , &rsa_ctx.E, &H);
|
|
mpi_mod_mpi (&rsa_ctx.DP, &rsa_ctx.D, &P1);
|
|
mpi_mod_mpi (&rsa_ctx.DQ, &rsa_ctx.D, &Q1);
|
|
mpi_inv_mod (&rsa_ctx.QP, &rsa_ctx.Q, &rsa_ctx.P);
|
|
mpi_free (&P1, &Q1, &H, NULL);
|
|
|
|
DEBUG_INFO ("RSA sign...");
|
|
|
|
r = rsa_pkcs1_sign (&rsa_ctx, RSA_PRIVATE, SIG_RSA_RAW,
|
|
msg_len, raw_message, temp);
|
|
memcpy (output, temp, RSA_SIGNATURE_LENGTH);
|
|
rsa_free (&rsa_ctx);
|
|
if (r < 0)
|
|
{
|
|
DEBUG_INFO ("fail:");
|
|
DEBUG_SHORT (r);
|
|
return r;
|
|
}
|
|
else
|
|
{
|
|
res_APDU_size = RSA_SIGNATURE_LENGTH;
|
|
DEBUG_INFO ("done.\r\n");
|
|
GPG_SUCCESS ();
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* LEN: length in byte
|
|
*/
|
|
const uint8_t *
|
|
modulus_calc (const uint8_t *p, int len)
|
|
{
|
|
mpi P, Q, N;
|
|
uint8_t *modulus;
|
|
|
|
modulus = malloc (len);
|
|
if (modulus == NULL)
|
|
return NULL;
|
|
|
|
mpi_init (&P, &Q, &N, NULL);
|
|
mpi_read_binary (&P, p, len / 2);
|
|
mpi_read_binary (&Q, p + len / 2, len / 2);
|
|
mpi_mul_mpi (&N, &P, &Q);
|
|
|
|
mpi_write_binary (&N, modulus, len);
|
|
mpi_free (&P, &Q, &N, NULL);
|
|
return modulus;
|
|
}
|
|
|
|
void
|
|
modulus_free (const uint8_t *p)
|
|
{
|
|
free ((void *)p);
|
|
}
|
|
|
|
int
|
|
rsa_decrypt (const uint8_t *input, uint8_t *output, int msg_len,
|
|
struct key_data *kd)
|
|
{
|
|
mpi P1, Q1, H;
|
|
int r;
|
|
int output_len;
|
|
|
|
DEBUG_INFO ("RSA decrypt:");
|
|
DEBUG_WORD ((uint32_t)&output_len);
|
|
|
|
mpi_init (&P1, &Q1, &H, NULL);
|
|
rsa_init (&rsa_ctx, RSA_PKCS_V15, 0);
|
|
|
|
rsa_ctx.len = msg_len;
|
|
DEBUG_WORD (msg_len);
|
|
|
|
mpi_lset (&rsa_ctx.E, 0x10001);
|
|
mpi_read_binary (&rsa_ctx.P, &kd->data[0], KEY_CONTENT_LEN / 2);
|
|
mpi_read_binary (&rsa_ctx.Q, &kd->data[KEY_CONTENT_LEN/2],
|
|
KEY_CONTENT_LEN / 2);
|
|
#if 0 /* Using CRT, we don't use N */
|
|
mpi_mul_mpi (&rsa_ctx.N, &rsa_ctx.P, &rsa_ctx.Q);
|
|
#endif
|
|
mpi_sub_int (&P1, &rsa_ctx.P, 1);
|
|
mpi_sub_int (&Q1, &rsa_ctx.Q, 1);
|
|
mpi_mul_mpi (&H, &P1, &Q1);
|
|
mpi_inv_mod (&rsa_ctx.D , &rsa_ctx.E, &H);
|
|
mpi_mod_mpi (&rsa_ctx.DP, &rsa_ctx.D, &P1);
|
|
mpi_mod_mpi (&rsa_ctx.DQ, &rsa_ctx.D, &Q1);
|
|
mpi_inv_mod (&rsa_ctx.QP, &rsa_ctx.Q, &rsa_ctx.P);
|
|
mpi_free (&P1, &Q1, &H, NULL);
|
|
|
|
DEBUG_INFO ("RSA decrypt ...");
|
|
|
|
r = rsa_pkcs1_decrypt (&rsa_ctx, RSA_PRIVATE, &output_len,
|
|
input, output, MAX_RES_APDU_DATA_SIZE);
|
|
rsa_free (&rsa_ctx);
|
|
if (r < 0)
|
|
{
|
|
DEBUG_INFO ("fail:");
|
|
DEBUG_SHORT (r);
|
|
return r;
|
|
}
|
|
else
|
|
{
|
|
res_APDU_size = output_len;
|
|
DEBUG_INFO ("done.\r\n");
|
|
GPG_SUCCESS ();
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
int
|
|
rsa_verify (const uint8_t *pubkey, const uint8_t *hash, const uint8_t *sig)
|
|
{
|
|
int r;
|
|
|
|
rsa_init (&rsa_ctx, RSA_PKCS_V15, 0);
|
|
rsa_ctx.len = KEY_CONTENT_LEN;
|
|
mpi_lset (&rsa_ctx.E, 0x10001);
|
|
mpi_read_binary (&rsa_ctx.N, pubkey, KEY_CONTENT_LEN);
|
|
|
|
DEBUG_INFO ("RSA verify...");
|
|
|
|
r = rsa_pkcs1_verify (&rsa_ctx, RSA_PUBLIC, SIG_RSA_SHA256, 32, hash, sig);
|
|
|
|
rsa_free (&rsa_ctx);
|
|
if (r < 0)
|
|
{
|
|
DEBUG_INFO ("fail:");
|
|
DEBUG_SHORT (r);
|
|
return r;
|
|
}
|
|
else
|
|
{
|
|
DEBUG_INFO ("verified.\r\n");
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
#define RSA_EXPONENT 0x10001
|
|
|
|
#ifdef KEYGEN_SUPPORT
|
|
const uint8_t *
|
|
rsa_genkey (void)
|
|
{
|
|
int r;
|
|
uint8_t index = 0;
|
|
uint8_t *p_q_modulus = (uint8_t *)malloc (KEY_CONTENT_LEN*2);
|
|
uint8_t *p = p_q_modulus;
|
|
uint8_t *q = p_q_modulus + KEY_CONTENT_LEN/2;
|
|
uint8_t *modulus = p_q_modulus + KEY_CONTENT_LEN;
|
|
|
|
if (p_q_modulus == NULL)
|
|
return NULL;
|
|
|
|
rsa_init (&rsa_ctx, RSA_PKCS_V15, 0);
|
|
r = rsa_gen_key (&rsa_ctx, random_byte, &index,
|
|
KEY_CONTENT_LEN * 8, RSA_EXPONENT);
|
|
if (r < 0)
|
|
{
|
|
free (p_q_modulus);
|
|
rsa_free (&rsa_ctx);
|
|
return NULL;
|
|
}
|
|
|
|
mpi_write_binary (&rsa_ctx.P, p, KEY_CONTENT_LEN/2);
|
|
mpi_write_binary (&rsa_ctx.Q, q, KEY_CONTENT_LEN/2);
|
|
mpi_write_binary (&rsa_ctx.N, modulus, KEY_CONTENT_LEN);
|
|
rsa_free (&rsa_ctx);
|
|
return p_q_modulus;
|
|
}
|
|
#endif
|