rsa_sha1.c 3 KB
Newer Older
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
/* rsa_sha1.c
 *
 * Signatures using RSA and SHA1.
 */

/* nettle, low-level cryptographics library
 *
 * Copyright (C) 2001 Niels Mller
 *  
 * The nettle library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or (at your
 * option) any later version.
 * 
 * The nettle library 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 Lesser General Public
 * License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with the nettle library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 * MA 02111-1307, USA.
 */

#if HAVE_CONFIG_H
#include "config.h"
#endif

#if HAVE_LIBGMP

#include "rsa.h"

#include "bignum.h"

#include <assert.h>
#include <stdlib.h>
#include <string.h>

/* Forward declarations */
static void
pkcs1_encode_sha1(mpz_t m, unsigned length, struct sha1_ctx *hash);

void
rsa_sha1_sign(struct rsa_private_key *key,
              struct sha1_ctx *hash,
47
              mpz_t s)
48
49
50
{
  assert(key->pub.size >= 45);

51
  pkcs1_encode_sha1(s, key->pub.size - 1, hash);
52

53
  rsa_compute_root(key, s, s);
54
55
56
57
58
}

int
rsa_sha1_verify(struct rsa_public_key *key,
                struct sha1_ctx *hash,
59
                const mpz_t s)
60
61
62
{
  int res;
  
63
64
  mpz_t m1;
  mpz_t m2;
65

66
67
68
69
70
  if ( (mpz_sgn(s) <= 0)
       || (mpz_cmp(s, key->n) >= 0) )
    return 0;

  mpz_init(m1); mpz_init(m2);
71
  
72
  mpz_powm(m1, s, key->e, key->n);
73
74

  /* FIXME: Is it cheaper to convert s to a string and check that? */
75
76
  pkcs1_encode_sha1(m2, key->size - 1, hash);
  res = !mpz_cmp(m1, m2);
77

78
79
  mpz_clear(m1); mpz_clear(m2);
  
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
  return res;
}

/* From pkcs-1v2
 *
 *   id-sha1 OBJECT IDENTIFIER ::=
 *     {iso(1) identified-organization(3) oiw(14) secsig(3)
 *   	 algorithms(2) 26}
 *   
 *   The default hash function is SHA-1: 
 *   sha1Identifier ::= AlgorithmIdentifier {id-sha1, NULL}
 */

static const uint8_t sha1_prefix[] =
{
  /* 15 octets prefix, 20 octets hash, total 35 */
  0x30,       33, /* SEQUENCE */
    0x30,      9, /* SEQUENCE */
      0x06,    5, /* OBJECT IDENTIFIER */
  	  0x2b, 0x0e, 0x03, 0x02, 0x1a,
      0x05,    0, /* NULL */
    0x04,     20  /* OCTET STRING */
      /* Here comes the raw hash value */
};
    


static void
pkcs1_encode_sha1(mpz_t m, unsigned length, struct sha1_ctx *hash)
{
  uint8_t *em = alloca(length);
  unsigned i;

  assert(length >= SHA1_DIGEST_SIZE);

  i = length - SHA1_DIGEST_SIZE;
  
  sha1_digest(hash, SHA1_DIGEST_SIZE, em + i);

  assert(i >= sizeof(sha1_prefix));

  i -= sizeof(sha1_prefix);
  memcpy(em + i, sha1_prefix, sizeof(sha1_prefix));

  assert(i);
  em[--i] = 0;

  assert(i >= 9);

  em[0] = 1;
  memset(em + 1, 0xff, i - 1);

  nettle_mpz_set_str_256(m, length, em);
}

#endif /* HAVE_LIBGMP */