]> andersk Git - openssh.git/blame - rsa.c
- deraadt@cvs.openbsd.org 2006/03/19 18:53:12
[openssh.git] / rsa.c
CommitLineData
8efc0c15 1/*
5260325f 2 * Author: Tatu Ylonen <ylo@cs.hut.fi>
5260325f 3 * Copyright (c) 1995 Tatu Ylonen <ylo@cs.hut.fi>, Espoo, Finland
4 * All rights reserved
6ae2364d 5 *
bcbf86ec 6 * As far as I am concerned, the code I have written for this software
7 * can be used freely for any purpose. Any derived versions of this
8 * software must be clearly marked as such, and if the derived work is
9 * incompatible with the protocol description in the RFC file, it must be
10 * called by a name other than "ssh" or "Secure Shell".
2b87da3b 11 *
bcbf86ec 12 *
13 * Copyright (c) 1999 Niels Provos. All rights reserved.
14 *
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
17 * are met:
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
6ae2364d 23 *
bcbf86ec 24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
25 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
27 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
28 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
29 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
30 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
31 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
32 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
33 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 *
35 *
36 * Description of the RSA algorithm can be found e.g. from the following
37 * sources:
6ae2364d 38 *
5260325f 39 * Bruce Schneier: Applied Cryptography. John Wiley & Sons, 1994.
6ae2364d 40 *
5260325f 41 * Jennifer Seberry and Josed Pieprzyk: Cryptography: An Introduction to
42 * Computer Security. Prentice-Hall, 1989.
6ae2364d 43 *
5260325f 44 * Man Young Rhee: Cryptography and Secure Data Communications. McGraw-Hill,
45 * 1994.
6ae2364d 46 *
5260325f 47 * R. Rivest, A. Shamir, and L. M. Adleman: Cryptographic Communications
48 * System and Method. US Patent 4,405,829, 1983.
6ae2364d 49 *
5260325f 50 * Hans Riesel: Prime Numbers and Computer Methods for Factorization.
51 * Birkhauser, 1994.
6ae2364d 52 *
bcbf86ec 53 * The RSA Frequently Asked Questions document by RSA Data Security,
54 * Inc., 1995.
6ae2364d 55 *
bcbf86ec 56 * RSA in 3 lines of perl by Adam Back <aba@atlax.ex.ac.uk>, 1995, as
57 * included below:
6ae2364d 58 *
5260325f 59 * [gone - had to be deleted - what a pity]
bcbf86ec 60 */
8efc0c15 61
62#include "includes.h"
8efc0c15 63
64#include "rsa.h"
42f11eb2 65#include "log.h"
8efc0c15 66#include "xmalloc.h"
67
8efc0c15 68void
5260325f 69rsa_public_encrypt(BIGNUM *out, BIGNUM *in, RSA *key)
8efc0c15 70{
1e3b8b07 71 u_char *inbuf, *outbuf;
5260325f 72 int len, ilen, olen;
8efc0c15 73
5260325f 74 if (BN_num_bits(key->e) < 2 || !BN_is_odd(key->e))
75 fatal("rsa_public_encrypt() exponent too small or not odd");
8efc0c15 76
5260325f 77 olen = BN_num_bytes(key->n);
78 outbuf = xmalloc(olen);
8efc0c15 79
5260325f 80 ilen = BN_num_bytes(in);
81 inbuf = xmalloc(ilen);
82 BN_bn2bin(in, inbuf);
8efc0c15 83
5260325f 84 if ((len = RSA_public_encrypt(ilen, inbuf, outbuf, key,
c8d54615 85 RSA_PKCS1_PADDING)) <= 0)
5260325f 86 fatal("rsa_public_encrypt() failed");
8efc0c15 87
5260325f 88 BN_bin2bn(outbuf, len, out);
8efc0c15 89
5260325f 90 memset(outbuf, 0, olen);
91 memset(inbuf, 0, ilen);
92 xfree(outbuf);
93 xfree(inbuf);
8efc0c15 94}
95
46aa2d1f 96int
8efc0c15 97rsa_private_decrypt(BIGNUM *out, BIGNUM *in, RSA *key)
98{
1e3b8b07 99 u_char *inbuf, *outbuf;
5260325f 100 int len, ilen, olen;
8efc0c15 101
5260325f 102 olen = BN_num_bytes(key->n);
103 outbuf = xmalloc(olen);
8efc0c15 104
5260325f 105 ilen = BN_num_bytes(in);
106 inbuf = xmalloc(ilen);
107 BN_bn2bin(in, inbuf);
8efc0c15 108
5260325f 109 if ((len = RSA_private_decrypt(ilen, inbuf, outbuf, key,
46aa2d1f 110 RSA_PKCS1_PADDING)) <= 0) {
111 error("rsa_private_decrypt() failed");
112 } else {
113 BN_bin2bn(outbuf, len, out);
114 }
5260325f 115 memset(outbuf, 0, olen);
116 memset(inbuf, 0, ilen);
117 xfree(outbuf);
118 xfree(inbuf);
46aa2d1f 119 return len;
8efc0c15 120}
457fc0c6 121
b775c6f2 122/* calculate p-1 and q-1 */
457fc0c6 123void
2b63e803 124rsa_generate_additional_parameters(RSA *rsa)
457fc0c6 125{
126 BIGNUM *aux;
127 BN_CTX *ctx;
b775c6f2 128
129 if ((aux = BN_new()) == NULL)
130 fatal("rsa_generate_additional_parameters: BN_new failed");
131 if ((ctx = BN_CTX_new()) == NULL)
132 fatal("rsa_generate_additional_parameters: BN_CTX_new failed");
457fc0c6 133
134 BN_sub(aux, rsa->q, BN_value_one());
135 BN_mod(rsa->dmq1, rsa->d, aux, ctx);
136
137 BN_sub(aux, rsa->p, BN_value_one());
138 BN_mod(rsa->dmp1, rsa->d, aux, ctx);
139
140 BN_clear_free(aux);
141 BN_CTX_free(ctx);
142}
143
This page took 0.237272 seconds and 5 git commands to generate.