sys/src/libsec/port/x509.c

   1 #include <u.h>
   2 #include <libc.h>
   3 #include <mp.h>
   4 #include <libsec.h>
   5
   6 /*=============================================================*/
   7 /*  general ASN1 declarations and parsing
   8  *
   9  *  For now, this is used only for extracting the key from an
  10  *  X509 certificate, so the entire collection is hidden.  But
  11  *  someday we should probably make the functions visible and
  12  *  give them their own man page.
  13  */
  14 typedef struct Elem Elem;
  15 typedef struct Tag Tag;
  16 typedef struct Value Value;
  17 typedef struct Bytes Bytes;
  18 typedef struct Ints Ints;
  19 typedef struct Bits Bits;
  20 typedef struct Elist Elist;
  21
  22 /* tag classes */
  23 #define Universal 0
  24 #define Context 0x80
  25
  26 /* universal tags */
  27 #define BOOLEAN 1
  28 #define INTEGER 2
  29 #define BIT_STRING 3
  30 #define OCTET_STRING 4
  31 #define NULLTAG 5
  32 #define OBJECT_ID 6
  33 #define ObjectDescriptor 7
  34 #define EXTERNAL 8
  35 #define REAL 9
  36 #define ENUMERATED 10
  37 #define EMBEDDED_PDV 11
  38 #define UTF8String 12
  39 #define SEQUENCE 16             /* also SEQUENCE OF */
  40 #define SETOF 17                                /* also SETOF OF */
  41 #define NumericString 18
  42 #define PrintableString 19
  43 #define TeletexString 20
  44 #define VideotexString 21
  45 #define IA5String 22
  46 #define UTCTime 23
  47 #define GeneralizedTime 24
  48 #define GraphicString 25
  49 #define VisibleString 26
  50 #define GeneralString 27
  51 #define UniversalString 28
  52 #define BMPString 30
  53
  54 struct Bytes {
  55         int     len;
  56         uchar   data[];
  57 };
  58
  59 struct Ints {
  60         int     len;
  61         int     data[];
  62 };
  63
  64 struct Bits {
  65         int     len;            /* number of bytes */
  66         int     unusedbits;     /* unused bits in last byte */
  67         uchar   data[];         /* most-significant bit first */
  68 };
  69
  70 struct Tag {
  71         int     class;
  72         int     num;
  73 };
  74
  75 enum { VBool, VInt, VOctets, VBigInt, VReal, VOther,
  76         VBitString, VNull, VEOC, VObjId, VString, VSeq, VSet };
  77 struct Value {
  78         int     tag;            /* VBool, etc. */
  79         union {
  80                 int     boolval;
  81                 int     intval;
  82                 Bytes*  octetsval;
  83                 Bytes*  bigintval;
  84                 Bytes*  realval;        /* undecoded; hardly ever used */
  85                 Bytes*  otherval;
  86                 Bits*   bitstringval;
  87                 Ints*   objidval;
  88                 char*   stringval;
  89                 Elist*  seqval;
  90                 Elist*  setval;
  91         } u;  /* (Don't use anonymous unions, for ease of porting) */
  92 };
  93
  94 struct Elem {
  95         Tag     tag;
  96         Value   val;
  97 };
  98
  99 struct Elist {
 100         Elist*  tl;
 101         Elem    hd;
 102 };
 103
 104 /* decoding errors */
 105 enum { ASN_OK, ASN_ESHORT, ASN_ETOOBIG, ASN_EVALLEN,
 106                 ASN_ECONSTR, ASN_EPRIM, ASN_EINVAL, ASN_EUNIMPL };
 107
 108
 109 /* here are the functions to consider making extern someday */
 110 static Bytes*   newbytes(int len);
 111 static Bytes*   makebytes(uchar* buf, int len);
 112 static void     freebytes(Bytes* b);
 113 static Bytes*   catbytes(Bytes* b1, Bytes* b2);
 114 static Ints*    newints(int len);
 115 static Ints*    makeints(int* buf, int len);
 116 static void     freeints(Ints* b);
 117 static Bits*    newbits(int len);
 118 static Bits*    makebits(uchar* buf, int len, int unusedbits);
 119 static void     freebits(Bits* b);
 120 static Elist*   mkel(Elem e, Elist* tail);
 121 static void     freeelist(Elist* el);
 122 static int      elistlen(Elist* el);
 123 static int      is_seq(Elem* pe, Elist** pseq);
 124 static int      is_set(Elem* pe, Elist** pset);
 125 static int      is_int(Elem* pe, int* pint);
 126 static int      is_bigint(Elem* pe, Bytes** pbigint);
 127 static int      is_bitstring(Elem* pe, Bits** pbits);
 128 static int      is_octetstring(Elem* pe, Bytes** poctets);
 129 static int      is_oid(Elem* pe, Ints** poid);
 130 static int      is_string(Elem* pe, char** pstring);
 131 static int      is_time(Elem* pe, char** ptime);
 132 static int      decode(uchar* a, int alen, Elem* pelem);
 133 static int      encode(Elem e, Bytes** pbytes);
 134 static int      oid_lookup(Ints* o, Ints** tab);
 135 static void     freevalfields(Value* v);
 136 static mpint    *asn1mpint(Elem *e);
 137 static void     edump(Elem);
 138
 139 #define TAG_MASK 0x1F
 140 #define CONSTR_MASK 0x20
 141 #define CLASS_MASK 0xC0
 142 #define MAXOBJIDLEN 20
 143
 144 static int ber_decode(uchar** pp, uchar* pend, Elem* pelem);
 145 static int tag_decode(uchar** pp, uchar* pend, Tag* ptag, int* pisconstr);
 146 static int length_decode(uchar** pp, uchar* pend, int* plength);
 147 static int value_decode(uchar** pp, uchar* pend, int length, int kind, int isconstr, Value* pval);
 148 static int int_decode(uchar** pp, uchar* pend, int count, int unsgned, int* pint);
 149 static int uint7_decode(uchar** pp, uchar* pend, int* pint);
 150 static int octet_decode(uchar** pp, uchar* pend, int length, int isconstr, Bytes** pbytes);
 151 static int seq_decode(uchar** pp, uchar* pend, int length, int isconstr, Elist** pelist);
 152 static int enc(uchar** pp, Elem e, int lenonly);
 153 static int val_enc(uchar** pp, Elem e, int *pconstr, int lenonly);
 154 static void uint7_enc(uchar** pp, int num, int lenonly);
 155 static void int_enc(uchar** pp, int num, int unsgned, int lenonly);
 156
 157 static void *
 158 emalloc(int n)
 159 {
 160         void *p;
 161         if(n==0)
 162                 n=1;
 163         p = malloc(n);
 164         if(p == nil)
 165                 sysfatal("out of memory");
 166         memset(p, 0, n);
 167         setmalloctag(p, getcallerpc(&n));
 168         return p;
 169 }
 170
 171 static char*
 172 estrdup(char *s)
 173 {
 174         char *d;
 175         int n;
 176
 177         n = strlen(s)+1;
 178         d = emalloc(n);
 179         memmove(d, s, n);
 180         return d;
 181 }
 182
 183
 184 /*
 185  * Decode a[0..len] as a BER encoding of an ASN1 type.
 186  * The return value is one of ASN_OK, etc.
 187  * Depending on the error, the returned elem may or may not
 188  * be nil.
 189  */
 190 static int
 191 decode(uchar* a, int alen, Elem* pelem)
 192 {
 193         uchar* p = a;
 194         int err;
 195
 196         err = ber_decode(&p, &a[alen], pelem);
 197         if(err == ASN_OK && p != &a[alen])
 198                 err = ASN_EVALLEN;
 199         return err;
 200 }
 201
 202 /*
 203  * All of the following decoding routines take arguments:
 204  *      uchar **pp;
 205  *      uchar *pend;
 206  * Where parsing is supposed to start at **pp, and when parsing
 207  * is done, *pp is updated to point at next char to be parsed.
 208  * The pend pointer is just past end of string; an error should
 209  * be returned parsing hasn't finished by then.
 210  *
 211  * The returned int is ASN_OK if all went fine, else ASN_ESHORT, etc.
 212  * The remaining argument(s) are pointers to where parsed entity goes.
 213  */
 214
 215 /* Decode an ASN1 'Elem' (tag, length, value) */
 216 static int
 217 ber_decode(uchar** pp, uchar* pend, Elem* pelem)
 218 {
 219         int err;
 220         int isconstr;
 221         int length;
 222         Tag tag;
 223         Value val;
 224
 225         memset(pelem, 0, sizeof(*pelem));
 226         err = tag_decode(pp, pend, &tag, &isconstr);
 227         if(err == ASN_OK) {
 228                 err = length_decode(pp, pend, &length);
 229                 if(err == ASN_OK) {
 230                         if(tag.class == Universal)
 231                                 err = value_decode(pp, pend, length, tag.num, isconstr, &val);
 232                         else
 233                                 err = value_decode(pp, pend, length, OCTET_STRING, 0, &val);
 234                         if(err == ASN_OK) {
 235                                 pelem->tag = tag;
 236                                 pelem->val = val;
 237                         }
 238                 }
 239         }
 240         return err;
 241 }
 242
 243 /* Decode a tag field */
 244 static int
 245 tag_decode(uchar** pp, uchar* pend, Tag* ptag, int* pisconstr)
 246 {
 247         int err;
 248         int v;
 249         uchar* p;
 250
 251         err = ASN_OK;
 252         p = *pp;
 253         if(pend-p >= 2) {
 254                 v = *p++;
 255                 ptag->class = v&CLASS_MASK;
 256                 if(v&CONSTR_MASK)
 257                         *pisconstr = 1;
 258                 else
 259                         *pisconstr = 0;
 260                 v &= TAG_MASK;
 261                 if(v == TAG_MASK)
 262                         err = uint7_decode(&p, pend, &v);
 263                 ptag->num = v;
 264         }
 265         else
 266                 err = ASN_ESHORT;
 267         *pp = p;
 268         return err;
 269 }
 270
 271 /* Decode a length field */
 272 static int
 273 length_decode(uchar** pp, uchar* pend, int* plength)
 274 {
 275         int err;
 276         int num;
 277         int v;
 278         uchar* p;
 279
 280         err = ASN_OK;
 281         num = 0;
 282         p = *pp;
 283         if(p < pend) {
 284                 v = *p++;
 285                 if(v&0x80)
 286                         err = int_decode(&p, pend, v&0x7F, 1, &num);
 287                 else
 288                         num = v;
 289         }
 290         else
 291                 err = ASN_ESHORT;
 292         *pp = p;
 293         *plength = num;
 294         return err;
 295 }
 296
 297 /* Decode a value field  */
 298 static int
 299 value_decode(uchar** pp, uchar* pend, int length, int kind, int isconstr, Value* pval)
 300 {
 301         int err;
 302         Bytes* va;
 303         int num;
 304         int bitsunused;
 305         int subids[MAXOBJIDLEN];
 306         int isubid;
 307         Elist*  vl;
 308         uchar* p;
 309         uchar* pe;
 310
 311         err = ASN_OK;
 312         p = *pp;
 313         if(length == -1) {      /* "indefinite" length spec */
 314                 if(!isconstr)
 315                         err = ASN_EINVAL;
 316         }
 317         else if(p + length > pend)
 318                 err = ASN_EVALLEN;
 319         if(err != ASN_OK)
 320                 return err;
 321
 322         switch(kind) {
 323         case 0:
 324                 /* marker for end of indefinite constructions */
 325                 if(length == 0)
 326                         pval->tag = VNull;
 327                 else
 328                         err = ASN_EINVAL;
 329                 break;
 330
 331         case BOOLEAN:
 332                 if(isconstr)
 333                         err = ASN_ECONSTR;
 334                 else if(length != 1)
 335                         err = ASN_EVALLEN;
 336                 else {
 337                         pval->tag = VBool;
 338                         pval->u.boolval = (*p++ != 0);
 339                 }
 340                 break;
 341
 342         case INTEGER:
 343         case ENUMERATED:
 344                 if(isconstr)
 345                         err = ASN_ECONSTR;
 346                 else if(length <= 4) {
 347                         err = int_decode(&p, pend, length, 0, &num);
 348                         if(err == ASN_OK) {
 349                                 pval->tag = VInt;
 350                                 pval->u.intval = num;
 351                         }
 352                 }
 353                 else {
 354                         pval->tag = VBigInt;
 355                         pval->u.bigintval = makebytes(p, length);
 356                         p += length;
 357                 }
 358                 break;
 359
 360         case BIT_STRING:
 361                 pval->tag = VBitString;
 362                 if(isconstr) {
 363                         if(length == -1 && p + 2 <= pend && *p == 0 && *(p+1) ==0) {
 364                                 pval->u.bitstringval = makebits(0, 0, 0);
 365                                 p += 2;
 366                         }
 367                         else    /* TODO: recurse and concat results */
 368                                 err = ASN_EUNIMPL;
 369                 }
 370                 else {
 371                         if(length < 2) {
 372                                 if(length == 1 && *p == 0) {
 373                                         pval->u.bitstringval = makebits(0, 0, 0);
 374                                         p++;
 375                                 }
 376                                 else
 377                                         err = ASN_EINVAL;
 378                         }
 379                         else {
 380                                 bitsunused = *p;
 381                                 if(bitsunused > 7)
 382                                         err = ASN_EINVAL;
 383                                 else if(length > 0x0FFFFFFF)
 384                                         err = ASN_ETOOBIG;
 385                                 else {
 386                                         pval->u.bitstringval = makebits(p+1, length-1, bitsunused);
 387                                         p += length;
 388                                 }
 389                         }
 390                 }
 391                 break;
 392
 393         case OCTET_STRING:
 394         case ObjectDescriptor:
 395                 err = octet_decode(&p, pend, length, isconstr, &va);
 396                 if(err == ASN_OK) {
 397                         pval->tag = VOctets;
 398                         pval->u.octetsval = va;
 399                 }
 400                 break;
 401
 402         case NULLTAG:
 403                 if(isconstr)
 404                         err = ASN_ECONSTR;
 405                 else if(length != 0)
 406                         err = ASN_EVALLEN;
 407                 else
 408                         pval->tag = VNull;
 409                 break;
 410
 411         case OBJECT_ID:
 412                 if(isconstr)
 413                         err = ASN_ECONSTR;
 414                 else if(length == 0)
 415                         err = ASN_EVALLEN;
 416                 else {
 417                         isubid = 0;
 418                         pe = p+length;
 419                         while(p < pe && isubid < MAXOBJIDLEN) {
 420                                 err = uint7_decode(&p, pend, &num);
 421                                 if(err != ASN_OK)
 422                                         break;
 423                                 if(isubid == 0) {
 424                                         subids[isubid++] = num / 40;
 425                                         subids[isubid++] = num % 40;
 426                                 }
 427                                 else
 428                                         subids[isubid++] = num;
 429                         }
 430                         if(err == ASN_OK) {
 431                                 if(p != pe)
 432                                         err = ASN_EVALLEN;
 433                                 else {
 434                                         pval->tag = VObjId;
 435                                         pval->u.objidval = makeints(subids, isubid);
 436                                 }
 437                         }
 438                 }
 439                 break;
 440
 441         case EXTERNAL:
 442         case EMBEDDED_PDV:
 443                 /* TODO: parse this internally */
 444                 if(p+length > pend)
 445                         err = ASN_EVALLEN;
 446                 else {
 447                         pval->tag = VOther;
 448                         pval->u.otherval = makebytes(p, length);
 449                         p += length;
 450                 }
 451                 break;
 452
 453         case REAL:
 454                 /* Let the application decode */
 455                 if(isconstr)
 456                         err = ASN_ECONSTR;
 457                 else if(p+length > pend)
 458                         err = ASN_EVALLEN;
 459                 else {
 460                         pval->tag = VReal;
 461                         pval->u.realval = makebytes(p, length);
 462                         p += length;
 463                 }
 464                 break;
 465
 466         case SEQUENCE:
 467                 err = seq_decode(&p, pend, length, isconstr, &vl);
 468                 if(err == ASN_OK) {
 469                         pval->tag = VSeq ;
 470                         pval->u.seqval = vl;
 471                 }
 472                 break;
 473
 474         case SETOF:
 475                 err = seq_decode(&p, pend, length, isconstr, &vl);
 476                 if(err == ASN_OK) {
 477                         pval->tag = VSet;
 478                         pval->u.setval = vl;
 479                 }
 480                 break;
 481
 482         case UTF8String:
 483         case NumericString:
 484         case PrintableString:
 485         case TeletexString:
 486         case VideotexString:
 487         case IA5String:
 488         case UTCTime:
 489         case GeneralizedTime:
 490         case GraphicString:
 491         case VisibleString:
 492         case GeneralString:
 493         case UniversalString:
 494         case BMPString:
 495                 err = octet_decode(&p, pend, length, isconstr, &va);
 496                 if(err == ASN_OK) {
 497                         uchar *s;
 498                         char *d;
 499                         Rune r;
 500                         int n;
 501
 502                         switch(kind){
 503                         case UniversalString:
 504                                 n = va->len / 4;
 505                                 d = emalloc(n*UTFmax+1);
 506                                 pval->u.stringval = d;
 507                                 s = va->data;
 508                                 while(n > 0){
 509                                         r = s[0]<<24 | s[1]<<16 | s[2]<<8 | s[3];
 510                                         if(r == 0)
 511                                                 break;
 512                                         n--;
 513                                         s += 4;
 514                                         d += runetochar(d, &r);
 515                                 }
 516                                 *d = 0;
 517                                 break;
 518                         case BMPString:
 519                                 n = va->len / 2;
 520                                 d = emalloc(n*UTFmax+1);
 521                                 pval->u.stringval = d;
 522                                 s = va->data;
 523                                 while(n > 0){
 524                                         r = s[0]<<8 | s[1];
 525                                         if(r == 0)
 526                                                 break;
 527                                         n--;
 528                                         s += 2;
 529                                         d += runetochar(d, &r);
 530                                 }
 531                                 *d = 0;
 532                                 break;
 533                         default:
 534                                 n = va->len;
 535                                 d = emalloc(n+1);
 536                                 pval->u.stringval = d;
 537                                 s = va->data;
 538                                 while(n > 0){
 539                                         if((*d = *s) == 0)
 540                                                 break;
 541                                         n--;
 542                                         s++;
 543                                         d++;
 544                                 }
 545                                 *d = 0;
 546                                 break;
 547                         }
 548                         if(n != 0){
 549                                 err = ASN_EINVAL;
 550                                 free(pval->u.stringval);
 551                         } else
 552                                 pval->tag = VString;
 553                         free(va);
 554                 }
 555                 break;
 556
 557         default:
 558                 if(p+length > pend)
 559                         err = ASN_EVALLEN;
 560                 else {
 561                         pval->tag = VOther;
 562                         pval->u.otherval = makebytes(p, length);
 563                         p += length;
 564                 }
 565                 break;
 566         }
 567         *pp = p;
 568         return err;
 569 }
 570
 571 /*
 572  * Decode an int in format where count bytes are
 573  * concatenated to form value.
 574  * Although ASN1 allows any size integer, we return
 575  * an error if the result doesn't fit in a 32-bit int.
 576  * If unsgned is not set, make sure to propagate sign bit.
 577  */
 578 static int
 579 int_decode(uchar** pp, uchar* pend, int count, int unsgned, int* pint)
 580 {
 581         int err;
 582         int num;
 583         uchar* p;
 584
 585         p = *pp;
 586         err = ASN_OK;
 587         num = 0;
 588         if(p+count <= pend) {
 589                 if((count > 4) || (unsgned && count == 4 && (*p&0x80)))
 590                         err = ASN_ETOOBIG;
 591                 else {
 592                         if(!unsgned && count > 0 && count < 4 && (*p&0x80))
 593                                 num = -1;       /* set all bits, initially */
 594                         while(count--)
 595                                 num = (num << 8)|(*p++);
 596                 }
 597         }
 598         else
 599                 err = ASN_ESHORT;
 600         *pint = num;
 601         *pp = p;
 602         return err;
 603 }
 604
 605 /*
 606  * Decode an unsigned int in format where each
 607  * byte except last has high bit set, and remaining
 608  * seven bits of each byte are concatenated to form value.
 609  * Although ASN1 allows any size integer, we return
 610  * an error if the result doesn't fit in a 32 bit int.
 611  */
 612 static int
 613 uint7_decode(uchar** pp, uchar* pend, int* pint)
 614 {
 615         int err;
 616         int num;
 617         int more;
 618         int v;
 619         uchar* p;
 620
 621         p = *pp;
 622         err = ASN_OK;
 623         num = 0;
 624         more = 1;
 625         while(more && p < pend) {
 626                 v = *p++;
 627                 if(num&0x7F000000) {
 628                         err = ASN_ETOOBIG;
 629                         break;
 630                 }
 631                 num <<= 7;
 632                 more = v&0x80;
 633                 num |= (v&0x7F);
 634         }
 635         if(p == pend)
 636                 err = ASN_ESHORT;
 637         *pint = num;
 638         *pp = p;
 639         return err;
 640 }
 641
 642 /*
 643  * Decode an octet string, recursively if isconstr.
 644  * We've already checked that length==-1 implies isconstr==1,
 645  * and otherwise that specified length fits within (*pp..pend)
 646  */
 647 static int
 648 octet_decode(uchar** pp, uchar* pend, int length, int isconstr, Bytes** pbytes)
 649 {
 650         int err;
 651         uchar* p;
 652         Bytes* ans;
 653         Bytes* newans;
 654         uchar* pstart;
 655         uchar* pold;
 656         Elem    elem;
 657
 658         err = ASN_OK;
 659         p = *pp;
 660         ans = nil;
 661         if(length >= 0 && !isconstr) {
 662                 ans = makebytes(p, length);
 663                 p += length;
 664         }
 665         else {
 666                 /* constructed, either definite or indefinite length */
 667                 pstart = p;
 668                 for(;;) {
 669                         if(length >= 0 && p >= pstart + length) {
 670                                 if(p != pstart + length)
 671                                         err = ASN_EVALLEN;
 672                                 break;
 673                         }
 674                         pold = p;
 675                         err = ber_decode(&p, pend, &elem);
 676                         if(err != ASN_OK)
 677                                 break;
 678                         switch(elem.val.tag) {
 679                         case VOctets:
 680                                 newans = catbytes(ans, elem.val.u.octetsval);
 681                                 freevalfields(&elem.val);
 682                                 freebytes(ans);
 683                                 ans = newans;
 684                                 break;
 685
 686                         case VEOC:
 687                                 if(length == -1)
 688                                         goto cloop_done;
 689                                 /* no break */
 690                         default:
 691                                 freevalfields(&elem.val);
 692                                 p = pold;
 693                                 err = ASN_EINVAL;
 694                                 goto cloop_done;
 695                         }
 696                 }
 697 cloop_done:
 698                 if(err != ASN_OK){
 699                         freebytes(ans);
 700                         ans = nil;
 701                 }
 702         }
 703         *pp = p;
 704         *pbytes = ans;
 705         return err;
 706 }
 707
 708 /*
 709  * Decode a sequence or set.
 710  * We've already checked that length==-1 implies isconstr==1,
 711  * and otherwise that specified length fits within (*p..pend)
 712  */
 713 static int
 714 seq_decode(uchar** pp, uchar* pend, int length, int isconstr, Elist** pelist)
 715 {
 716         int err;
 717         uchar* p;
 718         uchar* pstart;
 719         uchar* pold;
 720         Elist* ans;
 721         Elem elem;
 722         Elist* lve;
 723         Elist* lveold;
 724
 725         err = ASN_OK;
 726         ans = nil;
 727         p = *pp;
 728         if(!isconstr)
 729                 err = ASN_EPRIM;
 730         else {
 731                 /* constructed, either definite or indefinite length */
 732                 lve = nil;
 733                 pstart = p;
 734                 for(;;) {
 735                         if(length >= 0 && p >= pstart + length) {
 736                                 if(p != pstart + length)
 737                                         err = ASN_EVALLEN;
 738                                 break;
 739                         }
 740                         pold = p;
 741                         err = ber_decode(&p, pend, &elem);
 742                         if(err != ASN_OK)
 743                                 break;
 744                         if(elem.val.tag == VEOC) {
 745                                 if(length != -1) {
 746                                         p = pold;
 747                                         err = ASN_EINVAL;
 748                                 }
 749                                 break;
 750                         }
 751                         else
 752                                 lve = mkel(elem, lve);
 753                 }
 754                 if(err != ASN_OK)
 755                         freeelist(lve);
 756                 else {
 757                         /* reverse back to original order */
 758                         while(lve != nil) {
 759                                 lveold = lve;
 760                                 lve = lve->tl;
 761                                 lveold->tl = ans;
 762                                 ans = lveold;
 763                         }
 764                 }
 765         }
 766         *pp = p;
 767         *pelist = ans;
 768         return err;
 769 }
 770
 771 /*
 772  * Encode e by BER rules, putting answer in *pbytes.
 773  * This is done by first calling enc with lenonly==1
 774  * to get the length of the needed buffer,
 775  * then allocating the buffer and using enc again to fill it up.
 776  */
 777 static int
 778 encode(Elem e, Bytes** pbytes)
 779 {
 780         uchar* p;
 781         Bytes* ans;
 782         int err;
 783         uchar uc;
 784
 785         p = &uc;
 786         err = enc(&p, e, 1);
 787         if(err == ASN_OK) {
 788                 ans = newbytes(p-&uc);
 789                 p = ans->data;
 790                 err = enc(&p, e, 0);
 791                 *pbytes = ans;
 792         }
 793         return err;
 794 }
 795
 796 /*
 797  * The various enc functions take a pointer to a pointer
 798  * into a buffer, and encode their entity starting there,
 799  * updating the pointer afterwards.
 800  * If lenonly is 1, only the pointer update is done,
 801  * allowing enc to be called first to calculate the needed
 802  * buffer length.
 803  * If lenonly is 0, it is assumed that the answer will fit.
 804  */
 805
 806 static int
 807 enc(uchar** pp, Elem e, int lenonly)
 808 {
 809         int err;
 810         int vlen;
 811         int constr;
 812         Tag tag;
 813         int v;
 814         int ilen;
 815         uchar* p;
 816         uchar* psave;
 817
 818         p = *pp;
 819         err = val_enc(&p, e, &constr, 1);
 820         if(err != ASN_OK)
 821                 return err;
 822         vlen = p - *pp;
 823         p = *pp;
 824         tag = e.tag;
 825         v = tag.class|constr;
 826         if(tag.num < 31) {
 827                 if(!lenonly)
 828                         *p = (v|tag.num);
 829                 p++;
 830         }
 831         else {
 832                 if(!lenonly)
 833                         *p = (v|31);
 834                 p++;
 835                 if(tag.num < 0)
 836                         return ASN_EINVAL;
 837                 uint7_enc(&p, tag.num, lenonly);
 838         }
 839         if(vlen < 0x80) {
 840                 if(!lenonly)
 841                         *p = vlen;
 842                 p++;
 843         }
 844         else {
 845                 psave = p;
 846                 int_enc(&p, vlen, 1, 1);
 847                 ilen = p-psave;
 848                 p = psave;
 849                 if(!lenonly) {
 850                         *p++ = (0x80 | ilen);
 851                         int_enc(&p, vlen, 1, 0);
 852                 }
 853                 else
 854                         p += 1 + ilen;
 855         }
 856         if(!lenonly)
 857                 val_enc(&p, e, &constr, 0);
 858         else
 859                 p += vlen;
 860         *pp = p;
 861         return err;
 862 }
 863
 864 static int
 865 val_enc(uchar** pp, Elem e, int *pconstr, int lenonly)
 866 {
 867         int err;
 868         uchar* p;
 869         int kind;
 870         int cl;
 871         int v;
 872         Bytes* bb = nil;
 873         Bits* bits;
 874         Ints* oid;
 875         int k;
 876         Elist* el;
 877         char* s;
 878
 879         p = *pp;
 880         err = ASN_OK;
 881         kind = e.tag.num;
 882         cl = e.tag.class;
 883         *pconstr = 0;
 884         if(cl != Universal) {
 885                 switch(e.val.tag) {
 886                 case VBool:
 887                         kind = BOOLEAN;
 888                         break;
 889                 case VInt:
 890                         kind = INTEGER;
 891                         break;
 892                 case VBigInt:
 893                         kind = INTEGER;
 894                         break;
 895                 case VOctets:
 896                         kind = OCTET_STRING;
 897                         break;
 898                 case VReal:
 899                         kind = REAL;
 900                         break;
 901                 case VOther:
 902                         kind = OCTET_STRING;
 903                         break;
 904                 case VBitString:
 905                         kind = BIT_STRING;
 906                         break;
 907                 case VNull:
 908                         kind = NULLTAG;
 909                         break;
 910                 case VObjId:
 911                         kind = OBJECT_ID;
 912                         break;
 913                 case VString:
 914                         kind = UniversalString;
 915                         break;
 916                 case VSeq:
 917                         kind = SEQUENCE;
 918                         break;
 919                 case VSet:
 920                         kind = SETOF;
 921                         break;
 922                 }
 923         }
 924         switch(kind) {
 925         case BOOLEAN:
 926                 if(is_int(&e, &v)) {
 927                         if(v != 0)
 928                                 v = 255;
 929                          int_enc(&p, v, 1, lenonly);
 930                 }
 931                 else
 932                         err = ASN_EINVAL;
 933                 break;
 934
 935         case INTEGER:
 936         case ENUMERATED:
 937                 if(is_int(&e, &v))
 938                         int_enc(&p, v, 0, lenonly);
 939                 else {
 940                         if(is_bigint(&e, &bb)) {
 941                                 if(!lenonly)
 942                                         memmove(p, bb->data, bb->len);
 943                                 p += bb->len;
 944                         }
 945                         else
 946                                 err = ASN_EINVAL;
 947                 }
 948                 break;
 949
 950         case BIT_STRING:
 951                 if(is_bitstring(&e, &bits)) {
 952                         if(bits->len == 0) {
 953                                 if(!lenonly)
 954                                         *p = 0;
 955                                 p++;
 956                         }
 957                         else {
 958                                 v = bits->unusedbits;
 959                                 if(v < 0 || v > 7)
 960                                         err = ASN_EINVAL;
 961                                 else {
 962                                         if(!lenonly) {
 963                                                 *p = v;
 964                                                 memmove(p+1, bits->data, bits->len);
 965                                         }
 966                                         p += 1 + bits->len;
 967                                 }
 968                         }
 969                 }
 970                 else
 971                         err = ASN_EINVAL;
 972                 break;
 973
 974         case OCTET_STRING:
 975         case ObjectDescriptor:
 976         case EXTERNAL:
 977         case REAL:
 978         case EMBEDDED_PDV:
 979                 bb = nil;
 980                 switch(e.val.tag) {
 981                 case VOctets:
 982                         bb = e.val.u.octetsval;
 983                         break;
 984                 case VReal:
 985                         bb = e.val.u.realval;
 986                         break;
 987                 case VOther:
 988                         bb = e.val.u.otherval;
 989                         break;
 990                 }
 991                 if(bb != nil) {
 992                         if(!lenonly)
 993                                 memmove(p, bb->data, bb->len);
 994                         p += bb->len;
 995                 }
 996                 else
 997                         err = ASN_EINVAL;
 998                 break;
 999
1000         case NULLTAG:
1001                 break;
1002
1003         case OBJECT_ID:
1004                 if(is_oid(&e, &oid)) {
1005                         for(k = 0; k < oid->len; k++) {
1006                                 v = oid->data[k];
1007                                 if(k == 0) {
1008                                         v *= 40;
1009                                         if(oid->len > 1)
1010                                                 v += oid->data[++k];
1011                                 }
1012                                 uint7_enc(&p, v, lenonly);
1013                         }
1014                 }
1015                 else
1016                         err = ASN_EINVAL;
1017                 break;
1018
1019         case SEQUENCE:
1020         case SETOF:
1021                 el = nil;
1022                 if(e.val.tag == VSeq)
1023                         el = e.val.u.seqval;
1024                 else if(e.val.tag == VSet)
1025                         el = e.val.u.setval;
1026                 else
1027                         err = ASN_EINVAL;
1028                 if(el != nil) {
1029                         *pconstr = CONSTR_MASK;
1030                         for(; el != nil; el = el->tl) {
1031                                 err = enc(&p, el->hd, lenonly);
1032                                 if(err != ASN_OK)
1033                                         break;
1034                         }
1035                 }
1036                 break;
1037
1038         case UTF8String:
1039         case NumericString:
1040         case PrintableString:
1041         case TeletexString:
1042         case VideotexString:
1043         case IA5String:
1044         case UTCTime:
1045         case GeneralizedTime:
1046         case GraphicString:
1047         case VisibleString:
1048         case GeneralString:
1049         case UniversalString:
1050         case BMPString:
1051                 if(e.val.tag == VString) {
1052                         s = e.val.u.stringval;
1053                         if(s != nil) {
1054                                 v = strlen(s);
1055                                 if(!lenonly)
1056                                         memmove(p, s, v);
1057                                 p += v;
1058                         }
1059                 }
1060                 else
1061                         err = ASN_EINVAL;
1062                 break;
1063
1064         default:
1065                 err = ASN_EINVAL;
1066         }
1067         *pp = p;
1068         return err;
1069 }
1070
1071 /*
1072  * Encode num as unsigned 7 bit values with top bit 1 on all bytes
1073  * except last, only putting in bytes if !lenonly.
1074  */
1075 static void
1076 uint7_enc(uchar** pp, int num, int lenonly)
1077 {
1078         int n;
1079         int v;
1080         int k;
1081         uchar* p;
1082
1083         p = *pp;
1084         n = 1;
1085         v = num >> 7;
1086         while(v > 0) {
1087                 v >>= 7;
1088                 n++;
1089         }
1090         if(lenonly)
1091                 p += n;
1092         else {
1093                 for(k = (n - 1)*7; k > 0; k -= 7)
1094                         *p++= ((num >> k)|0x80);
1095                 *p++ = (num&0x7F);
1096         }
1097         *pp = p;
1098 }
1099
1100 /*
1101  * Encode num as unsigned or signed integer,
1102  * only putting in bytes if !lenonly.
1103  * Encoding is length followed by bytes to concatenate.
1104  */
1105 static void
1106 int_enc(uchar** pp, int num, int unsgned, int lenonly)
1107 {
1108         int v;
1109         int n;
1110         int prevv;
1111         int k;
1112         uchar* p;
1113
1114         p = *pp;
1115         v = num;
1116         if(v < 0)
1117                 v = -(v + 1);
1118         n = 1;
1119         prevv = v;
1120         v >>= 8;
1121         while(v > 0) {
1122                 prevv = v;
1123                 v >>= 8;
1124                 n++;
1125         }
1126         if(!unsgned && (prevv&0x80))
1127                 n++;
1128         if(lenonly)
1129                 p += n;
1130         else {
1131                 for(k = (n - 1)*8; k >= 0; k -= 8)
1132                         *p++ = (num >> k);
1133         }
1134         *pp = p;
1135 }
1136
1137 static int
1138 ints_eq(Ints* a, Ints* b)
1139 {
1140         int     alen;
1141         int     i;
1142
1143         alen = a->len;
1144         if(alen != b->len)
1145                 return 0;
1146         for(i = 0; i < alen; i++)
1147                 if(a->data[i] != b->data[i])
1148                         return 0;
1149         return 1;
1150 }
1151
1152 /*
1153  * Look up o in tab (which must have nil entry to terminate).
1154  * Return index of matching entry, or -1 if none.
1155  */
1156 static int
1157 oid_lookup(Ints* o, Ints** tab)
1158 {
1159         int i;
1160
1161         for(i = 0; tab[i] != nil; i++)
1162                 if(ints_eq(o, tab[i]))
1163                         return  i;
1164         return -1;
1165 }
1166
1167 /*
1168  * Return true if *pe is a SEQUENCE, and set *pseq to
1169  * the value of the sequence if so.
1170  */
1171 static int
1172 is_seq(Elem* pe, Elist** pseq)
1173 {
1174         if(pe->tag.class == Universal && pe->tag.num == SEQUENCE && pe->val.tag == VSeq) {
1175                 *pseq = pe->val.u.seqval;
1176                 return 1;
1177         }
1178         return 0;
1179 }
1180
1181 static int
1182 is_set(Elem* pe, Elist** pset)
1183 {
1184         if(pe->tag.class == Universal && pe->tag.num == SETOF && pe->val.tag == VSet) {
1185                 *pset = pe->val.u.setval;
1186                 return 1;
1187         }
1188         return 0;
1189 }
1190
1191 static int
1192 is_int(Elem* pe, int* pint)
1193 {
1194         if(pe->tag.class == Universal) {
1195                 if(pe->tag.num == INTEGER && pe->val.tag == VInt) {
1196                         *pint = pe->val.u.intval;
1197                         return 1;
1198                 }
1199                 else if(pe->tag.num == BOOLEAN && pe->val.tag == VBool) {
1200                         *pint = pe->val.u.boolval;
1201                         return 1;
1202                 }
1203         }
1204         return 0;
1205 }
1206
1207 /*
1208  * for convience, all VInt's are readable via this routine,
1209  * as well as all VBigInt's
1210  */
1211 static int
1212 is_bigint(Elem* pe, Bytes** pbigint)
1213 {
1214         if(pe->tag.class == Universal && pe->tag.num == INTEGER && pe->val.tag == VBigInt) {
1215                 *pbigint = pe->val.u.bigintval;
1216                 return 1;
1217         }
1218         return 0;
1219 }
1220
1221 static int
1222 is_bitstring(Elem* pe, Bits** pbits)
1223 {
1224         if(pe->tag.class == Universal && pe->tag.num == BIT_STRING && pe->val.tag == VBitString) {
1225                 *pbits = pe->val.u.bitstringval;
1226                 return 1;
1227         }
1228         return 0;
1229 }
1230
1231 static int
1232 is_octetstring(Elem* pe, Bytes** poctets)
1233 {
1234         if(pe->tag.class == Universal && pe->tag.num == OCTET_STRING && pe->val.tag == VOctets) {
1235                 *poctets = pe->val.u.octetsval;
1236                 return 1;
1237         }
1238         return 0;
1239 }
1240
1241 static int
1242 is_oid(Elem* pe, Ints** poid)
1243 {
1244         if(pe->tag.class == Universal && pe->tag.num == OBJECT_ID && pe->val.tag == VObjId) {
1245                 *poid = pe->val.u.objidval;
1246                 return 1;
1247         }
1248         return 0;
1249 }
1250
1251 static int
1252 is_string(Elem* pe, char** pstring)
1253 {
1254         if(pe->tag.class == Universal) {
1255                 switch(pe->tag.num) {
1256                 case UTF8String:
1257                 case NumericString:
1258                 case PrintableString:
1259                 case TeletexString:
1260                 case VideotexString:
1261                 case IA5String:
1262                 case GraphicString:
1263                 case VisibleString:
1264                 case GeneralString:
1265                 case UniversalString:
1266                 case BMPString:
1267                         if(pe->val.tag == VString) {
1268                                 *pstring = pe->val.u.stringval;
1269                                 return 1;
1270                         }
1271                 }
1272         }
1273         return 0;
1274 }
1275
1276 static int
1277 is_time(Elem* pe, char** ptime)
1278 {
1279         if(pe->tag.class == Universal
1280            && (pe->tag.num == UTCTime || pe->tag.num == GeneralizedTime)
1281            && pe->val.tag == VString) {
1282                 *ptime = pe->val.u.stringval;
1283                 return 1;
1284         }
1285         return 0;
1286 }
1287
1288
1289 /*
1290  * malloc and return a new Bytes structure capable of
1291  * holding len bytes. (len >= 0)
1292  */
1293 static Bytes*
1294 newbytes(int len)
1295 {
1296         Bytes* ans;
1297
1298         if(len < 0)
1299                 abort();
1300         ans = emalloc(sizeof(Bytes) + len);
1301         ans->len = len;
1302         return ans;
1303 }
1304
1305 /*
1306  * newbytes(len), with data initialized from buf
1307  */
1308 static Bytes*
1309 makebytes(uchar* buf, int len)
1310 {
1311         Bytes* ans;
1312
1313         ans = newbytes(len);
1314         memmove(ans->data, buf, len);
1315         return ans;
1316 }
1317
1318 static void
1319 freebytes(Bytes* b)
1320 {
1321         free(b);
1322 }
1323
1324 /*
1325  * Make a new Bytes, containing bytes of b1 followed by those of b2.
1326  * Either b1 or b2 or both can be nil.
1327  */
1328 static Bytes*
1329 catbytes(Bytes* b1, Bytes* b2)
1330 {
1331         Bytes* ans;
1332         int n;
1333
1334         if(b1 == nil) {
1335                 if(b2 == nil)
1336                         ans = newbytes(0);
1337                 else
1338                         ans = makebytes(b2->data, b2->len);
1339         }
1340         else if(b2 == nil) {
1341                 ans = makebytes(b1->data, b1->len);
1342         }
1343         else {
1344                 n = b1->len + b2->len;
1345                 ans = newbytes(n);
1346                 ans->len = n;
1347                 memmove(ans->data, b1->data, b1->len);
1348                 memmove(ans->data+b1->len, b2->data, b2->len);
1349         }
1350         return ans;
1351 }
1352
1353 /* len is number of ints */
1354 static Ints*
1355 newints(int len)
1356 {
1357         Ints* ans;
1358
1359         if(len < 0 || len > ((uint)-1>>1)/sizeof(int))
1360                 abort();
1361         ans = emalloc(sizeof(Ints) + len*sizeof(int));
1362         ans->len = len;
1363         return ans;
1364 }
1365
1366 static Ints*
1367 makeints(int* buf, int len)
1368 {
1369         Ints* ans;
1370
1371         ans = newints(len);
1372         memmove(ans->data, buf, len*sizeof(int));
1373         return ans;
1374 }
1375
1376 static void
1377 freeints(Ints* b)
1378 {
1379         free(b);
1380 }
1381
1382 /* len is number of bytes */
1383 static Bits*
1384 newbits(int len)
1385 {
1386         Bits* ans;
1387
1388         if(len < 0)
1389                 abort();
1390         ans = emalloc(sizeof(Bits) + len);
1391         ans->len = len;
1392         ans->unusedbits = 0;
1393         return ans;
1394 }
1395
1396 static Bits*
1397 makebits(uchar* buf, int len, int unusedbits)
1398 {
1399         Bits* ans;
1400
1401         ans = newbits(len);
1402         memmove(ans->data, buf, len);
1403         ans->unusedbits = unusedbits;
1404         return ans;
1405 }
1406
1407 static void
1408 freebits(Bits* b)
1409 {
1410         free(b);
1411 }
1412
1413 static Elist*
1414 mkel(Elem e, Elist* tail)
1415 {
1416         Elist* el;
1417
1418         el = (Elist*)emalloc(sizeof(Elist));
1419         setmalloctag(el, getcallerpc(&e));
1420         el->hd = e;
1421         el->tl = tail;
1422         return el;
1423 }
1424
1425 static int
1426 elistlen(Elist* el)
1427 {
1428         int ans = 0;
1429         while(el != nil) {
1430                 ans++;
1431                 el = el->tl;
1432         }
1433         return ans;
1434 }
1435
1436 /* Frees elist, but not fields inside values of constituent elems */
1437 static void
1438 freeelist(Elist* el)
1439 {
1440         Elist* next;
1441
1442         while(el != nil) {
1443                 next = el->tl;
1444                 free(el);
1445                 el = next;
1446         }
1447 }
1448
1449 /* free any allocated structures inside v (recursively freeing Elists) */
1450 static void
1451 freevalfields(Value* v)
1452 {
1453         Elist* el;
1454         Elist* l;
1455         if(v == nil)
1456                 return;
1457         switch(v->tag) {
1458         case VOctets:
1459                 freebytes(v->u.octetsval);
1460                 break;
1461         case VBigInt:
1462                 freebytes(v->u.bigintval);
1463                 break;
1464         case VReal:
1465                 freebytes(v->u.realval);
1466                 break;
1467         case VOther:
1468                 freebytes(v->u.otherval);
1469                 break;
1470         case VBitString:
1471                 freebits(v->u.bitstringval);
1472                 break;
1473         case VObjId:
1474                 freeints(v->u.objidval);
1475                 break;
1476         case VString:
1477                 free(v->u.stringval);
1478                 break;
1479         case VSeq:
1480                 el = v->u.seqval;
1481                 for(l = el; l != nil; l = l->tl)
1482                         freevalfields(&l->hd.val);
1483                 freeelist(el);
1484                 break;
1485         case VSet:
1486                 el = v->u.setval;
1487                 for(l = el; l != nil; l = l->tl)
1488                         freevalfields(&l->hd.val);
1489                 freeelist(el);
1490                 break;
1491         }
1492         memset(v, 0, sizeof(*v));
1493 }
1494
1495 static mpint*
1496 asn1mpint(Elem *e)
1497 {
1498         Bytes *b;
1499         int v;
1500
1501         if(is_int(e, &v))
1502                 return itomp(v, nil);
1503         if(is_bigint(e, &b))
1504                 return betomp(b->data, b->len, nil);
1505         return nil;
1506 }
1507
1508 /* end of general ASN1 functions */
1509
1510
1511
1512
1513
1514 /*=============================================================*/
1515 /*
1516  * Decode and parse an X.509 Certificate, defined by this ASN1:
1517  *      Certificate ::= SEQUENCE {
1518  *              certificateInfo CertificateInfo,
1519  *              signatureAlgorithm AlgorithmIdentifier,
1520  *              signature BIT STRING }
1521  *
1522  *      CertificateInfo ::= SEQUENCE {
1523  *              version [0] INTEGER DEFAULT v1 (0),
1524  *              serialNumber INTEGER,
1525  *              signature AlgorithmIdentifier,
1526  *              issuer Name,
1527  *              validity Validity,
1528  *              subject Name,
1529  *              subjectPublicKeyInfo SubjectPublicKeyInfo }
1530  *      (version v2 has two more fields, optional unique identifiers for
1531  *  issuer and subject; since we ignore these anyway, we won't parse them)
1532  *
1533  *      Validity ::= SEQUENCE {
1534  *              notBefore UTCTime,
1535  *              notAfter UTCTime }
1536  *
1537  *      SubjectPublicKeyInfo ::= SEQUENCE {
1538  *              algorithm AlgorithmIdentifier,
1539  *              subjectPublicKey BIT STRING }
1540  *
1541  *      AlgorithmIdentifier ::= SEQUENCE {
1542  *              algorithm OBJECT IDENTIFER,
1543  *              parameters ANY DEFINED BY ALGORITHM OPTIONAL }
1544  *
1545  *      Name ::= SEQUENCE OF RelativeDistinguishedName
1546  *
1547  *      RelativeDistinguishedName ::= SETOF SIZE(1..MAX) OF AttributeTypeAndValue
1548  *
1549  *      AttributeTypeAndValue ::= SEQUENCE {
1550  *              type OBJECT IDENTIFER,
1551  *              value DirectoryString }
1552  *      (selected attributes have these Object Ids:
1553  *              commonName {2 5 4 3}
1554  *              countryName {2 5 4 6}
1555  *              localityName {2 5 4 7}
1556  *              stateOrProvinceName {2 5 4 8}
1557  *              organizationName {2 5 4 10}
1558  *              organizationalUnitName {2 5 4 11}
1559  *      )
1560  *
1561  *      DirectoryString ::= CHOICE {
1562  *              teletexString TeletexString,
1563  *              printableString PrintableString,
1564  *              universalString UniversalString }
1565  *
1566  *  See rfc1423, rfc2437 for AlgorithmIdentifier, subjectPublicKeyInfo, signature.
1567  *
1568  *  Not yet implemented:
1569  *   CertificateRevocationList ::= SIGNED SEQUENCE{
1570  *           signature       AlgorithmIdentifier,
1571  *           issuer          Name,
1572  *           lastUpdate      UTCTime,
1573  *           nextUpdate      UTCTime,
1574  *           revokedCertificates
1575  *                           SEQUENCE OF CRLEntry OPTIONAL}
1576  *   CRLEntry ::= SEQUENCE{
1577  *           userCertificate SerialNumber,
1578  *           revocationDate UTCTime}
1579  */
1580
1581 typedef struct CertX509 {
1582         int     serial;
1583         char*   issuer;
1584         char*   validity_start;
1585         char*   validity_end;
1586         char*   subject;
1587         int     publickey_alg;
1588         Bits*   publickey;
1589         int     signature_alg;
1590         Bits*   signature;
1591         int     curve;
1592         Bytes*  ext;
1593 } CertX509;
1594
1595 /* Algorithm object-ids */
1596 enum {
1597         ALG_rsaEncryption,
1598         ALG_md2WithRSAEncryption,
1599         ALG_md4WithRSAEncryption,
1600         ALG_md5WithRSAEncryption,
1601
1602         ALG_sha1WithRSAEncryption,
1603         ALG_sha1WithRSAEncryptionOiw,
1604
1605         ALG_sha256WithRSAEncryption,
1606         ALG_sha384WithRSAEncryption,
1607         ALG_sha512WithRSAEncryption,
1608         ALG_sha224WithRSAEncryption,
1609
1610         ALG_ecPublicKey,
1611         ALG_sha1WithECDSA,
1612         ALG_sha256WithECDSA,
1613         ALG_sha384WithECDSA,
1614         ALG_sha512WithECDSA,
1615
1616         ALG_md5,
1617         ALG_sha1,
1618         ALG_sha256,
1619         ALG_sha384,
1620         ALG_sha512,
1621         ALG_sha224,
1622
1623         NUMALGS
1624 };
1625
1626 typedef struct Ints15 {
1627         int             len;
1628         int             data[15];
1629 } Ints15;
1630
1631 typedef struct DigestAlg {
1632         int             alg;
1633         DigestState*    (*fun)(uchar*,ulong,uchar*,DigestState*);
1634         int             len;
1635 } DigestAlg;
1636
1637 static DigestAlg alg_md5 = { ALG_md5, md5, MD5dlen};
1638 static DigestAlg alg_sha1 = { ALG_sha1, sha1, SHA1dlen };
1639 static DigestAlg alg_sha256 = { ALG_sha256, sha2_256, SHA2_256dlen };
1640 static DigestAlg alg_sha384 = { ALG_sha384, sha2_384, SHA2_384dlen };
1641 static DigestAlg alg_sha512 = { ALG_sha512, sha2_512, SHA2_512dlen };
1642 static DigestAlg alg_sha224 = { ALG_sha224, sha2_224, SHA2_224dlen };
1643
1644 /* maximum length of digest output of the digest algs above */
1645 enum {
1646         MAXdlen = SHA2_512dlen,
1647 };
1648
1649 static Ints15 oid_rsaEncryption = {7, 1, 2, 840, 113549, 1, 1, 1 };
1650
1651 static Ints15 oid_md2WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 2 };
1652 static Ints15 oid_md4WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 3 };
1653 static Ints15 oid_md5WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 4 };
1654 static Ints15 oid_sha1WithRSAEncryption ={7, 1, 2, 840, 113549, 1, 1, 5 };
1655 static Ints15 oid_sha1WithRSAEncryptionOiw ={6, 1, 3, 14, 3, 2, 29 };
1656 static Ints15 oid_sha256WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 11 };
1657 static Ints15 oid_sha384WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 12 };
1658 static Ints15 oid_sha512WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 13 };
1659 static Ints15 oid_sha224WithRSAEncryption = {7, 1, 2, 840, 113549, 1, 1, 14 };
1660
1661 static Ints15 oid_ecPublicKey = {6, 1, 2, 840, 10045, 2, 1 };
1662 static Ints15 oid_sha1WithECDSA = {6, 1, 2, 840, 10045, 4, 1 };
1663 static Ints15 oid_sha256WithECDSA = {7, 1, 2, 840, 10045, 4, 3, 2 };
1664 static Ints15 oid_sha384WithECDSA = {7, 1, 2, 840, 10045, 4, 3, 3 };
1665 static Ints15 oid_sha512WithECDSA = {7, 1, 2, 840, 10045, 4, 3, 4 };
1666
1667 static Ints15 oid_md5 = {6, 1, 2, 840, 113549, 2, 5 };
1668 static Ints15 oid_sha1 = {6, 1, 3, 14, 3, 2, 26 };
1669 static Ints15 oid_sha256= {9, 2, 16, 840, 1, 101, 3, 4, 2, 1 };
1670 static Ints15 oid_sha384= {9, 2, 16, 840, 1, 101, 3, 4, 2, 2 };
1671 static Ints15 oid_sha512= {9, 2, 16, 840, 1, 101, 3, 4, 2, 3 };
1672 static Ints15 oid_sha224= {9, 2, 16, 840, 1, 101, 3, 4, 2, 4 };
1673
1674 static Ints *alg_oid_tab[NUMALGS+1] = {
1675         (Ints*)&oid_rsaEncryption,
1676         (Ints*)&oid_md2WithRSAEncryption,
1677         (Ints*)&oid_md4WithRSAEncryption,
1678         (Ints*)&oid_md5WithRSAEncryption,
1679
1680         (Ints*)&oid_sha1WithRSAEncryption,
1681         (Ints*)&oid_sha1WithRSAEncryptionOiw,
1682
1683         (Ints*)&oid_sha256WithRSAEncryption,
1684         (Ints*)&oid_sha384WithRSAEncryption,
1685         (Ints*)&oid_sha512WithRSAEncryption,
1686         (Ints*)&oid_sha224WithRSAEncryption,
1687
1688         (Ints*)&oid_ecPublicKey,
1689         (Ints*)&oid_sha1WithECDSA,
1690         (Ints*)&oid_sha256WithECDSA,
1691         (Ints*)&oid_sha384WithECDSA,
1692         (Ints*)&oid_sha512WithECDSA,
1693
1694         (Ints*)&oid_md5,
1695         (Ints*)&oid_sha1,
1696         (Ints*)&oid_sha256,
1697         (Ints*)&oid_sha384,
1698         (Ints*)&oid_sha512,
1699         (Ints*)&oid_sha224,
1700         nil
1701 };
1702
1703 static DigestAlg *digestalg[NUMALGS+1] = {
1704         &alg_md5, &alg_md5, &alg_md5, &alg_md5,
1705         &alg_sha1, &alg_sha1,
1706         &alg_sha256, &alg_sha384, &alg_sha512, &alg_sha224,
1707         &alg_sha256, &alg_sha1, &alg_sha256, &alg_sha384, &alg_sha512,
1708         &alg_md5, &alg_sha1, &alg_sha256, &alg_sha384, &alg_sha512, &alg_sha224,
1709         nil
1710 };
1711
1712 static Bytes* encode_digest(DigestAlg *da, uchar *digest);
1713
1714 static Ints15 oid_secp256r1 = {7, 1, 2, 840, 10045, 3, 1, 7};
1715 static Ints15 oid_secp384r1 = {5, 1, 3, 132, 0, 34};
1716
1717 static Ints *namedcurves_oid_tab[] = {
1718         (Ints*)&oid_secp256r1,
1719         (Ints*)&oid_secp384r1,
1720         nil,
1721 };
1722 static void (*namedcurves[])(mpint *p, mpint *a, mpint *b, mpint *x, mpint *y, mpint *n, mpint *h) = {
1723         secp256r1,
1724         secp384r1,
1725         nil,
1726 };
1727
1728 static void appendaltnames(char *name, int nname, Bytes *ext, int req);
1729
1730 static void
1731 freecert(CertX509* c)
1732 {
1733         if(c == nil)
1734                 return;
1735         free(c->issuer);
1736         free(c->validity_start);
1737         free(c->validity_end);
1738         free(c->subject);
1739         freebits(c->publickey);
1740         freebits(c->signature);
1741         freebytes(c->ext);
1742         free(c);
1743 }
1744
1745 /*
1746  * Parse the Name ASN1 type.
1747  * The sequence of RelativeDistinguishedName's gives a sort of pathname,
1748  * from most general to most specific.  Each element of the path can be
1749  * one or more (but usually just one) attribute-value pair, such as
1750  * countryName="US".
1751  * We'll just form a "postal-style" address string by concatenating the elements
1752  * from most specific to least specific, separated by commas.
1753  * Return name-as-string (which must be freed by caller).
1754  */
1755 static char*
1756 parse_name(Elem* e)
1757 {
1758         Elist* el;
1759         Elem* es;
1760         Elist* esetl;
1761         Elem* eat;
1762         Elist* eatl;
1763         char* s;
1764         enum { MAXPARTS = 100 };
1765         char* parts[MAXPARTS];
1766         int i;
1767         int plen;
1768         char* ans = nil;
1769
1770         if(!is_seq(e, &el))
1771                 goto errret;
1772         i = 0;
1773         plen = 0;
1774         while(el != nil) {
1775                 es = &el->hd;
1776                 if(!is_set(es, &esetl))
1777                         goto errret;
1778                 while(esetl != nil) {
1779                         eat = &esetl->hd;
1780                         if(!is_seq(eat, &eatl) || elistlen(eatl) != 2)
1781                                 goto errret;
1782                         if(!is_string(&eatl->tl->hd, &s) || i>=MAXPARTS)
1783                                 goto errret;
1784                         parts[i++] = s;
1785                         plen += strlen(s) + 2;          /* room for ", " after */
1786                         esetl = esetl->tl;
1787                 }
1788                 el = el->tl;
1789         }
1790         if(i > 0) {
1791                 ans = (char*)emalloc(plen);
1792                 *ans = '\0';
1793                 while(--i >= 0) {
1794                         s = parts[i];
1795                         strcat(ans, s);
1796                         if(i > 0)
1797                                 strcat(ans, ", ");
1798                 }
1799         }
1800
1801 errret:
1802         return ans;
1803 }
1804
1805 /*
1806  * Parse an AlgorithmIdentifer ASN1 type.
1807  * Look up the oid in oid_tab and return one of OID_rsaEncryption, etc..,
1808  * or -1 if not found.
1809  * For now, ignore parameters, since none of our algorithms need them.
1810  */
1811 static int
1812 parse_alg(Elem* e)
1813 {
1814         Elist* el;
1815         Ints* oid;
1816
1817         if(!is_seq(e, &el) || el == nil || !is_oid(&el->hd, &oid))
1818                 return -1;
1819         return oid_lookup(oid, alg_oid_tab);
1820 }
1821
1822 static int
1823 parse_curve(Elem* e)
1824 {
1825         Elist* el;
1826         Ints* oid;
1827
1828         if(!is_seq(e, &el) || elistlen(el)<2 || !is_oid(&el->tl->hd, &oid))
1829                 return -1;
1830         return oid_lookup(oid, namedcurves_oid_tab);
1831 }
1832
1833 static CertX509*
1834 decode_cert(uchar *buf, int len)
1835 {
1836         int ok = 0;
1837         int n;
1838         Elem  ecert;
1839         Elem* ecertinfo;
1840         Elem* esigalg;
1841         Elem* esig;
1842         Elem* eserial;
1843         Elem* eissuer;
1844         Elem* evalidity;
1845         Elem* esubj;
1846         Elem* epubkey;
1847         Elist* el;
1848         Elist* elcert = nil;
1849         Elist* elcertinfo = nil;
1850         Elist* elvalidity = nil;
1851         Elist* elpubkey = nil;
1852         Bits* bits = nil;
1853         Bytes* b;
1854         Elem* e;
1855         CertX509* c = nil;
1856
1857         if(decode(buf, len, &ecert) != ASN_OK)
1858                 goto errret;
1859
1860         c = (CertX509*)emalloc(sizeof(CertX509));
1861         c->serial = -1;
1862         c->issuer = nil;
1863         c->validity_start = nil;
1864         c->validity_end = nil;
1865         c->subject = nil;
1866         c->publickey_alg = -1;
1867         c->publickey = nil;
1868         c->signature_alg = -1;
1869         c->signature = nil;
1870         c->ext = nil;
1871
1872         /* Certificate */
1873         if(!is_seq(&ecert, &elcert) || elistlen(elcert) !=3)
1874                 goto errret;
1875         ecertinfo = &elcert->hd;
1876         el = elcert->tl;
1877         esigalg = &el->hd;
1878         c->signature_alg = parse_alg(esigalg);
1879         el = el->tl;
1880         esig = &el->hd;
1881
1882         /* Certificate Info */
1883         if(!is_seq(ecertinfo, &elcertinfo))
1884                 goto errret;
1885         n = elistlen(elcertinfo);
1886         if(n < 6)
1887                 goto errret;
1888         eserial =&elcertinfo->hd;
1889         el = elcertinfo->tl;
1890         /* check for optional version, marked by explicit context tag 0 */
1891         if(eserial->tag.class == Context && eserial->tag.num == 0) {
1892                 eserial = &el->hd;
1893                 if(n < 7)
1894                         goto errret;
1895                 el = el->tl;
1896         }
1897
1898         if(parse_alg(&el->hd) != c->signature_alg)
1899                 goto errret;
1900         el = el->tl;
1901         eissuer = &el->hd;
1902         el = el->tl;
1903         evalidity = &el->hd;
1904         el = el->tl;
1905         esubj = &el->hd;
1906         el = el->tl;
1907         epubkey = &el->hd;
1908         if(el->tl != nil && el->tl->hd.tag.class == Context && el->tl->hd.tag.num == 3){
1909                 c->ext = el->tl->hd.val.u.octetsval;
1910                 el->tl->hd.val.u.octetsval = nil;       /* transfer ownership */
1911         }
1912         if(!is_int(eserial, &c->serial)) {
1913                 if(!is_bigint(eserial, &b))
1914                         goto errret;
1915                 c->serial = -1; /* else we have to change cert struct */
1916         }
1917         c->issuer = parse_name(eissuer);
1918         if(c->issuer == nil)
1919                 goto errret;
1920         /* Validity */
1921         if(!is_seq(evalidity, &elvalidity))
1922                 goto errret;
1923         if(elistlen(elvalidity) != 2)
1924                 goto errret;
1925         e = &elvalidity->hd;
1926         if(!is_time(e, &c->validity_start))
1927                 goto errret;
1928         e->val.u.stringval = nil;       /* string ownership transfer */
1929         e = &elvalidity->tl->hd;
1930         if(!is_time(e, &c->validity_end))
1931                 goto errret;
1932         e->val.u.stringval = nil;       /* string ownership transfer */
1933
1934         /* resume CertificateInfo */
1935         c->subject = parse_name(esubj);
1936         if(c->subject == nil)
1937                 goto errret;
1938
1939         /* SubjectPublicKeyInfo */
1940         if(!is_seq(epubkey, &elpubkey))
1941                 goto errret;
1942         if(elistlen(elpubkey) != 2)
1943                 goto errret;
1944
1945         c->publickey_alg = parse_alg(&elpubkey->hd);
1946         if(c->publickey_alg < 0)
1947                 goto errret;
1948         c->curve = -1;
1949         if(c->publickey_alg == ALG_ecPublicKey){
1950                 c->curve = parse_curve(&elpubkey->hd);
1951                 if(c->curve < 0)
1952                         goto errret;
1953         }
1954         elpubkey = elpubkey->tl;
1955         if(!is_bitstring(&elpubkey->hd, &bits))
1956                 goto errret;
1957         elpubkey->hd.val.u.bitstringval = nil;  /* transfer ownership */
1958         c->publickey = bits;
1959
1960         /*resume Certificate */
1961         if(c->signature_alg < 0)
1962                 goto errret;
1963         if(!is_bitstring(esig, &bits))
1964                 goto errret;
1965         esig->val.u.bitstringval = nil; /* transfer ownership */
1966         c->signature = bits;
1967         ok = 1;
1968
1969 errret:
1970         freevalfields(&ecert.val);      /* recurses through lists, too */
1971         if(!ok){
1972                 freecert(c);
1973                 c = nil;
1974         }
1975         return c;
1976 }
1977
1978 /*
1979  *      RSAPublickKey ::= SEQUENCE {
1980  *              modulus INTEGER,
1981  *              publicExponent INTEGER
1982  *      }
1983  */
1984 RSApub*
1985 asn1toRSApub(uchar *buf, int len)
1986 {
1987         Elem e;
1988         Elist *el;
1989         RSApub* key;
1990
1991         key = nil;
1992         if(decode(buf, len, &e) != ASN_OK)
1993                 goto errret;
1994         if(!is_seq(&e, &el) || elistlen(el) != 2)
1995                 goto errret;
1996
1997         key = rsapuballoc();
1998         if((key->n = asn1mpint(&el->hd)) == nil)
1999                 goto errret;
2000         el = el->tl;
2001         if((key->ek = asn1mpint(&el->hd)) == nil)
2002                 goto errret;
2003
2004         freevalfields(&e.val);
2005         return key;
2006 errret:
2007         freevalfields(&e.val);
2008         rsapubfree(key);
2009         return nil;
2010
2011 }
2012
2013 /*
2014  *      RSAPrivateKey ::= SEQUENCE {
2015  *              version Version,
2016  *              modulus INTEGER, -- n
2017  *              publicExponent INTEGER, -- e
2018  *              privateExponent INTEGER, -- d
2019  *              prime1 INTEGER, -- p
2020  *              prime2 INTEGER, -- q
2021  *              exponent1 INTEGER, -- d mod (p-1)
2022  *              exponent2 INTEGER, -- d mod (q-1)
2023  *              coefficient INTEGER -- (inverse of q) mod p }
2024  */
2025 RSApriv*
2026 asn1toRSApriv(uchar *buf, int len)
2027 {
2028         int version;
2029         Elem e;
2030         Elist *el;
2031         Bytes *b;
2032         RSApriv* key = nil;
2033
2034         if(decode(buf, len, &e) != ASN_OK)
2035                 goto errret;
2036         if(!is_seq(&e, &el))
2037                 goto errret;
2038
2039         if(!is_int(&el->hd, &version) || version != 0)
2040                 goto errret;
2041
2042         if(elistlen(el) != 9){
2043                 if(elistlen(el) == 3
2044                 && parse_alg(&el->tl->hd) == ALG_rsaEncryption
2045                 && is_octetstring(&el->tl->tl->hd, &b)){
2046                         key = asn1toRSApriv(b->data, b->len);
2047                         if(key != nil)
2048                                 goto done;
2049                 }
2050                 goto errret;
2051         }
2052
2053         key = rsaprivalloc();
2054         el = el->tl;
2055         if((key->pub.n = asn1mpint(&el->hd)) == nil)
2056                 goto errret;
2057
2058         el = el->tl;
2059         if((key->pub.ek = asn1mpint(&el->hd)) == nil)
2060                 goto errret;
2061
2062         el = el->tl;
2063         if((key->dk = asn1mpint(&el->hd)) == nil)
2064                 goto errret;
2065
2066         el = el->tl;
2067         if((key->q = asn1mpint(&el->hd)) == nil)
2068                 goto errret;
2069
2070         el = el->tl;
2071         if((key->p = asn1mpint(&el->hd)) == nil)
2072                 goto errret;
2073
2074         el = el->tl;
2075         if((key->kq = asn1mpint(&el->hd)) == nil)
2076                 goto errret;
2077
2078         el = el->tl;
2079         if((key->kp = asn1mpint(&el->hd)) == nil)
2080                 goto errret;
2081
2082         el = el->tl;
2083         if((key->c2 = asn1mpint(&el->hd)) == nil)
2084                 goto errret;
2085
2086 done:
2087         freevalfields(&e.val);
2088         return key;
2089 errret:
2090         freevalfields(&e.val);
2091         rsaprivfree(key);
2092         return nil;
2093 }
2094
2095 /*
2096  * digest(CertificateInfo)
2097  * Our ASN.1 library doesn't return pointers into the original
2098  * data array, so we need to do a little hand decoding.
2099  */
2100 static int
2101 digest_certinfo(uchar *cert, int ncert, DigestAlg *da, uchar *digest)
2102 {
2103         uchar *info, *p, *pend;
2104         int isconstr, length;
2105         Tag tag;
2106         Elem elem;
2107
2108         p = cert;
2109         pend = cert + ncert;
2110         if(tag_decode(&p, pend, &tag, &isconstr) != ASN_OK ||
2111            tag.class != Universal || tag.num != SEQUENCE ||
2112            length_decode(&p, pend, &length) != ASN_OK ||
2113            p+length > pend ||
2114            p+length < p)
2115                 return -1;
2116         info = p;
2117         if(ber_decode(&p, pend, &elem) != ASN_OK)
2118                 return -1;
2119         freevalfields(&elem.val);
2120         if(elem.tag.num != SEQUENCE)
2121                 return -1;
2122         (*da->fun)(info, p - info, digest, nil);
2123         return da->len;
2124 }
2125
2126 mpint*
2127 pkcs1padbuf(uchar *buf, int len, mpint *modulus, int blocktype)
2128 {
2129         int i, n = (mpsignif(modulus)-1)/8;
2130         int pad = n - 2 - len;
2131         uchar *p;
2132         mpint *mp;
2133
2134         if(pad < 8){
2135                 werrstr("rsa modulus too small");
2136                 return nil;
2137         }
2138         if((p = malloc(n)) == nil)
2139                 return nil;
2140         p[0] = blocktype;
2141         switch(blocktype){
2142         default:
2143         case 1:
2144                 memset(p+1, 0xFF, pad);
2145                 break;
2146         case 2:
2147                 for(i=1; i <= pad; i++)
2148                         p[i] = 1 + nfastrand(255);
2149                 break;
2150         }
2151         p[1+pad] = 0;
2152         memmove(p+2+pad, buf, len);
2153         mp = betomp(p, n, nil);
2154         free(p);
2155         return mp;
2156 }
2157
2158 int
2159 pkcs1unpadbuf(uchar *buf, int len, mpint *modulus, int blocktype)
2160 {
2161         uchar *p = buf + 1, *e = buf + len;
2162
2163         if(len < 1 || len != (mpsignif(modulus)-1)/8 || buf[0] != blocktype)
2164                 return -1;
2165         switch(blocktype){
2166         default:
2167         case 1:
2168                 while(p < e && *p == 0xFF)
2169                         p++;
2170                 break;
2171         case 2:
2172                 while(p < e && *p != 0x00)
2173                         p++;
2174                 break;
2175         }
2176         if(p - buf <= 8 || p >= e || *p++ != 0x00)
2177                 return -1;
2178         memmove(buf, p, len = e - p);
2179         return len;
2180 }
2181
2182 static char Ebadsig[] = "bad signature";
2183
2184 char*
2185 X509rsaverifydigest(uchar *sig, int siglen, uchar *edigest, int edigestlen, RSApub *pk)
2186 {
2187         mpint *x, *y;
2188         DigestAlg **dp;
2189         Bytes *digest;
2190         uchar *buf;
2191         int len;
2192         char *err;
2193
2194         x = betomp(sig, siglen, nil);
2195         y = rsaencrypt(pk, x, nil);
2196         mpfree(x);
2197         len = mptobe(y, nil, 0, &buf);
2198         mpfree(y);
2199
2200         err = Ebadsig;
2201         len = pkcs1unpadbuf(buf, len, pk->n, 1);
2202         if(len == edigestlen && tsmemcmp(buf, edigest, edigestlen) == 0)
2203                 err = nil;
2204         for(dp = digestalg; err != nil && *dp != nil; dp++){
2205                 if((*dp)->len != edigestlen)
2206                         continue;
2207                 digest = encode_digest(*dp, edigest);
2208                 if(digest->len == len && tsmemcmp(digest->data, buf, len) == 0)
2209                         err = nil;
2210                 freebytes(digest);
2211         }
2212         free(buf);
2213         return err;
2214 }
2215
2216 char*
2217 X509ecdsaverifydigest(uchar *sig, int siglen, uchar *edigest, int edigestlen, ECdomain *dom, ECpub *pub)
2218 {
2219         Elem e;
2220         Elist *el;
2221         mpint *r, *s;
2222         char *err;
2223
2224         r = s = nil;
2225         err = Ebadsig;
2226         if(decode(sig, siglen, &e) != ASN_OK)
2227                 goto end;
2228         if(!is_seq(&e, &el) || elistlen(el) != 2)
2229                 goto end;
2230         r = asn1mpint(&el->hd);
2231         if(r == nil)
2232                 goto end;
2233         el = el->tl;
2234         s = asn1mpint(&el->hd);
2235         if(s == nil)
2236                 goto end;
2237         if(ecdsaverify(dom, pub, edigest, edigestlen, r, s))
2238                 err = nil;
2239 end:
2240         freevalfields(&e.val);
2241         mpfree(s);
2242         mpfree(r);
2243         return err;
2244 }
2245
2246 static void
2247 copysubject(char *name, int nname, char *subject)
2248 {
2249         char *e;
2250
2251         if(name == nil)
2252                 return;
2253         memset(name, 0, nname);
2254         if(subject == nil)
2255                 return;
2256         strncpy(name, subject, nname-1);
2257         e = strchr(name, ',');
2258         if(e != nil)
2259                 *e = 0; /* take just CN part of Distinguished Name */
2260 }
2261
2262 ECpub*
2263 X509toECpub(uchar *cert, int ncert, char *name, int nname, ECdomain *dom)
2264 {
2265         CertX509 *c;
2266         ECpub *pub;
2267
2268         c = decode_cert(cert, ncert);
2269         if(c == nil)
2270                 return nil;
2271         copysubject(name, nname, c->subject);
2272         appendaltnames(name, nname, c->ext, 0);
2273         pub = nil;
2274         if(c->publickey_alg == ALG_ecPublicKey){
2275                 ecdominit(dom, namedcurves[c->curve]);
2276                 pub = ecdecodepub(dom, c->publickey->data, c->publickey->len);
2277                 if(pub == nil)
2278                         ecdomfree(dom);
2279         }
2280         freecert(c);
2281         return pub;
2282 }
2283
2284 char*
2285 X509ecdsaverify(uchar *cert, int ncert, ECdomain *dom, ECpub *pk)
2286 {
2287         char *e;
2288         CertX509 *c;
2289         int digestlen;
2290         uchar digest[MAXdlen];
2291
2292         c = decode_cert(cert, ncert);
2293         if(c == nil)
2294                 return "cannot decode cert";
2295         digestlen = digest_certinfo(cert, ncert, digestalg[c->signature_alg], digest);
2296         if(digestlen <= 0){
2297                 freecert(c);
2298                 return "cannot decode certinfo";
2299         }
2300         e = X509ecdsaverifydigest(c->signature->data, c->signature->len, digest, digestlen, dom, pk);
2301         freecert(c);
2302         return e;
2303 }
2304
2305 RSApub*
2306 X509toRSApub(uchar *cert, int ncert, char *name, int nname)
2307 {
2308         CertX509 *c;
2309         RSApub *pub;
2310
2311         c = decode_cert(cert, ncert);
2312         if(c == nil)
2313                 return nil;
2314         copysubject(name, nname, c->subject);
2315         appendaltnames(name, nname, c->ext, 0);
2316         pub = nil;
2317         if(c->publickey_alg == ALG_rsaEncryption)
2318                 pub = asn1toRSApub(c->publickey->data, c->publickey->len);
2319         freecert(c);
2320         return pub;
2321 }
2322
2323 char*
2324 X509rsaverify(uchar *cert, int ncert, RSApub *pk)
2325 {
2326         char *e;
2327         CertX509 *c;
2328         int digestlen;
2329         uchar digest[MAXdlen];
2330
2331         c = decode_cert(cert, ncert);
2332         if(c == nil)
2333                 return "cannot decode cert";
2334         digestlen = digest_certinfo(cert, ncert, digestalg[c->signature_alg], digest);
2335         if(digestlen <= 0){
2336                 freecert(c);
2337                 return "cannot decode certinfo";
2338         }
2339         e = X509rsaverifydigest(c->signature->data, c->signature->len, digest, digestlen, pk);
2340         freecert(c);
2341         return e;
2342 }
2343
2344 /* ------- Elem constructors ---------- */
2345 static Elem
2346 Null(void)
2347 {
2348         Elem e;
2349
2350         e.tag.class = Universal;
2351         e.tag.num = NULLTAG;
2352         e.val.tag = VNull;
2353         return e;
2354 }
2355
2356 static Elem
2357 mkint(int j)
2358 {
2359         Elem e;
2360
2361         e.tag.class = Universal;
2362         e.tag.num = INTEGER;
2363         e.val.tag = VInt;
2364         e.val.u.intval = j;
2365         return e;
2366 }
2367
2368 static Elem
2369 mkbigint(mpint *p)
2370 {
2371         Elem e;
2372
2373         e.tag.class = Universal;
2374         e.tag.num = INTEGER;
2375         e.val.tag = VBigInt;
2376         e.val.u.bigintval = newbytes((mpsignif(p)+8)/8);
2377         if(p->sign < 0){
2378                 mpint *s = mpnew(e.val.u.bigintval->len*8+1);
2379                 mpleft(mpone, e.val.u.bigintval->len*8, s);
2380                 mpadd(p, s, s);
2381                 mptober(s, e.val.u.bigintval->data, e.val.u.bigintval->len);
2382                 mpfree(s);
2383         } else {
2384                 mptober(p, e.val.u.bigintval->data, e.val.u.bigintval->len);
2385         }
2386         return e;
2387 }
2388
2389 static int
2390 printable(char *s)
2391 {
2392         int c;
2393
2394         while((c = (uchar)*s++) != 0){
2395                 if((c >= 'a' && c <= 'z')
2396                 || (c >= 'A' && c <= 'Z')
2397                 || (c >= '0' && c <= '9')
2398                 || strchr("'=()+,-./:? ", c) != nil)
2399                         continue;
2400                 return 0;
2401         }
2402         return 1;
2403 }
2404
2405 #define DirectoryString 0
2406
2407 static Elem
2408 mkstring(char *s, int t)
2409 {
2410         Elem e;
2411
2412         if(t == DirectoryString)
2413                 t = printable(s) ? PrintableString : UTF8String;
2414         e.tag.class = Universal;
2415         e.tag.num = t;
2416         e.val.tag = VString;
2417         e.val.u.stringval = estrdup(s);
2418         return e;
2419 }
2420
2421 static Elem
2422 mkoctet(uchar *buf, int buflen)
2423 {
2424         Elem e;
2425
2426         e.tag.class = Universal;
2427         e.tag.num = OCTET_STRING;
2428         e.val.tag = VOctets;
2429         e.val.u.octetsval = makebytes(buf, buflen);
2430         return e;
2431 }
2432
2433 static Elem
2434 mkbits(uchar *buf, int buflen)
2435 {
2436         Elem e;
2437
2438         e.tag.class = Universal;
2439         e.tag.num = BIT_STRING;
2440         e.val.tag = VBitString;
2441         e.val.u.bitstringval = makebits(buf, buflen, 0);
2442         return e;
2443 }
2444
2445 static Elem
2446 mkutc(long t)
2447 {
2448         Elem e;
2449         char utc[50];
2450         Tm *tm = gmtime(t);
2451
2452         e.tag.class = Universal;
2453         e.tag.num = UTCTime;
2454         e.val.tag = VString;
2455         snprint(utc, sizeof(utc), "%.2d%.2d%.2d%.2d%.2d%.2dZ",
2456                 tm->year % 100, tm->mon+1, tm->mday, tm->hour, tm->min, tm->sec);
2457         e.val.u.stringval = estrdup(utc);
2458         return e;
2459 }
2460
2461 static Elem
2462 mkoid(Ints *oid)
2463 {
2464         Elem e;
2465
2466         e.tag.class = Universal;
2467         e.tag.num = OBJECT_ID;
2468         e.val.tag = VObjId;
2469         e.val.u.objidval = makeints(oid->data, oid->len);
2470         return e;
2471 }
2472
2473 static Elem
2474 mkseq(Elist *el)
2475 {
2476         Elem e;
2477
2478         e.tag.class = Universal;
2479         e.tag.num = SEQUENCE;
2480         e.val.tag = VSeq;
2481         e.val.u.seqval = el;
2482         return e;
2483 }
2484
2485 static Elem
2486 mkset(Elist *el)
2487 {
2488         Elem e;
2489
2490         e.tag.class = Universal;
2491         e.tag.num = SETOF;
2492         e.val.tag = VSet;
2493         e.val.u.setval = el;
2494         return e;
2495 }
2496
2497 static Elem
2498 mkalg(int alg)
2499 {
2500         return mkseq(mkel(mkoid(alg_oid_tab[alg]), mkel(Null(), nil)));
2501 }
2502
2503 typedef struct Ints7pref {
2504         int     len;
2505         int     data[7];
2506         char    prefix[4];
2507         int     stype;
2508 } Ints7pref;
2509 Ints7pref DN_oid[] = {
2510         {4, 2, 5, 4, 6, 0, 0, 0,        "C=", PrintableString},
2511         {4, 2, 5, 4, 8, 0, 0, 0,        "ST=",DirectoryString},
2512         {4, 2, 5, 4, 7, 0, 0, 0,        "L=", DirectoryString},
2513         {4, 2, 5, 4, 10, 0, 0, 0,       "O=", DirectoryString},
2514         {4, 2, 5, 4, 11, 0, 0, 0,       "OU=",DirectoryString},
2515         {4, 2, 5, 4, 3, 0, 0, 0,        "CN=",DirectoryString},
2516         {7, 1,2,840,113549,1,9,1,       "E=", IA5String},
2517         {7, 0,9,2342,19200300,100,1,25, "DC=",IA5String},
2518 };
2519
2520 static Elem
2521 mkname(Ints7pref *oid, char *subj)
2522 {
2523         return mkset(mkel(mkseq(mkel(mkoid((Ints*)oid), mkel(mkstring(subj, oid->stype), nil))), nil));
2524 }
2525
2526 static Elem
2527 mkDN(char *dn)
2528 {
2529         int i, j, nf;
2530         char *f[20], *prefix, *d2 = estrdup(dn);
2531         Elist* el = nil;
2532
2533         nf = tokenize(d2, f, nelem(f));
2534         for(i=nf-1; i>=0; i--){
2535                 for(j=0; j<nelem(DN_oid); j++){
2536                         prefix = DN_oid[j].prefix;
2537                         if(strncmp(f[i],prefix,strlen(prefix))==0){
2538                                 el = mkel(mkname(&DN_oid[j],f[i]+strlen(prefix)), el);
2539                                 break;
2540                         }
2541                 }
2542         }
2543         free(d2);
2544         return mkseq(el);
2545 }
2546
2547 /*
2548  * DigestInfo ::= SEQUENCE {
2549  *      digestAlgorithm AlgorithmIdentifier,
2550  *      digest OCTET STRING }
2551  */
2552 static Bytes*
2553 encode_digest(DigestAlg *da, uchar *digest)
2554 {
2555         Bytes *b = nil;
2556         Elem e = mkseq(
2557                 mkel(mkalg(da->alg),
2558                 mkel(mkoctet(digest, da->len),
2559                 nil)));
2560         encode(e, &b);
2561         freevalfields(&e.val);
2562         return b;
2563 }
2564
2565 int
2566 asn1encodedigest(DigestState* (*fun)(uchar*, ulong, uchar*, DigestState*), uchar *digest, uchar *buf, int len)
2567 {
2568         Bytes *bytes;
2569         DigestAlg **dp;
2570
2571         for(dp = digestalg; *dp != nil; dp++){
2572                 if((*dp)->fun != fun)
2573                         continue;
2574                 bytes = encode_digest(*dp, digest);
2575                 if(bytes == nil)
2576                         break;
2577                 if(bytes->len > len){
2578                         freebytes(bytes);
2579                         break;
2580                 }
2581                 len = bytes->len;
2582                 memmove(buf, bytes->data, len);
2583                 freebytes(bytes);
2584                 return len;
2585         }
2586         return -1;
2587 }
2588
2589 static Elem
2590 mkcont(int num, Elist *l)
2591 {
2592         Elem e = mkseq(l);
2593         e.tag.class = Context;
2594         e.tag.num = num;
2595         return e;
2596 }
2597
2598 static Elem
2599 mkaltname(char *s)
2600 {
2601         Elem e;
2602         int i;
2603
2604         for(i=0; i<nelem(DN_oid); i++){
2605                 if(strstr(s, DN_oid[i].prefix) != nil)
2606                         return mkcont(4, mkel(mkDN(s), nil)); /* DN */
2607         }
2608         e = mkstring(s, IA5String);
2609         e.tag.class = Context;
2610         e.tag.num = strchr(s, '@') != nil ? 1 : 2; /* email : DNS */
2611         return e;
2612 }
2613
2614 static Elist*
2615 mkaltnames(char *alts)
2616 {
2617         Elist *el;
2618         char *s, *p;
2619
2620         if(alts == nil)
2621                 return nil;
2622
2623         el = nil;
2624         alts = estrdup(alts);
2625         for(s = alts; s != nil; s = p){
2626                 while(*s == ' ')
2627                         s++;
2628                 if(*s == '\0')
2629                         break;
2630                 if((p = strchr(s, ',')) != nil)
2631                         *p++ = 0;
2632                 el = mkel(mkaltname(s), el);
2633         }
2634         free(alts);
2635         return el;
2636 }
2637
2638 static Elist*
2639 mkextel(Elem e, Ints *oid, Elist *el)
2640 {
2641         Bytes *b = nil;
2642
2643         if(encode(e, &b) == ASN_OK){
2644                 el = mkel(mkseq(
2645                         mkel(mkoid(oid),
2646                         mkel(mkoctet(b->data, b->len),
2647                         nil))), el);
2648                 freebytes(b);
2649         }
2650         freevalfields(&e.val);
2651         return el;
2652 }
2653
2654 static Ints15 oid_subjectAltName = {4, 2, 5, 29, 17 };
2655 static Ints15 oid_extensionRequest = { 7, 1, 2, 840, 113549, 1, 9, 14};
2656
2657 static Elist*
2658 mkextensions(char *alts, int isreq)
2659 {
2660         Elist *sl, *xl;
2661
2662         xl = nil;
2663         if((sl = mkaltnames(alts)) != nil)
2664                 xl = mkextel(mkseq(sl), (Ints*)&oid_subjectAltName, xl);
2665         if(xl != nil){
2666                 xl = mkel(mkseq(xl), nil);
2667                 if(isreq)
2668                         xl = mkel(mkseq(
2669                                 mkel(mkoid((Ints*)&oid_extensionRequest),
2670                                 mkel(mkset(xl), nil))), nil);
2671         }
2672         if(isreq)
2673                 xl = mkel(mkcont(0, xl), nil);
2674         else if(xl != nil)
2675                 xl = mkel(mkcont(3, xl), nil);
2676         return xl;
2677 }
2678
2679 static char*
2680 splitalts(char *s)
2681 {
2682         int q;
2683
2684         for(q = 0; *s != '\0'; s++){
2685                 if(*s == '\'')
2686                         q ^= 1;
2687                 else if(q == 0 && *s == ','){
2688                         *s++ = 0;
2689                         return s;
2690                 }
2691         }
2692         return nil;
2693 }
2694
2695 static void
2696 appendaltnames(char *name, int nname, Bytes *ext, int isreq)
2697 {
2698         Elem eext, ealt, edn;
2699         Elist *el, *l;
2700         Ints *oid;
2701         char *alt;
2702         int len;
2703
2704         if(name == nil || ext == nil)
2705                 return;
2706         if(decode(ext->data, ext->len, &eext) != ASN_OK)
2707                 return;
2708         if(isreq){
2709                 if(!is_seq(&eext, &el) || elistlen(el) != 2)
2710                         goto errext;
2711                 if(!is_oid(&el->hd, &oid) || !ints_eq(oid, (Ints*)&oid_extensionRequest))
2712                         goto errext;
2713                 el = el->tl;
2714                 if(!is_set(&el->hd, &el))
2715                         goto errext;
2716                 if(!is_seq(&el->hd, &el))
2717                         goto errext;
2718         } else {
2719                 if(!is_seq(&eext, &el))
2720                         goto errext;
2721         }
2722         for(; el != nil; el = el->tl){
2723                 if(!is_seq(&el->hd, &l) || elistlen(l) != 2)
2724                         goto errext;
2725                 if(!is_oid(&l->hd, &oid) || !ints_eq(oid, (Ints*)&oid_subjectAltName))
2726                         continue;
2727                 el = l->tl;
2728                 break;
2729         }
2730         if(el == nil)
2731                 goto errext;
2732         if(!is_octetstring(&el->hd, &ext))
2733                 goto errext;
2734         if(decode(ext->data, ext->len, &ealt) != ASN_OK)
2735                 goto errext;
2736         if(!is_seq(&ealt, &el))
2737                 goto erralt;
2738         for(; el != nil; el = el->tl){
2739                 ext = el->hd.val.u.octetsval;
2740                 switch(el->hd.tag.num){
2741                 default:
2742                         continue;
2743                 case 1: /* email */
2744                 case 2: /* DNS */
2745                         if(ext == nil)
2746                                 goto erralt;
2747                         alt = smprint("%.*s", ext->len, (char*)ext->data);
2748                         break;
2749                 case 4: /* DN */
2750                         if(ext == nil || decode(ext->data, ext->len, &edn) != ASN_OK)
2751                                 goto erralt;
2752                         alt = parse_name(&edn);
2753                         freevalfields(&edn.val);
2754                         break;
2755                 }
2756                 if(alt == nil)
2757                         goto erralt;
2758                 len = strlen(alt);
2759                 if(strncmp(name, alt, len) == 0 && strchr(",", name[len]) == nil){
2760                         free(alt);      /* same as the subject */
2761                         continue;
2762                 }
2763                 if(name[0] != '\0')
2764                         strncat(name, ", ", nname-1);
2765                 strncat(name, alt, nname-1);
2766                 free(alt);
2767         }
2768 erralt:
2769         freevalfields(&ealt.val);
2770 errext:
2771         freevalfields(&eext.val);
2772 }
2773
2774 static Bytes*
2775 encode_rsapubkey(RSApub *pk)
2776 {
2777         Bytes *b = nil;
2778         Elem e = mkseq(
2779                 mkel(mkbigint(pk->n),
2780                 mkel(mpsignif(pk->ek)<32 ? mkint(mptoi(pk->ek)) : mkbigint(pk->ek),
2781                 nil)));
2782         encode(e, &b);
2783         freevalfields(&e.val);
2784         return b;
2785 }
2786
2787 static Bytes*
2788 encode_rsaprivkey(RSApriv *k)
2789 {
2790         Bytes *b = nil;
2791         RSApub *pk = &k->pub;
2792         Elem e = mkseq(
2793                 mkel(mkint(0),
2794                 mkel(mkbigint(pk->n),
2795                 mkel(mpsignif(pk->ek)<32 ? mkint(mptoi(pk->ek)) : mkbigint(pk->ek),
2796                 mkel(mkbigint(k->dk),
2797                 mkel(mkbigint(k->p),
2798                 mkel(mkbigint(k->q),
2799                 mkel(mkbigint(k->kp),
2800                 mkel(mkbigint(k->kq),
2801                 mkel(mkbigint(k->c2),
2802                 nil))))))))));
2803         encode(e, &b);
2804         freevalfields(&e.val);
2805         return b;
2806 }
2807
2808 int
2809 asn1encodeRSApub(RSApub *pk, uchar *buf, int len)
2810 {
2811         Bytes *b = encode_rsapubkey(pk);
2812         if(b == nil)
2813                 return -1;
2814         if(b->len > len){
2815                 freebytes(b);
2816                 werrstr("buffer too small");
2817                 return -1;
2818         }
2819         memmove(buf, b->data, len = b->len);
2820         freebytes(b);
2821         return len;
2822 }
2823
2824 int
2825 asn1encodeRSApriv(RSApriv *k, uchar *buf, int len)
2826 {
2827         Bytes *b;
2828         b = encode_rsaprivkey(k);
2829         if(b == nil)
2830                 return -1;
2831         if(b->len > len){
2832                 freebytes(b);
2833                 werrstr("buffer too small");
2834                 return -1;
2835         }
2836         memmove(buf, b->data, len = b->len);
2837         freebytes(b);
2838         return len;
2839 }
2840
2841 uchar*
2842 X509rsagen(RSApriv *priv, char *subj, ulong valid[2], int *certlen)
2843 {
2844         int serial = 0, sigalg = ALG_sha256WithRSAEncryption;
2845         uchar *cert = nil;
2846         Bytes *certbytes, *pkbytes, *certinfobytes, *sigbytes;
2847         Elem e, certinfo;
2848         DigestAlg *da;
2849         uchar digest[MAXdlen], *buf;
2850         int buflen;
2851         mpint *pkcs1;
2852         char *alts;
2853
2854         if((pkbytes = encode_rsapubkey(&priv->pub)) == nil)
2855                 return nil;
2856
2857         subj = estrdup(subj);
2858         alts = splitalts(subj);
2859
2860         e = mkseq(
2861                 mkel(mkcont(0, mkel(mkint(2), nil)),
2862                 mkel(mkint(serial),
2863                 mkel(mkalg(sigalg),
2864                 mkel(mkDN(subj),
2865                 mkel(mkseq(
2866                         mkel(mkutc(valid[0]),
2867                         mkel(mkutc(valid[1]),
2868                         nil))),
2869                 mkel(mkDN(subj),
2870                 mkel(mkseq(
2871                         mkel(mkalg(ALG_rsaEncryption),
2872                         mkel(mkbits(pkbytes->data, pkbytes->len),
2873                         nil))),
2874                 mkextensions(alts, 0)))))))));
2875         freebytes(pkbytes);
2876         if(encode(e, &certinfobytes) != ASN_OK)
2877                 goto errret;
2878
2879         da = digestalg[sigalg];
2880         (*da->fun)(certinfobytes->data, certinfobytes->len, digest, 0);
2881         freebytes(certinfobytes);
2882         certinfo = e;
2883
2884         sigbytes = encode_digest(da, digest);
2885         if(sigbytes == nil)
2886                 goto errret;
2887         pkcs1 = pkcs1padbuf(sigbytes->data, sigbytes->len, priv->pub.n, 1);
2888         freebytes(sigbytes);
2889         if(pkcs1 == nil)
2890                 goto errret;
2891
2892         rsadecrypt(priv, pkcs1, pkcs1);
2893         buflen = mptobe(pkcs1, nil, 0, &buf);
2894         mpfree(pkcs1);
2895         e = mkseq(
2896                 mkel(certinfo,
2897                 mkel(mkalg(sigalg),
2898                 mkel(mkbits(buf, buflen),
2899                 nil))));
2900         free(buf);
2901         if(encode(e, &certbytes) != ASN_OK)
2902                 goto errret;
2903         if(certlen != nil)
2904                 *certlen = certbytes->len;
2905         cert = (uchar*)certbytes;
2906         memmove(cert, certbytes->data, certbytes->len);
2907 errret:
2908         freevalfields(&e.val);
2909         free(subj);
2910         return cert;
2911 }
2912
2913 uchar*
2914 X509rsareq(RSApriv *priv, char *subj, int *certlen)
2915 {
2916         /* RFC 2314, PKCS #10 Certification Request Syntax */
2917         int version = 0, sigalg = ALG_sha256WithRSAEncryption;
2918         uchar *cert = nil;
2919         Bytes *certbytes, *pkbytes, *certinfobytes, *sigbytes;
2920         Elem e, certinfo;
2921         DigestAlg *da;
2922         uchar digest[MAXdlen], *buf;
2923         int buflen;
2924         mpint *pkcs1;
2925         char *alts;
2926
2927         if((pkbytes = encode_rsapubkey(&priv->pub)) == nil)
2928                 return nil;
2929
2930         subj = estrdup(subj);
2931         alts = splitalts(subj);
2932
2933         e = mkseq(
2934                 mkel(mkint(version),
2935                 mkel(mkDN(subj),
2936                 mkel(mkseq(
2937                         mkel(mkalg(ALG_rsaEncryption),
2938                         mkel(mkbits(pkbytes->data, pkbytes->len),
2939                         nil))),
2940                 mkextensions(alts, 1)))));
2941         freebytes(pkbytes);
2942         if(encode(e, &certinfobytes) != ASN_OK)
2943                 goto errret;
2944         da = digestalg[sigalg];
2945         (*da->fun)(certinfobytes->data, certinfobytes->len, digest, 0);
2946         freebytes(certinfobytes);
2947         certinfo = e;
2948
2949         sigbytes = encode_digest(da, digest);
2950         if(sigbytes == nil)
2951                 goto errret;
2952         pkcs1 = pkcs1padbuf(sigbytes->data, sigbytes->len, priv->pub.n, 1);
2953         freebytes(sigbytes);
2954         if(pkcs1 == nil)
2955                 goto errret;
2956
2957         rsadecrypt(priv, pkcs1, pkcs1);
2958         buflen = mptobe(pkcs1, nil, 0, &buf);
2959         mpfree(pkcs1);
2960         e = mkseq(
2961                 mkel(certinfo,
2962                 mkel(mkalg(sigalg),
2963                 mkel(mkbits(buf, buflen),
2964                 nil))));
2965         free(buf);
2966         if(encode(e, &certbytes) != ASN_OK)
2967                 goto errret;
2968         if(certlen != nil)
2969                 *certlen = certbytes->len;
2970         cert = (uchar*)certbytes;
2971         memmove(cert, certbytes->data, certbytes->len);
2972 errret:
2973         freevalfields(&e.val);
2974         free(subj);
2975         return cert;
2976 }
2977
2978 RSApub*
2979 X509reqtoRSApub(uchar *req, int nreq, char *name, int nname)
2980 {
2981         Elem ereq;
2982         Elist *el;
2983         char *subject;
2984         Bits *bits;
2985         RSApub *pub;
2986
2987         pub = nil;
2988         if(decode(req, nreq, &ereq) != ASN_OK)
2989                 goto errret;
2990         if(!is_seq(&ereq, &el) || elistlen(el) != 3)
2991                 goto errret;
2992         if(!is_seq(&el->hd, &el) || elistlen(el) < 3)
2993                 goto errret;
2994         el = el->tl;
2995         subject = parse_name(&el->hd);
2996         if(subject == nil)
2997                 goto errret;
2998         copysubject(name, nname, subject);
2999         free(subject);
3000         el = el->tl;
3001         if(el->tl != nil && el->tl->hd.tag.class == Context && el->tl->hd.tag.num == 0)
3002                 appendaltnames(name, nname, el->tl->hd.val.u.octetsval, 1);
3003         if(!is_seq(&el->hd, &el) || elistlen(el) != 2)
3004                 goto errret;
3005         if(parse_alg(&el->hd) != ALG_rsaEncryption)
3006                 goto errret;
3007         el = el->tl;
3008         if(!is_bitstring(&el->hd, &bits))
3009                 goto errret;
3010         pub = asn1toRSApub(bits->data, bits->len);
3011         if(pub == nil)
3012                 goto errret;
3013 errret:
3014         freevalfields(&ereq.val);
3015         return pub;
3016 }
3017
3018 static void
3019 digestSPKI(int alg, uchar *pubkey, int npubkey, DigestState* (*fun)(uchar*, ulong, uchar*, DigestState*), uchar *digest)
3020 {
3021         Bytes *b = nil;
3022         Elem e = mkseq(mkel(mkalg(alg), mkel(mkbits(pubkey, npubkey), nil)));
3023         encode(e, &b);
3024         freevalfields(&e.val);
3025         (*fun)(b->data, b->len, digest, nil);
3026         freebytes(b);
3027 }
3028
3029 int
3030 X509digestSPKI(uchar *cert, int ncert, DigestState* (*fun)(uchar*, ulong, uchar*, DigestState*), uchar *digest)
3031 {
3032         CertX509 *c;
3033
3034         c = decode_cert(cert, ncert);
3035         if(c == nil){
3036                 werrstr("cannot decode cert");
3037                 return -1;
3038         }
3039         digestSPKI(c->publickey_alg, c->publickey->data, c->publickey->len, fun, digest);
3040         freecert(c);
3041         return 0;
3042 }
3043
3044 static char*
3045 tagdump(Tag tag)
3046 {
3047         static char buf[32];
3048
3049         if(tag.class != Universal){
3050                 snprint(buf, sizeof(buf), "class%d,num%d", tag.class, tag.num);
3051                 return buf;
3052         }
3053         switch(tag.num){
3054         case BOOLEAN: return "BOOLEAN";
3055         case INTEGER: return "INTEGER";
3056         case BIT_STRING: return "BIT STRING";
3057         case OCTET_STRING: return "OCTET STRING";
3058         case NULLTAG: return "NULLTAG";
3059         case OBJECT_ID: return "OID";
3060         case ObjectDescriptor: return "OBJECT_DES";
3061         case EXTERNAL: return "EXTERNAL";
3062         case REAL: return "REAL";
3063         case ENUMERATED: return "ENUMERATED";
3064         case EMBEDDED_PDV: return "EMBEDDED PDV";
3065         case SEQUENCE: return "SEQUENCE";
3066         case SETOF: return "SETOF";
3067         case UTF8String: return "UTF8String";
3068         case NumericString: return "NumericString";
3069         case PrintableString: return "PrintableString";
3070         case TeletexString: return "TeletexString";
3071         case VideotexString: return "VideotexString";
3072         case IA5String: return "IA5String";
3073         case UTCTime: return "UTCTime";
3074         case GeneralizedTime: return "GeneralizedTime";
3075         case GraphicString: return "GraphicString";
3076         case VisibleString: return "VisibleString";
3077         case GeneralString: return "GeneralString";
3078         case UniversalString: return "UniversalString";
3079         case BMPString: return "BMPString";
3080         default:
3081                 snprint(buf, sizeof(buf), "Universal,num%d", tag.num);
3082                 return buf;
3083         }
3084 }
3085
3086 static void
3087 edump(Elem e)
3088 {
3089         Value v;
3090         Elist *el;
3091         int i;
3092
3093         print("%s{", tagdump(e.tag));
3094         v = e.val;
3095         switch(v.tag){
3096         case VBool: print("Bool %d",v.u.boolval); break;
3097         case VInt: print("Int %d",v.u.intval); break;
3098         case VOctets: print("Octets[%d] %.2x%.2x...",v.u.octetsval->len,v.u.octetsval->data[0],v.u.octetsval->data[1]); break;
3099         case VBigInt: print("BigInt[%d] %.2x%.2x...",v.u.bigintval->len,v.u.bigintval->data[0],v.u.bigintval->data[1]); break;
3100         case VReal: print("Real..."); break;
3101         case VOther: print("Other..."); break;
3102         case VBitString: print("BitString[%d]...", v.u.bitstringval->len*8 - v.u.bitstringval->unusedbits); break;
3103         case VNull: print("Null"); break;
3104         case VEOC: print("EOC..."); break;
3105         case VObjId: print("ObjId");
3106                 for(i = 0; i<v.u.objidval->len; i++)
3107                         print(" %d", v.u.objidval->data[i]);
3108                 break;
3109         case VString: print("String \"%s\"",v.u.stringval); break;
3110         case VSeq: print("Seq\n");
3111                 for(el = v.u.seqval; el!=nil; el = el->tl)
3112                         edump(el->hd);
3113                 break;
3114         case VSet: print("Set\n");
3115                 for(el = v.u.setval; el!=nil; el = el->tl)
3116                         edump(el->hd);
3117                 break;
3118         }
3119         print("}\n");
3120 }
3121
3122 void
3123 asn1dump(uchar *der, int len)
3124 {
3125         Elem e;
3126
3127         if(decode(der, len, &e) != ASN_OK){
3128                 print("didn't parse\n");
3129                 exits("didn't parse");
3130         }
3131         edump(e);
3132 }
3133
3134 void
3135 X509dump(uchar *cert, int ncert)
3136 {
3137         char *e;
3138         CertX509 *c;
3139         RSApub *rsapub;
3140         ECpub *ecpub;
3141         ECdomain ecdom;
3142         int digestlen;
3143         uchar digest[MAXdlen];
3144
3145         print("begin X509dump\n");
3146         c = decode_cert(cert, ncert);
3147         if(c == nil){
3148                 print("cannot decode cert\n");
3149                 return;
3150         }
3151
3152         digestlen = digest_certinfo(cert, ncert, digestalg[c->signature_alg], digest);
3153         if(digestlen <= 0){
3154                 freecert(c);
3155                 print("cannot decode certinfo\n");
3156                 return;
3157         }
3158
3159         print("serial %d\n", c->serial);
3160         print("issuer %s\n", c->issuer);
3161         print("validity %s %s\n", c->validity_start, c->validity_end);
3162         print("subject %s\n", c->subject);
3163         print("sigalg=%d digest=%.*H\n", c->signature_alg, digestlen, digest);
3164         print("publickey_alg=%d pubkey[%d] %.*H\n", c->publickey_alg, c->publickey->len,
3165                 c->publickey->len, c->publickey->data);
3166
3167         switch(c->publickey_alg){
3168         case ALG_rsaEncryption:
3169                 rsapub = asn1toRSApub(c->publickey->data, c->publickey->len);
3170                 if(rsapub != nil){
3171                         print("rsa pubkey e=%B n(%d)=%B\n", rsapub->ek, mpsignif(rsapub->n), rsapub->n);
3172                         e = X509rsaverifydigest(c->signature->data, c->signature->len,
3173                                 digest, digestlen, rsapub);
3174                         if(e==nil)
3175                                 e = "nil (meaning ok)";
3176                         print("self-signed X509rsaverifydigest returns: %s\n", e);
3177                         rsapubfree(rsapub);
3178                 }
3179                 break;
3180         case ALG_ecPublicKey:
3181                 ecdominit(&ecdom, namedcurves[c->curve]);
3182                 ecpub = ecdecodepub(&ecdom, c->publickey->data, c->publickey->len);
3183                 if(ecpub != nil){
3184                         e = X509ecdsaverifydigest(c->signature->data, c->signature->len,
3185                                 digest, digestlen, &ecdom, ecpub);
3186                         if(e==nil)
3187                                 e = "nil (meaning ok)";
3188                         print("self-signed X509ecdsaverifydigest returns: %s\n", e);
3189                         ecpubfree(ecpub);
3190                 }
3191                 ecdomfree(&ecdom);
3192                 break;
3193         }
3194
3195         digestSPKI(c->publickey_alg, c->publickey->data, c->publickey->len, sha2_256, digest);
3196         print("publickey_thumbprint sha256=%.*[\n", SHA2_256dlen, digest);
3197
3198         sha2_256(cert, ncert, digest, nil);
3199         print("cert_thumbprint sha256=%.*[\n", SHA2_256dlen, digest);
3200
3201         sha1(cert, ncert, digest, nil);
3202         print("cert_thumbprint sha1=%.*H\n", SHA1dlen, digest);
3203
3204         freecert(c);
3205         print("end X509dump\n");
3206 }