2 * Copyright (c) 2006 - 2007 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 #include <krb5-types.h>
45 #include "imath/imath.h"
46 #include "imath/iprime.h"
49 BN2mpz(mpz_t
*s
, const BIGNUM
*bn
)
56 len
= BN_num_bytes(bn
);
59 mp_int_read_unsigned(s
, p
, len
);
70 size
= mp_int_unsigned_len(s
);
72 if (p
== NULL
&& size
!= 0)
74 mp_int_to_unsigned(s
, p
, size
);
76 bn
= BN_bin2bn(p
, size
, NULL
);
81 static int random_num(mp_int
, size_t);
84 setup_blind(mp_int n
, mp_int b
, mp_int bi
)
88 random_num(b
, mp_int_count_bits(n
));
90 mp_int_invmod(b
, n
, bi
);
94 blind(mp_int in
, mp_int b
, mp_int e
, mp_int n
)
98 /* in' = (in * b^e) mod n */
99 mp_int_exptmod(b
, e
, n
, &t1
);
100 mp_int_mul(&t1
, in
, in
);
101 mp_int_mod(in
, n
, in
);
106 unblind(mp_int out
, mp_int bi
, mp_int n
)
108 /* out' = (out * 1/b) mod n */
109 mp_int_mul(out
, bi
, out
);
110 mp_int_mod(out
, n
, out
);
114 rsa_private_calculate(mp_int in
, mp_int p
, mp_int q
,
115 mp_int dmp1
, mp_int dmq1
, mp_int iqmp
,
119 mp_int_init(&vp
); mp_int_init(&vq
); mp_int_init(&u
);
121 /* vq = c ^ (d mod (q - 1)) mod q */
122 /* vp = c ^ (d mod (p - 1)) mod p */
123 mp_int_mod(in
, p
, &u
);
124 mp_int_exptmod(&u
, dmp1
, p
, &vp
);
125 mp_int_mod(in
, q
, &u
);
126 mp_int_exptmod(&u
, dmq1
, q
, &vq
);
128 /* C2 = 1/q mod p (iqmp) */
129 /* u = (vp - vq)C2 mod p. */
130 mp_int_sub(&vp
, &vq
, &u
);
131 if (mp_int_compare_zero(&u
) < 0)
132 mp_int_add(&u
, p
, &u
);
133 mp_int_mul(&u
, iqmp
, &u
);
134 mp_int_mod(&u
, p
, &u
);
136 /* c ^ d mod n = vq + u q */
137 mp_int_mul(&u
, q
, &u
);
138 mp_int_add(&u
, &vq
, out
);
152 imath_rsa_public_encrypt(int flen
, const unsigned char* from
,
153 unsigned char* to
, RSA
* rsa
, int padding
)
155 unsigned char *p
, *p0
;
158 mpz_t enc
, dec
, n
, e
;
160 if (padding
!= RSA_PKCS1_PADDING
)
163 size
= RSA_size(rsa
);
165 if (size
< RSA_PKCS1_PADDING_SIZE
|| size
- RSA_PKCS1_PADDING_SIZE
< flen
)
171 p
= p0
= malloc(size
- 1);
178 padlen
= size
- flen
- 3;
181 if (RAND_bytes(p
, padlen
) != 1) {
194 memcpy(p
, from
, flen
);
196 assert((p
- p0
) == size
- 1);
200 mp_int_read_unsigned(&dec
, p0
, size
- 1);
203 res
= mp_int_exptmod(&dec
, &e
, &n
, &enc
);
214 ssize
= mp_int_unsigned_len(&enc
);
215 assert(size
>= ssize
);
216 mp_int_to_unsigned(&enc
, to
, ssize
);
225 imath_rsa_public_decrypt(int flen
, const unsigned char* from
,
226 unsigned char* to
, RSA
* rsa
, int padding
)
233 if (padding
!= RSA_PKCS1_PADDING
)
236 if (flen
> RSA_size(rsa
))
243 /* Check that the exponent is larger then 3 */
244 if (mp_int_compare_value(&e
, 3) <= 0) {
253 mp_int_read_unsigned(&s
, rk_UNCONST(from
), flen
);
255 if (mp_int_compare(&s
, &n
) >= 0) {
261 res
= mp_int_exptmod(&s
, &e
, &n
, &us
);
272 size
= mp_int_unsigned_len(&us
);
273 assert(size
<= RSA_size(rsa
));
274 mp_int_to_unsigned(&us
, p
, size
);
278 /* head zero was skipped by mp_int_to_unsigned */
284 while (size
&& *p
== 0xff) {
287 if (size
== 0 || *p
!= 0)
291 memmove(to
, p
, size
);
297 imath_rsa_private_encrypt(int flen
, const unsigned char* from
,
298 unsigned char* to
, RSA
* rsa
, int padding
)
300 unsigned char *p
, *p0
;
303 mpz_t in
, out
, n
, e
, b
, bi
;
304 int blinding
= (rsa
->flags
& RSA_FLAG_NO_BLINDING
) == 0;
307 if (padding
!= RSA_PKCS1_PADDING
)
310 size
= RSA_size(rsa
);
312 if (size
< RSA_PKCS1_PADDING_SIZE
|| size
- RSA_PKCS1_PADDING_SIZE
< flen
)
315 p0
= p
= malloc(size
);
318 memset(p
, 0xff, size
- flen
- 3);
319 p
+= size
- flen
- 3;
321 memcpy(p
, from
, flen
);
323 assert((p
- p0
) == size
);
330 mp_int_read_unsigned(&in
, p0
, size
);
333 if(mp_int_compare_zero(&in
) < 0 ||
334 mp_int_compare(&in
, &n
) >= 0) {
340 setup_blind(&n
, &b
, &bi
);
341 blind(&in
, &b
, &e
, &n
);
345 if (rsa
->p
&& rsa
->q
&& rsa
->dmp1
&& rsa
->dmq1
&& rsa
->iqmp
) {
346 mpz_t p
, q
, dmp1
, dmq1
, iqmp
;
350 BN2mpz(&dmp1
, rsa
->dmp1
);
351 BN2mpz(&dmq1
, rsa
->dmq1
);
352 BN2mpz(&iqmp
, rsa
->iqmp
);
354 res
= rsa_private_calculate(&in
, &p
, &q
, &dmp1
, &dmq1
, &iqmp
, &out
);
370 res
= mp_int_exptmod(&in
, &d
, &n
, &out
);
379 unblind(&out
, &bi
, &n
);
383 ssize
= mp_int_unsigned_len(&out
);
384 assert(size
>= ssize
);
385 mp_int_to_unsigned(&out
, to
, size
);
404 imath_rsa_private_decrypt(int flen
, const unsigned char* from
,
405 unsigned char* to
, RSA
* rsa
, int padding
)
410 mpz_t in
, out
, n
, e
, b
, bi
;
411 int blinding
= (rsa
->flags
& RSA_FLAG_NO_BLINDING
) == 0;
414 if (padding
!= RSA_PKCS1_PADDING
)
417 size
= RSA_size(rsa
);
427 res
= mp_int_read_unsigned(&in
, rk_UNCONST(from
), flen
);
433 if(mp_int_compare_zero(&in
) < 0 ||
434 mp_int_compare(&in
, &n
) >= 0) {
440 setup_blind(&n
, &b
, &bi
);
441 blind(&in
, &b
, &e
, &n
);
445 if (rsa
->p
&& rsa
->q
&& rsa
->dmp1
&& rsa
->dmq1
&& rsa
->iqmp
) {
446 mpz_t p
, q
, dmp1
, dmq1
, iqmp
;
450 BN2mpz(&dmp1
, rsa
->dmp1
);
451 BN2mpz(&dmq1
, rsa
->dmq1
);
452 BN2mpz(&iqmp
, rsa
->iqmp
);
454 res
= rsa_private_calculate(&in
, &p
, &q
, &dmp1
, &dmq1
, &iqmp
, &out
);
470 if(mp_int_compare_zero(&in
) < 0 ||
471 mp_int_compare(&in
, &n
) >= 0)
475 res
= mp_int_exptmod(&in
, &d
, &n
, &out
);
484 unblind(&out
, &bi
, &n
);
489 ssize
= mp_int_unsigned_len(&out
);
490 assert(size
>= ssize
);
491 mp_int_to_unsigned(&out
, ptr
, ssize
);
495 /* head zero was skipped by mp_int_to_unsigned */
501 while (size
&& *ptr
!= 0) {
508 memmove(to
, ptr
, size
);
525 random_num(mp_int num
, size_t len
)
534 if (RAND_bytes(p
, len
) != 1) {
538 res
= mp_int_read_unsigned(num
, p
, len
);
545 #define CHECK(f, v) if ((f) != (v)) { goto out; }
548 imath_rsa_generate_key(RSA
*rsa
, int bits
, BIGNUM
*e
, BN_GENCB
*cb
)
550 mpz_t el
, p
, q
, n
, d
, dmp1
, dmq1
, iqmp
, t1
, t2
, t3
;
572 /* generate p and q so that p != q and bits(pq) ~ bits */
575 BN_GENCB_call(cb
, 2, counter
++);
576 CHECK(random_num(&p
, bits
/ 2 + 1), 0);
577 CHECK(mp_int_find_prime(&p
), MP_TRUE
);
579 CHECK(mp_int_sub_value(&p
, 1, &t1
), MP_OK
);
580 CHECK(mp_int_gcd(&t1
, &el
, &t2
), MP_OK
);
581 } while(mp_int_compare_value(&t2
, 1) != 0);
583 BN_GENCB_call(cb
, 3, 0);
587 BN_GENCB_call(cb
, 2, counter
++);
588 CHECK(random_num(&q
, bits
/ 2 + 1), 0);
589 CHECK(mp_int_find_prime(&q
), MP_TRUE
);
591 if (mp_int_compare(&p
, &q
) == 0) /* don't let p and q be the same */
594 CHECK(mp_int_sub_value(&q
, 1, &t1
), MP_OK
);
595 CHECK(mp_int_gcd(&t1
, &el
, &t2
), MP_OK
);
596 } while(mp_int_compare_value(&t2
, 1) != 0);
599 if (mp_int_compare(&p
, &q
) < 0)
602 BN_GENCB_call(cb
, 3, 1);
604 /* calculate n, n = p * q */
605 CHECK(mp_int_mul(&p
, &q
, &n
), MP_OK
);
607 /* calculate d, d = 1/e mod (p - 1)(q - 1) */
608 CHECK(mp_int_sub_value(&p
, 1, &t1
), MP_OK
);
609 CHECK(mp_int_sub_value(&q
, 1, &t2
), MP_OK
);
610 CHECK(mp_int_mul(&t1
, &t2
, &t3
), MP_OK
);
611 CHECK(mp_int_invmod(&el
, &t3
, &d
), MP_OK
);
613 /* calculate dmp1 dmp1 = d mod (p-1) */
614 CHECK(mp_int_mod(&d
, &t1
, &dmp1
), MP_OK
);
615 /* calculate dmq1 dmq1 = d mod (q-1) */
616 CHECK(mp_int_mod(&d
, &t2
, &dmq1
), MP_OK
);
617 /* calculate iqmp iqmp = 1/q mod p */
618 CHECK(mp_int_invmod(&q
, &p
, &iqmp
), MP_OK
);
620 /* fill in RSA key */
622 rsa
->e
= mpz2BN(&el
);
627 rsa
->dmp1
= mpz2BN(&dmp1
);
628 rsa
->dmq1
= mpz2BN(&dmq1
);
629 rsa
->iqmp
= mpz2BN(&iqmp
);
649 imath_rsa_init(RSA
*rsa
)
655 imath_rsa_finish(RSA
*rsa
)
660 const RSA_METHOD hc_rsa_imath_method
= {
662 imath_rsa_public_encrypt
,
663 imath_rsa_public_decrypt
,
664 imath_rsa_private_encrypt
,
665 imath_rsa_private_decrypt
,
674 imath_rsa_generate_key
678 RSA_imath_method(void)
680 return &hc_rsa_imath_method
;