2 * rsa.c: implementation of RSA with PKCS#1 padding
5 * This file is Free Software. It was originally written for secnet.
7 * Copyright 1995-2003 Stephen Early
8 * Copyright 2002-2014 Ian Jackson
9 * Copyright 2001 Simon Tatham
10 * Copyright 2013 Mark Wooding
12 * You may redistribute secnet as a whole and/or modify it under the
13 * terms of the GNU General Public License as published by the Free
14 * Software Foundation; either version 3, or (at your option) any
17 * You may redistribute this file and/or modify it under the terms of
18 * the GNU General Public License as published by the Free Software
19 * Foundation; either version 2, or (at your option) any later
22 * This software is distributed in the hope that it will be useful,
23 * but WITHOUT ANY WARRANTY; without even the implied warranty of
24 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
25 * GNU General Public License for more details.
27 * You should have received a copy of the GNU General Public License
28 * along with this software; if not, see
29 * https://www.gnu.org/licenses/gpl.html.
38 #include "unaligned.h"
40 #define AUTHFILE_ID_STRING "SSH PRIVATE KEY FILE FORMAT 1.1\n"
42 #define mpp(s,n) do { char *p = mpz_get_str(NULL,16,n); printf("%s 0x%sL\n", s, p); free(p); } while (0)
48 #define FREE(b) ({ free((b)); (b)=0; })
51 void (*verror)(struct load_ctx *l,
52 FILE *maybe_f, bool_t unsup,
53 const char *message, va_list args);
54 bool_t (*postreadcheck)(struct load_ctx *l, FILE *f);
65 static void verror_tryload(struct load_ctx *l,
66 FILE *maybe_f, bool_t unsup,
67 const char *message, va_list args)
69 int class=unsup ? M_DEBUG : M_ERR;
70 slilog_part(l->u.tryload.log,class,"%s: ",l->what);
71 vslilog(l->u.tryload.log,class,message,args);
74 static void verror_cfgfatal(struct load_ctx *l,
75 FILE *maybe_f, bool_t unsup,
76 const char *message, va_list args)
78 vcfgfatal_maybefile(maybe_f,*l->loc,l->what,message,args);
83 struct sigprivkey_if ops;
85 struct rsacommon common;
92 #define RSAPUB_BNS(each) \
93 each(0,e,"public exponent") \
96 #define RSAPUB_LOADCORE_PASSBN(ix,en,what) \
101 struct sigpubkey_if ops;
103 struct rsacommon common;
107 /* Sign data. NB data must be smaller than modulus */
109 #define RSA_MAX_MODBYTES 2048
110 /* The largest modulus I've seen is 15360 bits, which works out at 1920
111 * bytes. Using keys this big is quite implausible, but it doesn't cost us
112 * much to support them.
115 static const char *hexchars="0123456789abcdef";
117 static void rsa_sethash(struct rsacommon *c, struct hash_if *hash,
118 const struct hash_if **in_ops)
121 c->hashbuf=safe_malloc(hash->hlen, "generate_msg");
124 static void rsa_pub_sethash(void *sst, struct hash_if *hash)
126 struct rsapub *st=sst;
127 rsa_sethash(&st->common, hash, &st->ops.hash);
129 static void rsa_priv_sethash(void *sst, struct hash_if *hash)
131 struct rsapriv *st=sst;
132 rsa_sethash(&st->common, hash, &st->ops.hash);
134 static void rsacommon_dispose(struct rsacommon *c)
139 static void emsa_pkcs1(MP_INT *n, MP_INT *m,
140 const uint8_t *data, int32_t datalen)
142 char buff[2*RSA_MAX_MODBYTES + 1];
145 /* RSA PKCS#1 v1.5 signature padding:
147 * <------------ msize hex digits ---------->
149 * 00 01 ff ff .... ff ff 00 vv vv vv .... vv
153 * = datalen*2 hex digits
155 * NB that according to PKCS#1 v1.5 we're supposed to include a
156 * hash function OID in the data. We don't do that (because we
157 * don't have the hash function OID to hand here), thus violating
158 * the spec in a way that affects interop but not security.
163 msize=mpz_sizeinbase(n, 16);
165 if (datalen*2+6>=msize) {
166 fatal("rsa: message too big");
171 for (i=0; i<datalen; i++) {
172 buff[msize+(-datalen+i)*2]=hexchars[(data[i]&0xf0)>>4];
173 buff[msize+(-datalen+i)*2+1]=hexchars[data[i]&0xf];
176 buff[msize-datalen*2-2]= '0';
177 buff[msize-datalen*2-1]= '0';
179 for (i=4; i<msize-datalen*2-2; i++)
184 mpz_set_str(m, buff, 16);
187 static bool_t rsa_sign(void *sst, uint8_t *data, int32_t datalen,
188 struct buffer_if *msg)
190 struct rsapriv *st=sst;
191 MP_INT a, b, u, v, tmp, tmp2;
192 string_t signature = 0;
198 hash_hash(st->ops.hash,data,datalen,st->common.hashbuf);
199 /* Construct the message representative. */
200 emsa_pkcs1(&st->n, &a, st->common.hashbuf, st->ops.hash->hlen);
203 * Produce an RSA signature (a^d mod n) using the Chinese
204 * Remainder Theorem. We compute:
206 * u = a^dp mod p (== a^d mod p, since dp == d mod (p-1))
207 * v = a^dq mod q (== a^d mod q, similarly)
209 * We also know w == iqmp * q, which has the property that w ==
210 * 0 mod q and w == 1 mod p. So (1-w) has the reverse property
211 * (congruent to 0 mod p and to 1 mod q). Hence we now compute
213 * b = w * u + (1-w) * v
216 * so that b is congruent to a^d both mod p and mod q. Hence b,
217 * reduced mod n, is the required signature.
224 mpz_powm_sec(&u, &a, &st->dp, &st->p);
225 mpz_powm_sec(&v, &a, &st->dq, &st->q);
226 mpz_sub(&tmp, &u, &v);
227 mpz_mul(&tmp2, &tmp, &st->w);
228 mpz_add(&tmp, &tmp2, &v);
229 mpz_mod(&b, &tmp, &st->n);
236 signature=write_mpstring(&b);
238 uint8_t *op = buf_append(msg,2);
239 if (!op) { ok=False; goto out; }
240 size_t l = strlen(signature);
243 op = buf_append(msg,l);
244 if (!op) { ok=False; goto out; }
245 memcpy(op, signature, l);
256 static bool_t rsa_sig_unpick(void *sst, struct buffer_if *msg,
257 struct alg_msg_data *sig)
259 uint8_t *lp = buf_unprepend(msg, 2);
260 if (!lp) return False;
261 sig->len = get_uint16(lp);
262 sig->start = buf_unprepend(msg, sig->len);
263 if (!sig->start) return False;
265 /* In `rsa_sig_check' below, we assume that we can write a nul
266 * terminator following the signature. Make sure there's enough space.
268 if (msg->start >= msg->base + msg->alloclen)
274 static sig_checksig_fn rsa_sig_check;
275 static bool_t rsa_sig_check(void *sst, uint8_t *data, int32_t datalen,
276 const struct alg_msg_data *sig)
278 struct rsapub *st=sst;
286 hash_hash(st->ops.hash,data,datalen,st->common.hashbuf);
287 emsa_pkcs1(&st->n, &a, st->common.hashbuf, st->ops.hash->hlen);
289 /* Terminate signature with a '0' - already checked that this will fit */
290 int save = sig->start[sig->len];
291 sig->start[sig->len] = 0;
292 mpz_set_str(&b, sig->start, 16);
293 sig->start[sig->len] = save;
295 mpz_powm(&c, &b, &st->e, &st->n);
297 ok=(mpz_cmp(&a, &c)==0);
306 static void rsapub_dispose(void *sst) {
307 struct rsapub *st=sst;
311 rsacommon_dispose(&st->common);
315 #define RSAPUB_LOADCORE_DEFBN(ix,en,what) \
316 const char *en##s, struct cloc en##_loc,
318 #define LDPUBFATAL(enloc,...) \
319 cfgfatal(enloc, "rsa-public", __VA_ARGS__)
321 static struct rsapub *rsa_loadpub_core(RSAPUB_BNS(RSAPUB_LOADCORE_DEFBN)
322 struct cloc overall_loc)
327 st->cl.description="rsapub";
328 st->cl.type=CL_SIGPUBKEY;
330 st->cl.interface=&st->ops;
332 st->ops.sethash=rsa_pub_sethash;
333 st->common.hashbuf=NULL;
334 st->ops.unpick=rsa_sig_unpick;
335 st->ops.check=rsa_sig_check;
337 st->ops.dispose=rsapub_dispose;
340 #define RSAPUB_LOADCORE_GETBN(ix,en,what) \
341 if (mpz_init_set_str(&st->en,en##s,10)!=0) { \
342 LDPUBFATAL(en##_loc, what " \"%s\" is not a " \
343 "decimal number string\n",en##s); \
345 if (mpz_sizeinbase(&st->en, 256) > RSA_MAX_MODBYTES) { \
346 LDPUBFATAL(en##_loc, "implausibly large " what "\n"); \
349 RSAPUB_BNS(RSAPUB_LOADCORE_GETBN)
354 static list_t *rsapub_apply(closure_t *self, struct cloc loc, dict_t *context,
358 #define RSAPUB_APPLY_GETBN(ix,en,what) \
361 en##i=list_elem(args,ix); \
363 cfgfatal(loc,"rsa-public", \
364 "you must provide an encryption key\n"); \
365 struct cloc en##_loc=en##i->loc; \
366 if (en##i->type!=t_string) \
367 cfgfatal(en##_loc,"rsa-public", \
368 "first argument must be a string\n"); \
369 en##s=en##i->data.string;
371 RSAPUB_BNS(RSAPUB_APPLY_GETBN)
373 struct rsapub *st=rsa_loadpub_core(RSAPUB_BNS(RSAPUB_LOADCORE_PASSBN)
376 return new_closure(&st->cl);
379 static void load_error(struct load_ctx *l, FILE *maybe_f,
380 bool_t unsup, const char *fmt, ...)
384 l->verror(l,maybe_f,unsup,fmt,al);
388 #define LDFATAL(...) ({ load_error(l,0,0,__VA_ARGS__); goto error_out; })
389 #define LDUNSUP(...) ({ load_error(l,0,1,__VA_ARGS__); goto error_out; })
390 #define LDFATAL_FILE(...) ({ load_error(l,f,0,__VA_ARGS__); goto error_out; })
391 #define LDUNSUP_FILE(...) ({ load_error(l,f,1,__VA_ARGS__); goto error_out; })
392 #define KEYFILE_GET(is) ({ \
393 uint##is##_t keyfile_get_tmp=keyfile_get_##is(l,f); \
394 if (!l->postreadcheck(l,f)) goto error_out; \
398 static uint32_t keyfile_get_32(struct load_ctx *l, FILE *f)
408 static uint16_t keyfile_get_16(struct load_ctx *l, FILE *f)
416 static void rsapriv_dispose(void *sst)
418 struct rsapriv *st=sst;
420 mpz_clear(&st->p); mpz_clear(&st->dp);
421 mpz_clear(&st->q); mpz_clear(&st->dq);
423 rsacommon_dispose(&st->common);
427 static struct rsapriv *rsa_loadpriv_core(struct load_ctx *l,
428 FILE *f, struct cloc loc,
429 bool_t do_validity_check)
431 struct rsapriv *st=0;
435 MP_INT e,d,iqmp,tmp,tmp2,tmp3;
446 st->cl.description="rsapriv";
447 st->cl.type=CL_SIGPRIVKEY;
449 st->cl.interface=&st->ops;
451 st->ops.sethash=rsa_priv_sethash;
452 st->common.hashbuf=NULL;
453 st->ops.sign=rsa_sign;
455 st->ops.dispose=rsapriv_dispose;
465 assert(just_check_config);
469 /* Check that the ID string is correct */
470 length=strlen(AUTHFILE_ID_STRING)+1;
471 b=safe_malloc(length,"rsapriv_apply");
472 if (fread(b,length,1,f)!=1 || memcmp(b,AUTHFILE_ID_STRING,length)!=0) {
473 LDUNSUP_FILE("failed to read magic ID"
474 " string from SSH1 private keyfile\n");
478 cipher_type=fgetc(f);
479 KEYFILE_GET(32); /* "Reserved data" */
480 if (cipher_type != 0) {
481 LDUNSUP("we don't support encrypted keyfiles\n");
484 /* Read the public key */
485 KEYFILE_GET(32); /* Not sure what this is */
486 length=(KEYFILE_GET(16)+7)/8;
487 if (length>RSA_MAX_MODBYTES) {
488 LDFATAL("implausible length %ld for modulus\n",
491 b=safe_malloc(length,"rsapriv_apply");
492 if (fread(b,length,1,f) != 1) {
493 LDFATAL_FILE("error reading modulus\n");
495 read_mpbin(&st->n,b,length);
497 length=(KEYFILE_GET(16)+7)/8;
498 if (length>RSA_MAX_MODBYTES) {
499 LDFATAL("implausible length %ld for e\n",length);
501 b=safe_malloc(length,"rsapriv_apply");
502 if (fread(b,length,1,f)!=1) {
503 LDFATAL_FILE("error reading e\n");
505 read_mpbin(&e,b,length);
508 length=KEYFILE_GET(32);
510 LDFATAL("implausibly long (%ld) key comment\n",
513 c=safe_malloc(length+1,"rsapriv_apply");
514 if (fread(c,length,1,f)!=1) {
515 LDFATAL_FILE("error reading key comment\n");
519 /* Check that the next two pairs of characters are identical - the
520 keyfile is not encrypted, so they should be */
522 if (KEYFILE_GET(16) != KEYFILE_GET(16)) {
523 LDFATAL("corrupt keyfile\n");
527 length=(KEYFILE_GET(16)+7)/8;
528 if (length>RSA_MAX_MODBYTES) {
529 LDFATAL("implausibly long (%ld) decryption key\n",
532 b=safe_malloc(length,"rsapriv_apply");
533 if (fread(b,length,1,f)!=1) {
534 LDFATAL_FILE("error reading decryption key\n");
536 read_mpbin(&d,b,length);
538 /* Read iqmp (inverse of q mod p) */
539 length=(KEYFILE_GET(16)+7)/8;
540 if (length>RSA_MAX_MODBYTES) {
541 LDFATAL("implausibly long (%ld)"
542 " iqmp auxiliary value\n", length);
544 b=safe_malloc(length,"rsapriv_apply");
545 if (fread(b,length,1,f)!=1) {
546 LDFATAL_FILE("error reading decryption key\n");
548 read_mpbin(&iqmp,b,length);
550 /* Read q (the smaller of the two primes) */
551 length=(KEYFILE_GET(16)+7)/8;
552 if (length>RSA_MAX_MODBYTES) {
553 LDFATAL("implausibly long (%ld) q value\n",
556 b=safe_malloc(length,"rsapriv_apply");
557 if (fread(b,length,1,f)!=1) {
558 LDFATAL_FILE("error reading q value\n");
560 read_mpbin(&st->q,b,length);
562 /* Read p (the larger of the two primes) */
563 length=(KEYFILE_GET(16)+7)/8;
564 if (length>RSA_MAX_MODBYTES) {
565 LDFATAL("implausibly long (%ld) p value\n",
568 b=safe_malloc(length,"rsapriv_apply");
569 if (fread(b,length,1,f)!=1) {
570 LDFATAL_FILE("error reading p value\n");
572 read_mpbin(&st->p,b,length);
576 fatal_perror("rsa-private (%s:%d): ferror",loc.file,loc.line);
580 * Now verify the validity of the key, and set up the auxiliary
581 * values for fast CRT signing.
584 if (do_validity_check) {
585 /* Verify that p*q is equal to n. */
586 mpz_mul(&tmp, &st->p, &st->q);
587 if (mpz_cmp(&tmp, &st->n) != 0)
591 * Verify that d*e is congruent to 1 mod (p-1), and mod
592 * (q-1). This is equivalent to it being congruent to 1 mod
593 * lambda(n) = lcm(p-1,q-1). The usual `textbook' condition,
594 * that d e == 1 (mod (p-1)(q-1)) is sufficient, but not
595 * actually necessary.
597 mpz_mul(&tmp, &d, &e);
598 mpz_sub_ui(&tmp2, &st->p, 1);
599 mpz_mod(&tmp3, &tmp, &tmp2);
600 if (mpz_cmp_si(&tmp3, 1) != 0)
602 mpz_sub_ui(&tmp2, &st->q, 1);
603 mpz_mod(&tmp3, &tmp, &tmp2);
604 if (mpz_cmp_si(&tmp3, 1) != 0)
607 /* Verify that q*iqmp is congruent to 1 mod p. */
608 mpz_mul(&tmp, &st->q, &iqmp);
609 mpz_mod(&tmp2, &tmp, &st->p);
610 if (mpz_cmp_si(&tmp2, 1) != 0)
613 /* Now we know the key is valid (or we don't care). */
617 * Now we compute auxiliary values dp, dq and w to allow us
618 * to use the CRT optimisation when signing.
620 * dp == d mod (p-1) so that a^dp == a^d mod p, for all a
621 * dq == d mod (q-1) similarly mod q
622 * w == iqmp * q so that w == 0 mod q, and w == 1 mod p
624 mpz_sub_ui(&tmp, &st->p, 1);
625 mpz_mod(&st->dp, &d, &tmp);
626 mpz_sub_ui(&tmp, &st->q, 1);
627 mpz_mod(&st->dq, &d, &tmp);
628 mpz_mul(&st->w, &iqmp, &st->q);
632 LDFATAL("file does not contain a "
651 if (st) rsapriv_dispose(st);
656 static bool_t postreadcheck_tryload(struct load_ctx *l, FILE *f)
659 if (feof(f)) { load_error(l,0,0,"eof mid-integer"); return False; }
663 bool_t rsa1_loadpriv(const struct sigscheme_info *algo,
664 struct buffer_if *privkeydata,
665 struct sigprivkey_if **sigpriv_r,
666 struct log_if *log, struct cloc loc)
669 struct rsapriv *st=0;
671 f=fmemopen(privkeydata->start,privkeydata->size,"r");
673 slilog(log,M_ERR,"failed to fmemopen private key file\n");
677 struct load_ctx l[1];
678 l->what="rsa1priv load";
679 l->verror=verror_tryload;
680 l->postreadcheck=postreadcheck_tryload;
682 l->u.tryload.log=log;
684 st=rsa_loadpriv_core(l,f,loc,False);
685 if (!st) goto error_out;
689 if (st) { free(st); st=0; }
692 if (!st) return False;
697 static bool_t postreadcheck_apply(struct load_ctx *l, FILE *f)
699 cfgfile_postreadcheck(*l->loc,f);
703 static list_t *rsapriv_apply(closure_t *self, struct cloc loc, dict_t *context,
710 struct load_ctx l[1];
712 l->what="rsa-private";
713 l->verror=verror_cfgfatal;
714 l->postreadcheck=postreadcheck_apply;
717 /* Argument is filename pointing to SSH1 private key file */
720 if (i->type!=t_string) {
721 cfgfatal(i->loc,"rsa-private","first argument must be a string\n");
723 filename=i->data.string;
725 filename=NULL; /* Make compiler happy */
726 cfgfatal(i->loc,"rsa-private","you must provide a filename\n");
729 f=fopen(filename,"rb");
731 if (just_check_config) {
732 Message(M_WARNING,"rsa-private (%s:%d): cannot open keyfile "
733 "\"%s\"; assuming it's valid while we check the "
734 "rest of the configuration\n",loc.file,loc.line,filename);
736 fatal_perror("rsa-private (%s:%d): cannot open file \"%s\"",
737 loc.file,loc.line,filename);
741 bool_t do_validity_check=True;
743 if (i && i->type==t_bool && i->data.bool==False) {
744 Message(M_INFO,"rsa-private (%s:%d): skipping RSA key validity "
745 "check\n",loc.file,loc.line);
746 do_validity_check=False;
749 st=rsa_loadpriv_core(l,f,loc,do_validity_check);
751 return new_closure(&st->cl);
754 void rsa_module(dict_t *dict)
756 add_closure(dict,"rsa-private",rsapriv_apply);
757 add_closure(dict,"rsa-public",rsapub_apply);