comparison libtomcrypt/src/pk/rsa/rsa_free.c @ 382:0cbe8f6dbf9e

propagate from branch 'au.asn.ucc.matt.ltc.dropbear' (head 2af22fb4e878750b88f80f90d439b316d229796f) to branch 'au.asn.ucc.matt.dropbear' (head 02c413252c90e9de8e03d91e9939dde3029f5c0a)
author Matt Johnston <matt@ucc.asn.au>
date Thu, 11 Jan 2007 02:41:05 +0000
parents 1b9e69c058d2
children f849a5ca2efc
comparison
equal deleted inserted replaced
379:b66a00272a90 382:0cbe8f6dbf9e
4 * algorithms in a highly modular and flexible manner. 4 * algorithms in a highly modular and flexible manner.
5 * 5 *
6 * The library is free for all purposes without any express 6 * The library is free for all purposes without any express
7 * guarantee it works. 7 * guarantee it works.
8 * 8 *
9 * Tom St Denis, [email protected], http://libtomcrypt.org 9 * Tom St Denis, [email protected], http://libtomcrypt.com
10 */ 10 */
11 #include "tomcrypt.h" 11 #include "tomcrypt.h"
12 12
13 /** 13 /**
14 @file rsa_free.c 14 @file rsa_free.c
21 Free an RSA key from memory 21 Free an RSA key from memory
22 @param key The RSA key to free 22 @param key The RSA key to free
23 */ 23 */
24 void rsa_free(rsa_key *key) 24 void rsa_free(rsa_key *key)
25 { 25 {
26 LTC_ARGCHK(key != NULL); 26 LTC_ARGCHKVD(key != NULL);
27 mp_clear_multi(&key->e, &key->d, &key->N, &key->dQ, &key->dP, 27 mp_clear_multi(key->e, key->d, key->N, key->dQ, key->dP, key->qP, key->p, key->q, NULL);
28 &key->qP, &key->p, &key->q, NULL);
29 } 28 }
30 29
31 #endif 30 #endif
32 31
33 /* $Source: /cvs/libtom/libtomcrypt/src/pk/rsa/rsa_free.c,v $ */ 32 /* $Source: /cvs/libtom/libtomcrypt/src/pk/rsa/rsa_free.c,v $ */
34 /* $Revision: 1.3 $ */ 33 /* $Revision: 1.8 $ */
35 /* $Date: 2005/05/05 14:35:59 $ */ 34 /* $Date: 2006/12/04 22:23:27 $ */