mirror of
git://anongit.mindrot.org/openssh.git
synced 2024-11-24 02:02:10 +08:00
57c30117c1
[atomicio.c auth-bsdauth.c auth-chall.c auth-options.c auth-passwd.c]
[auth-rh-rsa.c auth-rhosts.c auth-rsa.c auth-skey.c auth.c auth1.c]
[auth2-chall.c auth2-hostbased.c auth2-kbdint.c auth2-none.c]
[auth2-passwd.c auth2-pubkey.c auth2.c authfd.c authfile.c bufaux.c]
[buffer.c canohost.c channels.c cipher-3des1.c cipher-bf1.c]
[cipher-ctr.c cipher.c cleanup.c clientloop.c compat.c compress.c]
[deattack.c dh.c dispatch.c fatal.c groupaccess.c hostfile.c kex.c]
[kexdh.c kexdhc.c kexdhs.c kexgex.c kexgexc.c kexgexs.c key.c log.c]
[mac.c match.c md-sha256.c misc.c monitor.c monitor_fdpass.c]
[monitor_mm.c monitor_wrap.c msg.c nchan.c packet.c progressmeter.c]
[readconf.c readpass.c rsa.c scard.c scp.c servconf.c serverloop.c]
[session.c sftp-client.c sftp-common.c sftp-glob.c sftp-server.c]
[sftp.c ssh-add.c ssh-agent.c ssh-dss.c ssh-keygen.c ssh-keyscan.c]
[ssh-keysign.c ssh-rsa.c ssh.c sshconnect.c sshconnect1.c]
[sshconnect2.c sshd.c sshlogin.c sshpty.c sshtty.c ttymodes.c]
[uidswap.c uuencode.c xmalloc.c]
Put $OpenBSD$ tags back (as comments) to replace the RCSID()s that
Theo nuked - our scripts to sync -portable need them in the files
145 lines
4.3 KiB
C
145 lines
4.3 KiB
C
/* $OpenBSD: rsa.c,v 1.26 2006/03/25 13:17:02 djm Exp $ */
|
|
/*
|
|
* Author: Tatu Ylonen <ylo@cs.hut.fi>
|
|
* Copyright (c) 1995 Tatu Ylonen <ylo@cs.hut.fi>, 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 <aba@atlax.ex.ac.uk>, 1995, as
|
|
* included below:
|
|
*
|
|
* [gone - had to be deleted - what a pity]
|
|
*/
|
|
|
|
#include "includes.h"
|
|
|
|
#include "rsa.h"
|
|
#include "log.h"
|
|
#include "xmalloc.h"
|
|
|
|
void
|
|
rsa_public_encrypt(BIGNUM *out, BIGNUM *in, RSA *key)
|
|
{
|
|
u_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);
|
|
}
|
|
|
|
int
|
|
rsa_private_decrypt(BIGNUM *out, BIGNUM *in, RSA *key)
|
|
{
|
|
u_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) {
|
|
error("rsa_private_decrypt() failed");
|
|
} else {
|
|
BN_bin2bn(outbuf, len, out);
|
|
}
|
|
memset(outbuf, 0, olen);
|
|
memset(inbuf, 0, ilen);
|
|
xfree(outbuf);
|
|
xfree(inbuf);
|
|
return len;
|
|
}
|
|
|
|
/* calculate p-1 and q-1 */
|
|
void
|
|
rsa_generate_additional_parameters(RSA *rsa)
|
|
{
|
|
BIGNUM *aux;
|
|
BN_CTX *ctx;
|
|
|
|
if ((aux = BN_new()) == NULL)
|
|
fatal("rsa_generate_additional_parameters: BN_new failed");
|
|
if ((ctx = BN_CTX_new()) == NULL)
|
|
fatal("rsa_generate_additional_parameters: BN_CTX_new failed");
|
|
|
|
BN_sub(aux, rsa->q, BN_value_one());
|
|
BN_mod(rsa->dmq1, rsa->d, aux, ctx);
|
|
|
|
BN_sub(aux, rsa->p, BN_value_one());
|
|
BN_mod(rsa->dmp1, rsa->d, aux, ctx);
|
|
|
|
BN_clear_free(aux);
|
|
BN_CTX_free(ctx);
|
|
}
|
|
|