1 /* $OpenBSD: rsa.c,v 1.26 2006/03/25 13:17:02 djm Exp $ */
3 * Author: Tatu Ylonen <ylo@cs.hut.fi>
4 * Copyright (c) 1995 Tatu Ylonen <ylo@cs.hut.fi>, Espoo, Finland
7 * As far as I am concerned, the code I have written for this software
8 * can be used freely for any purpose. Any derived versions of this
9 * software must be clearly marked as such, and if the derived work is
10 * incompatible with the protocol description in the RFC file, it must be
11 * called by a name other than "ssh" or "Secure Shell".
14 * Copyright (c) 1999 Niels Provos. All rights reserved.
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
25 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
26 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
27 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
28 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
29 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
30 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
31 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
32 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
33 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
34 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 * Description of the RSA algorithm can be found e.g. from the following
40 * Bruce Schneier: Applied Cryptography. John Wiley & Sons, 1994.
42 * Jennifer Seberry and Josed Pieprzyk: Cryptography: An Introduction to
43 * Computer Security. Prentice-Hall, 1989.
45 * Man Young Rhee: Cryptography and Secure Data Communications. McGraw-Hill,
48 * R. Rivest, A. Shamir, and L. M. Adleman: Cryptographic Communications
49 * System and Method. US Patent 4,405,829, 1983.
51 * Hans Riesel: Prime Numbers and Computer Methods for Factorization.
54 * The RSA Frequently Asked Questions document by RSA Data Security,
57 * RSA in 3 lines of perl by Adam Back <aba@atlax.ex.ac.uk>, 1995, as
60 * [gone - had to be deleted - what a pity]
70 rsa_public_encrypt(BIGNUM
*out
, BIGNUM
*in
, RSA
*key
)
72 u_char
*inbuf
, *outbuf
;
75 if (BN_num_bits(key
->e
) < 2 || !BN_is_odd(key
->e
))
76 fatal("rsa_public_encrypt() exponent too small or not odd");
78 olen
= BN_num_bytes(key
->n
);
79 outbuf
= xmalloc(olen
);
81 ilen
= BN_num_bytes(in
);
82 inbuf
= xmalloc(ilen
);
85 if ((len
= RSA_public_encrypt(ilen
, inbuf
, outbuf
, key
,
86 RSA_PKCS1_PADDING
)) <= 0)
87 fatal("rsa_public_encrypt() failed");
89 BN_bin2bn(outbuf
, len
, out
);
91 memset(outbuf
, 0, olen
);
92 memset(inbuf
, 0, ilen
);
98 rsa_private_decrypt(BIGNUM
*out
, BIGNUM
*in
, RSA
*key
)
100 u_char
*inbuf
, *outbuf
;
103 olen
= BN_num_bytes(key
->n
);
104 outbuf
= xmalloc(olen
);
106 ilen
= BN_num_bytes(in
);
107 inbuf
= xmalloc(ilen
);
108 BN_bn2bin(in
, inbuf
);
110 if ((len
= RSA_private_decrypt(ilen
, inbuf
, outbuf
, key
,
111 RSA_PKCS1_PADDING
)) <= 0) {
112 error("rsa_private_decrypt() failed");
114 BN_bin2bn(outbuf
, len
, out
);
116 memset(outbuf
, 0, olen
);
117 memset(inbuf
, 0, ilen
);
123 /* calculate p-1 and q-1 */
125 rsa_generate_additional_parameters(RSA
*rsa
)
130 if ((aux
= BN_new()) == NULL
)
131 fatal("rsa_generate_additional_parameters: BN_new failed");
132 if ((ctx
= BN_CTX_new()) == NULL
)
133 fatal("rsa_generate_additional_parameters: BN_CTX_new failed");
135 BN_sub(aux
, rsa
->q
, BN_value_one());
136 BN_mod(rsa
->dmq1
, rsa
->d
, aux
, ctx
);
138 BN_sub(aux
, rsa
->p
, BN_value_one());
139 BN_mod(rsa
->dmp1
, rsa
->d
, aux
, ctx
);