/* $NetBSD: rsa.c,v 1.1.1.1 2000/09/28 22:10:11 thorpej Exp $ */ /* * Author: Tatu Ylonen * Copyright (c) 1995 Tatu Ylonen , Espoo, Finland * All rights reserved * * As far as I am concerned, the code I have written for this software * can be used freely for any purpose. Any derived versions of this * software must be clearly marked as such, and if the derived work is * incompatible with the protocol description in the RFC file, it must be * called by a name other than "ssh" or "Secure Shell". * * * Copyright (c) 1999 Niels Provos. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * * Description of the RSA algorithm can be found e.g. from the following * sources: * * Bruce Schneier: Applied Cryptography. John Wiley & Sons, 1994. * * Jennifer Seberry and Josed Pieprzyk: Cryptography: An Introduction to * Computer Security. Prentice-Hall, 1989. * * Man Young Rhee: Cryptography and Secure Data Communications. McGraw-Hill, * 1994. * * R. Rivest, A. Shamir, and L. M. Adleman: Cryptographic Communications * System and Method. US Patent 4,405,829, 1983. * * Hans Riesel: Prime Numbers and Computer Methods for Factorization. * Birkhauser, 1994. * * The RSA Frequently Asked Questions document by RSA Data Security, * Inc., 1995. * * RSA in 3 lines of perl by Adam Back , 1995, as * included below: * * [gone - had to be deleted - what a pity] */ /* from OpenBSD: rsa.c,v 1.16 2000/09/07 20:27:53 deraadt Exp */ #include #ifndef lint __RCSID("$NetBSD: rsa.c,v 1.1.1.1 2000/09/28 22:10:11 thorpej Exp $"); #endif #include "includes.h" #include "rsa.h" #include "ssh.h" #include "xmalloc.h" int rsa_verbose = 1; int rsa_alive() { RSA *key; key = RSA_generate_key(32, 3, NULL, NULL); if (key == NULL) return (0); RSA_free(key); return (1); } /* * Generates RSA public and private keys. This initializes the data * structures; they should be freed with rsa_clear_private_key and * rsa_clear_public_key. */ void rsa_generate_key(RSA *prv, RSA *pub, unsigned int bits) { RSA *key; if (rsa_verbose) { printf("Generating RSA keys: "); fflush(stdout); } key = RSA_generate_key(bits, 35, NULL, NULL); if (key == NULL) fatal("rsa_generate_key: key generation failed."); /* Copy public key parameters */ pub->n = BN_new(); BN_copy(pub->n, key->n); pub->e = BN_new(); BN_copy(pub->e, key->e); /* Copy private key parameters */ prv->n = BN_new(); BN_copy(prv->n, key->n); prv->e = BN_new(); BN_copy(prv->e, key->e); prv->d = BN_new(); BN_copy(prv->d, key->d); prv->p = BN_new(); BN_copy(prv->p, key->p); prv->q = BN_new(); BN_copy(prv->q, key->q); prv->dmp1 = BN_new(); BN_copy(prv->dmp1, key->dmp1); prv->dmq1 = BN_new(); BN_copy(prv->dmq1, key->dmq1); prv->iqmp = BN_new(); BN_copy(prv->iqmp, key->iqmp); RSA_free(key); if (rsa_verbose) printf("Key generation complete.\n"); } void rsa_public_encrypt(BIGNUM *out, BIGNUM *in, RSA *key) { unsigned char *inbuf, *outbuf; int len, ilen, olen; if (BN_num_bits(key->e) < 2 || !BN_is_odd(key->e)) fatal("rsa_public_encrypt() exponent too small or not odd"); olen = BN_num_bytes(key->n); outbuf = xmalloc(olen); ilen = BN_num_bytes(in); inbuf = xmalloc(ilen); BN_bn2bin(in, inbuf); if ((len = RSA_public_encrypt(ilen, inbuf, outbuf, key, RSA_PKCS1_PADDING)) <= 0) fatal("rsa_public_encrypt() failed"); BN_bin2bn(outbuf, len, out); memset(outbuf, 0, olen); memset(inbuf, 0, ilen); xfree(outbuf); xfree(inbuf); } void rsa_private_decrypt(BIGNUM *out, BIGNUM *in, RSA *key) { unsigned char *inbuf, *outbuf; int len, ilen, olen; olen = BN_num_bytes(key->n); outbuf = xmalloc(olen); ilen = BN_num_bytes(in); inbuf = xmalloc(ilen); BN_bn2bin(in, inbuf); if ((len = RSA_private_decrypt(ilen, inbuf, outbuf, key, RSA_PKCS1_PADDING)) <= 0) fatal("rsa_private_decrypt() failed"); BN_bin2bn(outbuf, len, out); memset(outbuf, 0, olen); memset(inbuf, 0, ilen); xfree(outbuf); xfree(inbuf); } /* Set whether to output verbose messages during key generation. */ void rsa_set_verbose(int verbose) { rsa_verbose = verbose; }