text stringlengths 0 1.99k |
|---|
if (sum->s2length < 0 || sum->s2length > MAX_DIGEST_LEN) { |
rprintf(FERROR, "Invalid checksum length %d [%s]\n", |
sum->s2length, who_am_i()); |
exit_cleanup(RERR_PROTOCOL); |
} |
s2length corresponds to the actual digest length of an individual |
checksum. Because Rsync supports multiple checksums, (such as MD4, MD5, |
SHA1, XXHASH64) whose digest vary in size, the client uses s2length to |
tell the server how many digest bytes to expect. This field is important |
for the infoleak and the heap overflow discussed later. Interestingly, the |
client could not control this value before protocol version 27. |
Finally, comes remainder: |
sum->remainder = read_int(f); |
if (sum->remainder < 0 || sum->remainder > sum->blength) { |
rprintf(FERROR, "Invalid remainder length %ld [%s]\n", |
(long)sum->remainder, who_am_i()); |
exit_cleanup(RERR_PROTOCOL); |
} |
This value tells the server the length of the last chunk if it does not |
align to blength. |
After the daemon reads the header, two different checksums are read: |
(1) A 32-bit Adler-CRC32 Checksum |
(2) A digest of the file chunk. The digest algorithm is determined at the |
beginning of the protocol negotiation |
The corresponding code can be seen below: |
s->sums = new_array(struct sum_buf, s->count); |
for (i = 0; i < s->count; i++) { |
s->sums[i].sum1 = read_int(f); |
read_buf(f, s->sums[i].sum2, s->s2length); |
... |
} |
-- 2.2.0 - Infoleak |
In hash_search(), the daemon matches the checksums of the chunks the |
client sent to the server against the local file contents. Part of the |
function prologue is to allocate a buffer on the stack of MAX_DIGEST_LEN |
bytes: |
static void hash_search(int f, struct sum_struct *s, |
struct map_struct *buf, OFF_T len) |
{ |
OFF_T offset, aligned_offset, end; |
int32 k, want_i, aligned_i, backup; |
char sum2[MAX_DIGEST_LEN]; |
... |
} |
MAX_DIGEST_LEN corresponds to the largest, supported digest algorithm: |
#define MD4_DIGEST_LEN 16 |
#define MD5_DIGEST_LEN 16 |
#if defined SHA512_DIGEST_LENGTH |
#define MAX_DIGEST_LEN SHA512_DIGEST_LENGTH |
#elif defined SHA256_DIGEST_LENGTH |
#define MAX_DIGEST_LEN SHA256_DIGEST_LENGTH |
#elif defined SHA_DIGEST_LENGTH |
#define MAX_DIGEST_LEN SHA_DIGEST_LENGTH |
#else |
#define MAX_DIGEST_LEN MD5_DIGEST_LEN |
#endif |
Starting with commit ae16850 [10] rsync version 3.2.7, SHA512 was |
supported, which increased the value of MAX_DIGEST_LEN to 64. |
After the function setup is done, the daemon iterates over the checksums |
the client sent and generates a digest for the corresponding file chunk: |
if (!done_csum2) { |
map = (schar *)map_ptr(buf,offset,l); |
get_checksum2((char *)map,l,sum2); |
done_csum2 = 1; |
} |
if (memcmp(sum2,s->sums[i].sum2,s->s2length) != 0) { |
false_alarms++; |
continue; |
} |
This checksum is stored in the previously described sum2 stack buffer, and |
is generated through the map_ptr() function, which takes in a pointer to |
the files contents in memory, the file offset (which corresponds to |
chunkN * sum->blength), and the number of bytes to compare (which |
corresponds to blength). Under the hood, map_ptr() generates a digest for |
the chunk using an algorithm that was negotiated at the beginning of the |
protocol setup. |
The generated checksum is then compared against the corresponding |
attacker-controlled value. The number of bytes compared is s2length bytes. |
In this case, the comparison does not go out of bounds since s2length can |
be a maximum of MAX_DIGEST_LEN. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.