| 摘要 |
<p>In (A), when input data (f 0 ) is read in, a hash value (h 0 ) is calculated. The hash value (h 0 ) is stored to a storage area (M1), which has the highest priority rank. In (B), when input data (f 1 ) is read in, a hash value (h 1 ) is calculated. Since the storage area (M1) is already occupied by the hash value (h 0 ), the hash value (h 0 ) is read out from storage area (M1), emptying the storage area (M1). The read hash value (h 0 ) and the hash value (h 1 ) are concatenated, forming a concatenated hash value (h 0 |h 1 ) and a hash value (h 0,1 ) is calculated. The hash value(h 0,1 ) is stored to a storage area (M2), which has the highest priority rank after the storage area (M1). In (C), when input data (f 2 ) is read in, a hash value (h 2 ) is calculated. The hash value (h 2 ) is stored to the storage area (M1) having the highest priority rank among 5 storage areas.</p> |
