2 * RSA implementation just sufficient for ssh client-side
5 * Rewritten for more speed by Joris van Rantwijk, Jun 1999.
12 #if defined TESTMODE || defined RSADEBUG
16 #define debug(x) bndebug(#x,x)
18 static void bndebug(char *name, Bignum b) {
20 int w = 50-level-strlen(name)-5*b[0];
24 dprintf("%*s%s%*s", level, "", name, w, "");
25 for (i=b[0]; i>0; i--)
26 dprintf(" %04x", b[i]);
29 #define dmsg(x) do {if(level<DLVL){dprintf("%*s",level,"");printf x;}} while(0)
30 #define enter(x) do { dmsg(x); level += 4; } while(0)
31 #define leave(x) do { level -= 4; dmsg(x); } while(0)
41 int makekey(unsigned char *data, struct RSAKey *result,
42 unsigned char **keystr, int order) {
43 unsigned char *p = data;
49 result->bits = (result->bits << 8) + *p++;
54 * order=0 means exponent then modulus (the keys sent by the
55 * server). order=1 means modulus then exponent (the keys
56 * stored in a keyfile).
60 p += ssh1_read_bignum(p, result ? &result->exponent : NULL);
62 result->bytes = (((p[0] << 8) + p[1]) + 7) / 8;
63 if (keystr) *keystr = p+2;
64 p += ssh1_read_bignum(p, result ? &result->modulus : NULL);
66 p += ssh1_read_bignum(p, result ? &result->exponent : NULL);
71 int makeprivate(unsigned char *data, struct RSAKey *result) {
72 return ssh1_read_bignum(data, &result->private_exponent);
75 void rsaencrypt(unsigned char *data, int length, struct RSAKey *key) {
82 memmove(data+key->bytes-length, data, length);
86 for (i = 2; i < key->bytes-length-1; i++) {
88 data[i] = random_byte();
89 } while (data[i] == 0);
91 data[key->bytes-length-1] = 0;
101 for (i=key->bytes; i-- ;) {
102 unsigned char byte = *p++;
104 b1[1+i/2] |= byte<<8;
111 modpow(b1, key->exponent, key->modulus, b2);
116 for (i=key->bytes; i-- ;) {
121 b = b2[1+i/2] & 0xFF;
129 Bignum rsadecrypt(Bignum input, struct RSAKey *key) {
131 ret = newbn(key->modulus[0]);
132 modpow(input, key->private_exponent, key->modulus, ret);
136 int rsastr_len(struct RSAKey *key) {
141 return 4 * (ex[0]+md[0]) + 10;
144 void rsastr_fmt(char *str, struct RSAKey *key) {
151 for (i=1; i<=ex[0]; i++) {
152 sprintf(str+len, "%04x", ex[i]);
153 len += strlen(str+len);
156 for (i=1; i<=md[0]; i++) {
157 sprintf(str+len, "%04x", md[i]);
158 len += strlen(str+len);
163 void freersakey(struct RSAKey *key) {
164 if (key->modulus) freebn(key->modulus);
165 if (key->exponent) freebn(key->exponent);
166 if (key->private_exponent) freebn(key->private_exponent);
167 if (key->comment) free(key->comment);
182 unsigned short P1[2] = { 1, p1 };
183 unsigned short P2[2] = { 1, p2 };
184 unsigned short P3[2] = { 1, p3 };
185 unsigned short bigmod[5] = { 4, 0, 0, 0, 32768U };
186 unsigned short mod[5] = { 4, 0, 0, 0, 0 };
187 unsigned short a[5] = { 4, 0, 0, 0, 0 };
188 unsigned short b[5] = { 4, 0, 0, 0, 0 };
189 unsigned short c[5] = { 4, 0, 0, 0, 0 };
190 unsigned short One[2] = { 1, 1 };
191 unsigned short Two[2] = { 1, 2 };
194 modmult(P1, P2, bigmod, a); debug(a);
195 modmult(a, P3, bigmod, mod); debug(mod);
197 sub(P1, One, a); debug(a);
198 sub(P2, One, b); debug(b);
199 modmult(a, b, bigmod, c); debug(c);
200 sub(P3, One, a); debug(a);
201 modmult(a, c, bigmod, b); debug(b);
203 modpow(Two, b, mod, a); debug(a);