tomcrypt/src/pk/rsa/rsa_decrypt_key.c

106 lines
3.0 KiB
C
Raw Normal View History

2004-12-30 23:55:53 +00:00
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic
* algorithms in a highly modular and flexible manner.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2007-07-20 17:48:02 +00:00
* Tom St Denis, tomstdenis@gmail.com, http://libtom.org
2004-12-30 23:55:53 +00:00
*/
#include "tomcrypt.h"
/**
@file rsa_decrypt_key.c
2007-07-20 17:48:02 +00:00
RSA LTC_PKCS #1 Decryption, Tom St Denis and Andreas Lange
2006-11-17 14:21:24 +00:00
*/
2004-12-30 23:55:53 +00:00
2007-07-20 17:48:02 +00:00
#ifdef LTC_MRSA
2004-12-30 23:55:53 +00:00
/**
2007-07-20 17:48:02 +00:00
LTC_PKCS #1 decrypt then v1.5 or OAEP depad
2004-12-30 23:55:53 +00:00
@param in The ciphertext
@param inlen The length of the ciphertext (octets)
@param out [out] The plaintext
@param outlen [in/out] The max size and resulting size of the plaintext (octets)
@param lparam The system "lparam" value
@param lparamlen The length of the lparam value (octets)
@param hash_idx The index of the hash desired
2007-07-20 17:48:02 +00:00
@param padding Type of padding (LTC_LTC_PKCS_1_OAEP or LTC_LTC_PKCS_1_V1_5)
2004-12-30 23:55:53 +00:00
@param stat [out] Result of the decryption, 1==valid, 0==invalid
@param key The corresponding private RSA key
@return CRYPT_OK if succcessul (even if invalid)
*/
2006-11-17 14:21:24 +00:00
int rsa_decrypt_key_ex(const unsigned char *in, unsigned long inlen,
unsigned char *out, unsigned long *outlen,
const unsigned char *lparam, unsigned long lparamlen,
int hash_idx, int padding,
int *stat, rsa_key *key)
2004-12-30 23:55:53 +00:00
{
unsigned long modulus_bitlen, modulus_bytelen, x;
int err;
unsigned char *tmp;
2006-11-17 14:21:24 +00:00
2004-12-30 23:55:53 +00:00
LTC_ARGCHK(out != NULL);
LTC_ARGCHK(outlen != NULL);
LTC_ARGCHK(key != NULL);
LTC_ARGCHK(stat != NULL);
/* default to invalid */
*stat = 0;
2006-11-17 14:21:24 +00:00
/* valid padding? */
2007-07-20 17:48:02 +00:00
if ((padding != LTC_LTC_PKCS_1_V1_5) &&
(padding != LTC_LTC_PKCS_1_OAEP)) {
2006-11-17 14:21:24 +00:00
return CRYPT_PK_INVALID_PADDING;
2004-12-30 23:55:53 +00:00
}
2006-11-17 14:21:24 +00:00
2007-07-20 17:48:02 +00:00
if (padding == LTC_LTC_PKCS_1_OAEP) {
2006-11-17 14:21:24 +00:00
/* valid hash ? */
if ((err = hash_is_valid(hash_idx)) != CRYPT_OK) {
return err;
}
}
2004-12-30 23:55:53 +00:00
/* get modulus len in bits */
2005-08-01 16:36:47 +00:00
modulus_bitlen = mp_count_bits( (key->N));
2004-12-30 23:55:53 +00:00
/* outlen must be at least the size of the modulus */
2005-08-01 16:36:47 +00:00
modulus_bytelen = mp_unsigned_bin_size( (key->N));
2004-12-30 23:55:53 +00:00
if (modulus_bytelen != inlen) {
return CRYPT_INVALID_PACKET;
}
/* allocate ram */
tmp = XMALLOC(inlen);
if (tmp == NULL) {
return CRYPT_MEM;
}
/* rsa decode the packet */
x = inlen;
2005-11-24 11:57:58 +00:00
if ((err = ltc_mp.rsa_me(in, inlen, tmp, &x, PK_PRIVATE, key)) != CRYPT_OK) {
2004-12-30 23:55:53 +00:00
XFREE(tmp);
return err;
}
2007-07-20 17:48:02 +00:00
if (padding == LTC_LTC_PKCS_1_OAEP) {
2006-11-17 14:21:24 +00:00
/* now OAEP decode the packet */
err = pkcs_1_oaep_decode(tmp, x, lparam, lparamlen, modulus_bitlen, hash_idx,
out, outlen, stat);
} else {
2007-07-20 17:48:02 +00:00
/* now LTC_PKCS #1 v1.5 depad the packet */
err = pkcs_1_v1_5_decode(tmp, x, LTC_LTC_PKCS_1_EME, modulus_bitlen, out, outlen, stat);
2006-11-17 14:21:24 +00:00
}
2004-12-30 23:55:53 +00:00
XFREE(tmp);
return err;
}
2007-07-20 17:48:02 +00:00
#endif /* LTC_MRSA */
2004-12-30 23:55:53 +00:00
2005-06-09 00:08:13 +00:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */