2 * RSA implementation for PuTTY.
13 int makekey(unsigned char *data, int len, struct RSAKey *result,
14 unsigned char **keystr, int order)
16 unsigned char *p = data;
24 for (i = 0; i < 4; i++)
25 result->bits = (result->bits << 8) + *p++;
32 * order=0 means exponent then modulus (the keys sent by the
33 * server). order=1 means modulus then exponent (the keys
34 * stored in a keyfile).
38 n = ssh1_read_bignum(p, len, result ? &result->exponent : NULL);
44 n = ssh1_read_bignum(p, len, result ? &result->modulus : NULL);
45 if (n < 0 || (result && bignum_bitcount(result->modulus) == 0)) return -1;
47 result->bytes = n - 2;
54 n = ssh1_read_bignum(p, len, result ? &result->exponent : NULL);
62 int makeprivate(unsigned char *data, int len, struct RSAKey *result)
64 return ssh1_read_bignum(data, len, &result->private_exponent);
67 int rsaencrypt(unsigned char *data, int length, struct RSAKey *key)
73 if (key->bytes < length + 4)
74 return 0; /* RSA key too short! */
76 memmove(data + key->bytes - length, data, length);
80 for (i = 2; i < key->bytes - length - 1; i++) {
82 data[i] = random_byte();
83 } while (data[i] == 0);
85 data[key->bytes - length - 1] = 0;
87 b1 = bignum_from_bytes(data, key->bytes);
89 b2 = modpow(b1, key->exponent, key->modulus);
92 for (i = key->bytes; i--;) {
93 *p++ = bignum_byte(b2, i);
102 static void sha512_mpint(SHA512_State * s, Bignum b)
104 unsigned char lenbuf[4];
106 len = (bignum_bitcount(b) + 8) / 8;
107 PUT_32BIT(lenbuf, len);
108 SHA512_Bytes(s, lenbuf, 4);
110 lenbuf[0] = bignum_byte(b, len);
111 SHA512_Bytes(s, lenbuf, 1);
113 smemclr(lenbuf, sizeof(lenbuf));
117 * Compute (base ^ exp) % mod, provided mod == p * q, with p,q
118 * distinct primes, and iqmp is the multiplicative inverse of q mod p.
119 * Uses Chinese Remainder Theorem to speed computation up over the
120 * obvious implementation of a single big modpow.
122 Bignum crt_modpow(Bignum base, Bignum exp, Bignum mod,
123 Bignum p, Bignum q, Bignum iqmp)
125 Bignum pm1, qm1, pexp, qexp, presult, qresult, diff, multiplier, ret0, ret;
128 * Reduce the exponent mod phi(p) and phi(q), to save time when
129 * exponentiating mod p and mod q respectively. Of course, since p
130 * and q are prime, phi(p) == p-1 and similarly for q.
136 pexp = bigmod(exp, pm1);
137 qexp = bigmod(exp, qm1);
140 * Do the two modpows.
142 presult = modpow(base, pexp, p);
143 qresult = modpow(base, qexp, q);
146 * Recombine the results. We want a value which is congruent to
147 * qresult mod q, and to presult mod p.
149 * We know that iqmp * q is congruent to 1 * mod p (by definition
150 * of iqmp) and to 0 mod q (obviously). So we start with qresult
151 * (which is congruent to qresult mod both primes), and add on
152 * (presult-qresult) * (iqmp * q) which adjusts it to be congruent
153 * to presult mod p without affecting its value mod q.
155 if (bignum_cmp(presult, qresult) < 0) {
157 * Can't subtract presult from qresult without first adding on
160 Bignum tmp = presult;
161 presult = bigadd(presult, p);
164 diff = bigsub(presult, qresult);
165 multiplier = bigmul(iqmp, q);
166 ret0 = bigmuladd(multiplier, diff, qresult);
169 * Finally, reduce the result mod n.
171 ret = bigmod(ret0, mod);
174 * Free all the intermediate results before returning.
190 * This function is a wrapper on modpow(). It has the same effect as
191 * modpow(), but employs RSA blinding to protect against timing
192 * attacks and also uses the Chinese Remainder Theorem (implemented
193 * above, in crt_modpow()) to speed up the main operation.
195 static Bignum rsa_privkey_op(Bignum input, struct RSAKey *key)
197 Bignum random, random_encrypted, random_inverse;
198 Bignum input_blinded, ret_blinded;
202 unsigned char digest512[64];
203 int digestused = lenof(digest512);
207 * Start by inventing a random number chosen uniformly from the
208 * range 2..modulus-1. (We do this by preparing a random number
209 * of the right length and retrying if it's greater than the
210 * modulus, to prevent any potential Bleichenbacher-like
211 * attacks making use of the uneven distribution within the
212 * range that would arise from just reducing our number mod n.
213 * There are timing implications to the potential retries, of
214 * course, but all they tell you is the modulus, which you
217 * To preserve determinism and avoid Pageant needing to share
218 * the random number pool, we actually generate this `random'
219 * number by hashing stuff with the private key.
222 int bits, byte, bitsleft, v;
223 random = copybn(key->modulus);
225 * Find the topmost set bit. (This function will return its
226 * index plus one.) Then we'll set all bits from that one
227 * downwards randomly.
229 bits = bignum_bitcount(random);
236 * Conceptually the following few lines are equivalent to
237 * byte = random_byte();
239 if (digestused >= lenof(digest512)) {
240 unsigned char seqbuf[4];
241 PUT_32BIT(seqbuf, hashseq);
243 SHA512_Bytes(&ss, "RSA deterministic blinding", 26);
244 SHA512_Bytes(&ss, seqbuf, sizeof(seqbuf));
245 sha512_mpint(&ss, key->private_exponent);
246 SHA512_Final(&ss, digest512);
250 * Now hash that digest plus the signature
254 SHA512_Bytes(&ss, digest512, sizeof(digest512));
255 sha512_mpint(&ss, input);
256 SHA512_Final(&ss, digest512);
260 byte = digest512[digestused++];
265 bignum_set_bit(random, bits, v);
269 * Now check that this number is strictly greater than
270 * zero, and strictly less than modulus.
272 if (bignum_cmp(random, Zero) <= 0 ||
273 bignum_cmp(random, key->modulus) >= 0) {
282 * RSA blinding relies on the fact that (xy)^d mod n is equal
283 * to (x^d mod n) * (y^d mod n) mod n. We invent a random pair
284 * y and y^d; then we multiply x by y, raise to the power d mod
285 * n as usual, and divide by y^d to recover x^d. Thus an
286 * attacker can't correlate the timing of the modpow with the
287 * input, because they don't know anything about the number
288 * that was input to the actual modpow.
290 * The clever bit is that we don't have to do a huge modpow to
291 * get y and y^d; we will use the number we just invented as
292 * _y^d_, and use the _public_ exponent to compute (y^d)^e = y
293 * from it, which is much faster to do.
295 random_encrypted = crt_modpow(random, key->exponent,
296 key->modulus, key->p, key->q, key->iqmp);
297 random_inverse = modinv(random, key->modulus);
298 input_blinded = modmul(input, random_encrypted, key->modulus);
299 ret_blinded = crt_modpow(input_blinded, key->private_exponent,
300 key->modulus, key->p, key->q, key->iqmp);
301 ret = modmul(ret_blinded, random_inverse, key->modulus);
304 freebn(input_blinded);
305 freebn(random_inverse);
306 freebn(random_encrypted);
312 Bignum rsadecrypt(Bignum input, struct RSAKey *key)
314 return rsa_privkey_op(input, key);
317 int rsastr_len(struct RSAKey *key)
324 mdlen = (bignum_bitcount(md) + 15) / 16;
325 exlen = (bignum_bitcount(ex) + 15) / 16;
326 return 4 * (mdlen + exlen) + 20;
329 void rsastr_fmt(char *str, struct RSAKey *key)
332 int len = 0, i, nibbles;
333 static const char hex[] = "0123456789abcdef";
338 len += sprintf(str + len, "0x");
340 nibbles = (3 + bignum_bitcount(ex)) / 4;
343 for (i = nibbles; i--;)
344 str[len++] = hex[(bignum_byte(ex, i / 2) >> (4 * (i % 2))) & 0xF];
346 len += sprintf(str + len, ",0x");
348 nibbles = (3 + bignum_bitcount(md)) / 4;
351 for (i = nibbles; i--;)
352 str[len++] = hex[(bignum_byte(md, i / 2) >> (4 * (i % 2))) & 0xF];
358 * Generate a fingerprint string for the key. Compatible with the
359 * OpenSSH fingerprint code.
361 void rsa_fingerprint(char *str, int len, struct RSAKey *key)
363 struct MD5Context md5c;
364 unsigned char digest[16];
365 char buffer[16 * 3 + 40];
369 numlen = ssh1_bignum_length(key->modulus) - 2;
370 for (i = numlen; i--;) {
371 unsigned char c = bignum_byte(key->modulus, i);
372 MD5Update(&md5c, &c, 1);
374 numlen = ssh1_bignum_length(key->exponent) - 2;
375 for (i = numlen; i--;) {
376 unsigned char c = bignum_byte(key->exponent, i);
377 MD5Update(&md5c, &c, 1);
379 MD5Final(digest, &md5c);
381 sprintf(buffer, "%d ", bignum_bitcount(key->modulus));
382 for (i = 0; i < 16; i++)
383 sprintf(buffer + strlen(buffer), "%s%02x", i ? ":" : "",
385 strncpy(str, buffer, len);
388 if (key->comment && slen < len - 1) {
390 strncpy(str + slen + 1, key->comment, len - slen - 1);
396 * Verify that the public data in an RSA key matches the private
397 * data. We also check the private data itself: we ensure that p >
398 * q and that iqmp really is the inverse of q mod p.
400 int rsa_verify(struct RSAKey *key)
402 Bignum n, ed, pm1, qm1;
405 /* n must equal pq. */
406 n = bigmul(key->p, key->q);
407 cmp = bignum_cmp(n, key->modulus);
412 /* e * d must be congruent to 1, modulo (p-1) and modulo (q-1). */
413 pm1 = copybn(key->p);
415 ed = modmul(key->exponent, key->private_exponent, pm1);
416 cmp = bignum_cmp(ed, One);
421 qm1 = copybn(key->q);
423 ed = modmul(key->exponent, key->private_exponent, qm1);
424 cmp = bignum_cmp(ed, One);
432 * I have seen key blobs in the wild which were generated with
433 * p < q, so instead of rejecting the key in this case we
434 * should instead flip them round into the canonical order of
435 * p > q. This also involves regenerating iqmp.
437 if (bignum_cmp(key->p, key->q) <= 0) {
443 key->iqmp = modinv(key->q, key->p);
447 * Ensure iqmp * q is congruent to 1, modulo p.
449 n = modmul(key->iqmp, key->q, key->p);
450 cmp = bignum_cmp(n, One);
458 /* Public key blob as used by Pageant: exponent before modulus. */
459 unsigned char *rsa_public_blob(struct RSAKey *key, int *len)
464 length = (ssh1_bignum_length(key->modulus) +
465 ssh1_bignum_length(key->exponent) + 4);
466 ret = snewn(length, unsigned char);
468 PUT_32BIT(ret, bignum_bitcount(key->modulus));
470 pos += ssh1_write_bignum(ret + pos, key->exponent);
471 pos += ssh1_write_bignum(ret + pos, key->modulus);
477 /* Given a public blob, determine its length. */
478 int rsa_public_blob_len(void *data, int maxlen)
480 unsigned char *p = (unsigned char *)data;
485 p += 4; /* length word */
488 n = ssh1_read_bignum(p, maxlen, NULL); /* exponent */
493 n = ssh1_read_bignum(p, maxlen, NULL); /* modulus */
498 return p - (unsigned char *)data;
501 void freersakey(struct RSAKey *key)
504 freebn(key->modulus);
506 freebn(key->exponent);
507 if (key->private_exponent)
508 freebn(key->private_exponent);
519 /* ----------------------------------------------------------------------
520 * Implementation of the ssh-rsa signing key type.
523 static void getstring(char **data, int *datalen, char **p, int *length)
528 *length = GET_32BIT(*data);
533 if (*datalen < *length)
539 static Bignum getmp(char **data, int *datalen)
545 getstring(data, datalen, &p, &length);
548 b = bignum_from_bytes((unsigned char *)p, length);
552 static void *rsa2_newkey(char *data, int len)
558 rsa = snew(struct RSAKey);
561 getstring(&data, &len, &p, &slen);
563 if (!p || slen != 7 || memcmp(p, "ssh-rsa", 7)) {
567 rsa->exponent = getmp(&data, &len);
568 rsa->modulus = getmp(&data, &len);
569 rsa->private_exponent = NULL;
570 rsa->p = rsa->q = rsa->iqmp = NULL;
576 static void rsa2_freekey(void *key)
578 struct RSAKey *rsa = (struct RSAKey *) key;
583 static char *rsa2_fmtkey(void *key)
585 struct RSAKey *rsa = (struct RSAKey *) key;
589 len = rsastr_len(rsa);
590 p = snewn(len, char);
595 static unsigned char *rsa2_public_blob(void *key, int *len)
597 struct RSAKey *rsa = (struct RSAKey *) key;
598 int elen, mlen, bloblen;
600 unsigned char *blob, *p;
602 elen = (bignum_bitcount(rsa->exponent) + 8) / 8;
603 mlen = (bignum_bitcount(rsa->modulus) + 8) / 8;
606 * string "ssh-rsa", mpint exp, mpint mod. Total 19+elen+mlen.
607 * (three length fields, 12+7=19).
609 bloblen = 19 + elen + mlen;
610 blob = snewn(bloblen, unsigned char);
614 memcpy(p, "ssh-rsa", 7);
619 *p++ = bignum_byte(rsa->exponent, i);
623 *p++ = bignum_byte(rsa->modulus, i);
624 assert(p == blob + bloblen);
629 static unsigned char *rsa2_private_blob(void *key, int *len)
631 struct RSAKey *rsa = (struct RSAKey *) key;
632 int dlen, plen, qlen, ulen, bloblen;
634 unsigned char *blob, *p;
636 dlen = (bignum_bitcount(rsa->private_exponent) + 8) / 8;
637 plen = (bignum_bitcount(rsa->p) + 8) / 8;
638 qlen = (bignum_bitcount(rsa->q) + 8) / 8;
639 ulen = (bignum_bitcount(rsa->iqmp) + 8) / 8;
642 * mpint private_exp, mpint p, mpint q, mpint iqmp. Total 16 +
645 bloblen = 16 + dlen + plen + qlen + ulen;
646 blob = snewn(bloblen, unsigned char);
651 *p++ = bignum_byte(rsa->private_exponent, i);
655 *p++ = bignum_byte(rsa->p, i);
659 *p++ = bignum_byte(rsa->q, i);
663 *p++ = bignum_byte(rsa->iqmp, i);
664 assert(p == blob + bloblen);
669 static void *rsa2_createkey(unsigned char *pub_blob, int pub_len,
670 unsigned char *priv_blob, int priv_len)
673 char *pb = (char *) priv_blob;
675 rsa = rsa2_newkey((char *) pub_blob, pub_len);
676 rsa->private_exponent = getmp(&pb, &priv_len);
677 rsa->p = getmp(&pb, &priv_len);
678 rsa->q = getmp(&pb, &priv_len);
679 rsa->iqmp = getmp(&pb, &priv_len);
681 if (!rsa_verify(rsa)) {
689 static void *rsa2_openssh_createkey(unsigned char **blob, int *len)
691 char **b = (char **) blob;
694 rsa = snew(struct RSAKey);
699 rsa->modulus = getmp(b, len);
700 rsa->exponent = getmp(b, len);
701 rsa->private_exponent = getmp(b, len);
702 rsa->iqmp = getmp(b, len);
703 rsa->p = getmp(b, len);
704 rsa->q = getmp(b, len);
706 if (!rsa->modulus || !rsa->exponent || !rsa->private_exponent ||
707 !rsa->iqmp || !rsa->p || !rsa->q) {
709 sfree(rsa->exponent);
710 sfree(rsa->private_exponent);
721 static int rsa2_openssh_fmtkey(void *key, unsigned char *blob, int len)
723 struct RSAKey *rsa = (struct RSAKey *) key;
727 ssh2_bignum_length(rsa->modulus) +
728 ssh2_bignum_length(rsa->exponent) +
729 ssh2_bignum_length(rsa->private_exponent) +
730 ssh2_bignum_length(rsa->iqmp) +
731 ssh2_bignum_length(rsa->p) + ssh2_bignum_length(rsa->q);
738 PUT_32BIT(blob+bloblen, ssh2_bignum_length((x))-4); bloblen += 4; \
739 for (i = ssh2_bignum_length((x))-4; i-- ;) blob[bloblen++]=bignum_byte((x),i);
742 ENC(rsa->private_exponent);
750 static int rsa2_pubkey_bits(void *blob, int len)
755 rsa = rsa2_newkey((char *) blob, len);
756 ret = bignum_bitcount(rsa->modulus);
762 static char *rsa2_fingerprint(void *key)
764 struct RSAKey *rsa = (struct RSAKey *) key;
765 struct MD5Context md5c;
766 unsigned char digest[16], lenbuf[4];
767 char buffer[16 * 3 + 40];
772 MD5Update(&md5c, (unsigned char *)"\0\0\0\7ssh-rsa", 11);
774 #define ADD_BIGNUM(bignum) \
775 numlen = (bignum_bitcount(bignum)+8)/8; \
776 PUT_32BIT(lenbuf, numlen); MD5Update(&md5c, lenbuf, 4); \
777 for (i = numlen; i-- ;) { \
778 unsigned char c = bignum_byte(bignum, i); \
779 MD5Update(&md5c, &c, 1); \
781 ADD_BIGNUM(rsa->exponent);
782 ADD_BIGNUM(rsa->modulus);
785 MD5Final(digest, &md5c);
787 sprintf(buffer, "ssh-rsa %d ", bignum_bitcount(rsa->modulus));
788 for (i = 0; i < 16; i++)
789 sprintf(buffer + strlen(buffer), "%s%02x", i ? ":" : "",
791 ret = snewn(strlen(buffer) + 1, char);
798 * This is the magic ASN.1/DER prefix that goes in the decoded
799 * signature, between the string of FFs and the actual SHA hash
800 * value. The meaning of it is:
802 * 00 -- this marks the end of the FFs; not part of the ASN.1 bit itself
804 * 30 21 -- a constructed SEQUENCE of length 0x21
805 * 30 09 -- a constructed sub-SEQUENCE of length 9
806 * 06 05 -- an object identifier, length 5
807 * 2B 0E 03 02 1A -- object id { 1 3 14 3 2 26 }
808 * (the 1,3 comes from 0x2B = 43 = 40*1+3)
810 * 04 14 -- a primitive OCTET STRING of length 0x14
811 * [0x14 bytes of hash data follows]
813 * The object id in the middle there is listed as `id-sha1' in
814 * ftp://ftp.rsasecurity.com/pub/pkcs/pkcs-1/pkcs-1v2-1d2.asn (the
815 * ASN module for PKCS #1) and its expanded form is as follows:
817 * id-sha1 OBJECT IDENTIFIER ::= {
818 * iso(1) identified-organization(3) oiw(14) secsig(3)
821 static const unsigned char asn1_weird_stuff[] = {
822 0x00, 0x30, 0x21, 0x30, 0x09, 0x06, 0x05, 0x2B,
823 0x0E, 0x03, 0x02, 0x1A, 0x05, 0x00, 0x04, 0x14,
826 #define ASN1_LEN ( (int) sizeof(asn1_weird_stuff) )
828 static int rsa2_verifysig(void *key, char *sig, int siglen,
829 char *data, int datalen)
831 struct RSAKey *rsa = (struct RSAKey *) key;
835 int bytes, i, j, ret;
836 unsigned char hash[20];
838 getstring(&sig, &siglen, &p, &slen);
839 if (!p || slen != 7 || memcmp(p, "ssh-rsa", 7)) {
842 in = getmp(&sig, &siglen);
843 out = modpow(in, rsa->exponent, rsa->modulus);
848 bytes = (bignum_bitcount(rsa->modulus)+7) / 8;
849 /* Top (partial) byte should be zero. */
850 if (bignum_byte(out, bytes - 1) != 0)
852 /* First whole byte should be 1. */
853 if (bignum_byte(out, bytes - 2) != 1)
855 /* Most of the rest should be FF. */
856 for (i = bytes - 3; i >= 20 + ASN1_LEN; i--) {
857 if (bignum_byte(out, i) != 0xFF)
860 /* Then we expect to see the asn1_weird_stuff. */
861 for (i = 20 + ASN1_LEN - 1, j = 0; i >= 20; i--, j++) {
862 if (bignum_byte(out, i) != asn1_weird_stuff[j])
865 /* Finally, we expect to see the SHA-1 hash of the signed data. */
866 SHA_Simple(data, datalen, hash);
867 for (i = 19, j = 0; i >= 0; i--, j++) {
868 if (bignum_byte(out, i) != hash[j])
876 static unsigned char *rsa2_sign(void *key, char *data, int datalen,
879 struct RSAKey *rsa = (struct RSAKey *) key;
880 unsigned char *bytes;
882 unsigned char hash[20];
886 SHA_Simple(data, datalen, hash);
888 nbytes = (bignum_bitcount(rsa->modulus) - 1) / 8;
889 assert(1 <= nbytes - 20 - ASN1_LEN);
890 bytes = snewn(nbytes, unsigned char);
893 for (i = 1; i < nbytes - 20 - ASN1_LEN; i++)
895 for (i = nbytes - 20 - ASN1_LEN, j = 0; i < nbytes - 20; i++, j++)
896 bytes[i] = asn1_weird_stuff[j];
897 for (i = nbytes - 20, j = 0; i < nbytes; i++, j++)
900 in = bignum_from_bytes(bytes, nbytes);
903 out = rsa_privkey_op(in, rsa);
906 nbytes = (bignum_bitcount(out) + 7) / 8;
907 bytes = snewn(4 + 7 + 4 + nbytes, unsigned char);
909 memcpy(bytes + 4, "ssh-rsa", 7);
910 PUT_32BIT(bytes + 4 + 7, nbytes);
911 for (i = 0; i < nbytes; i++)
912 bytes[4 + 7 + 4 + i] = bignum_byte(out, nbytes - 1 - i);
915 *siglen = 4 + 7 + 4 + nbytes;
919 const struct ssh_signkey ssh_rsa = {
926 rsa2_openssh_createkey,
936 void *ssh_rsakex_newkey(char *data, int len)
938 return rsa2_newkey(data, len);
941 void ssh_rsakex_freekey(void *key)
946 int ssh_rsakex_klen(void *key)
948 struct RSAKey *rsa = (struct RSAKey *) key;
950 return bignum_bitcount(rsa->modulus);
953 static void oaep_mask(const struct ssh_hash *h, void *seed, int seedlen,
954 void *vdata, int datalen)
956 unsigned char *data = (unsigned char *)vdata;
959 while (datalen > 0) {
960 int i, max = (datalen > h->hlen ? h->hlen : datalen);
962 unsigned char counter[4], hash[SSH2_KEX_MAX_HASH_LEN];
964 assert(h->hlen <= SSH2_KEX_MAX_HASH_LEN);
965 PUT_32BIT(counter, count);
967 h->bytes(s, seed, seedlen);
968 h->bytes(s, counter, 4);
972 for (i = 0; i < max; i++)
980 void ssh_rsakex_encrypt(const struct ssh_hash *h, unsigned char *in, int inlen,
981 unsigned char *out, int outlen,
985 struct RSAKey *rsa = (struct RSAKey *) key;
988 const int HLEN = h->hlen;
991 * Here we encrypt using RSAES-OAEP. Essentially this means:
993 * - we have a SHA-based `mask generation function' which
994 * creates a pseudo-random stream of mask data
995 * deterministically from an input chunk of data.
997 * - we have a random chunk of data called a seed.
999 * - we use the seed to generate a mask which we XOR with our
1002 * - then we use _the masked plaintext_ to generate a mask
1003 * which we XOR with the seed.
1005 * - then we concatenate the masked seed and the masked
1006 * plaintext, and RSA-encrypt that lot.
1008 * The result is that the data input to the encryption function
1009 * is random-looking and (hopefully) contains no exploitable
1010 * structure such as PKCS1-v1_5 does.
1012 * For a precise specification, see RFC 3447, section 7.1.1.
1013 * Some of the variable names below are derived from that, so
1014 * it'd probably help to read it anyway.
1017 /* k denotes the length in octets of the RSA modulus. */
1018 k = (7 + bignum_bitcount(rsa->modulus)) / 8;
1020 /* The length of the input data must be at most k - 2hLen - 2. */
1021 assert(inlen > 0 && inlen <= k - 2*HLEN - 2);
1023 /* The length of the output data wants to be precisely k. */
1024 assert(outlen == k);
1027 * Now perform EME-OAEP encoding. First set up all the unmasked
1030 /* Leading byte zero. */
1032 /* At position 1, the seed: HLEN bytes of random data. */
1033 for (i = 0; i < HLEN; i++)
1034 out[i + 1] = random_byte();
1035 /* At position 1+HLEN, the data block DB, consisting of: */
1036 /* The hash of the label (we only support an empty label here) */
1037 h->final(h->init(), out + HLEN + 1);
1038 /* A bunch of zero octets */
1039 memset(out + 2*HLEN + 1, 0, outlen - (2*HLEN + 1));
1040 /* A single 1 octet, followed by the input message data. */
1041 out[outlen - inlen - 1] = 1;
1042 memcpy(out + outlen - inlen, in, inlen);
1045 * Now use the seed data to mask the block DB.
1047 oaep_mask(h, out+1, HLEN, out+HLEN+1, outlen-HLEN-1);
1050 * And now use the masked DB to mask the seed itself.
1052 oaep_mask(h, out+HLEN+1, outlen-HLEN-1, out+1, HLEN);
1055 * Now `out' contains precisely the data we want to
1058 b1 = bignum_from_bytes(out, outlen);
1059 b2 = modpow(b1, rsa->exponent, rsa->modulus);
1061 for (i = outlen; i--;) {
1062 *p++ = bignum_byte(b2, i);
1072 static const struct ssh_kex ssh_rsa_kex_sha1 = {
1073 "rsa1024-sha1", NULL, KEXTYPE_RSA, NULL, NULL, 0, 0, &ssh_sha1
1076 static const struct ssh_kex ssh_rsa_kex_sha256 = {
1077 "rsa2048-sha256", NULL, KEXTYPE_RSA, NULL, NULL, 0, 0, &ssh_sha256
1080 static const struct ssh_kex *const rsa_kex_list[] = {
1081 &ssh_rsa_kex_sha256,
1085 const struct ssh_kexes ssh_rsa_kex = {
1086 sizeof(rsa_kex_list) / sizeof(*rsa_kex_list),