Mercurial > dropbear

comparison libtomcrypt/src/pk/pkcs1/pkcs_1_pss_encode.c @ 511:582cb38e4eb5 insecure-nocrypto

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
propagate from branch 'au.asn.ucc.matt.dropbear' (head cdcc3c729e29544e8b98a408e2dc60e4483dfd2a) to branch 'au.asn.ucc.matt.dropbear.insecure-nocrypto' (head 0ca38a1cf349f7426ac9de34ebe4c3e3735effab)
author Matt Johnston <matt@ucc.asn.au>
date Thu, 06 Nov 2008 13:16:55 +0000
parents 0cbe8f6dbf9e
children f849a5ca2efc
comparison
equal deleted inserted replaced
361:461c4b1fb35f 511:582cb38e4eb5
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 pkcs_1_pss_encode.c 14 @file pkcs_1_pss_encode.c
116 DB[x++] = 0x01; 116 DB[x++] = 0x01;
117 XMEMCPY(DB + x, salt, saltlen); 117 XMEMCPY(DB + x, salt, saltlen);
118 x += saltlen; 118 x += saltlen;
119 119
120 /* generate mask of length modulus_len - hLen - 1 from hash */ 120 /* generate mask of length modulus_len - hLen - 1 from hash */
121 if ((err = pkcs_1_mgf1(hash, hLen, hash_idx, mask, modulus_len - hLen - 1)) != CRYPT_OK) { 121 if ((err = pkcs_1_mgf1(hash_idx, hash, hLen, mask, modulus_len - hLen - 1)) != CRYPT_OK) {
122 goto LBL_ERR; 122 goto LBL_ERR;
123 } 123 }
124 124
125 /* xor against DB */ 125 /* xor against DB */
126 for (y = 0; y < (modulus_len - hLen - 1); y++) { 126 for (y = 0; y < (modulus_len - hLen - 1); y++) {
127 DB[y] ^= mask[y]; 127 DB[y] ^= mask[y];
128 } 128 }
129 129
130 /* output is DB || hash || 0xBC */ 130 /* output is DB || hash || 0xBC */
131 if (*outlen < modulus_len) { 131 if (*outlen < modulus_len) {
132 *outlen = modulus_len;
132 err = CRYPT_BUFFER_OVERFLOW; 133 err = CRYPT_BUFFER_OVERFLOW;
133 goto LBL_ERR; 134 goto LBL_ERR;
134 } 135 }
135 136
136 /* DB len = modulus_len - hLen - 1 */ 137 /* DB len = modulus_len - hLen - 1 */
168 } 169 }
169 170
170 #endif /* PKCS_1 */ 171 #endif /* PKCS_1 */
171 172
172 /* $Source: /cvs/libtom/libtomcrypt/src/pk/pkcs1/pkcs_1_pss_encode.c,v $ */ 173 /* $Source: /cvs/libtom/libtomcrypt/src/pk/pkcs1/pkcs_1_pss_encode.c,v $ */
173 /* $Revision: 1.4 $ */ 174 /* $Revision: 1.7 $ */
174 /* $Date: 2005/05/05 14:35:59 $ */ 175 /* $Date: 2006/06/16 21:53:41 $ */