0.6. Cryptographic hash functions
Hash functions map inputs of data of arbitrary length into outputs of some fixed length. They serve a variety of purposes in computer science, for example as a way of detecting corruption of data. Suppose that the data is stored alongside its hashed value. If the data is corrupted, a re-computation of the hash will almost certainly not agree with the stored value. We are assuming, of course, that the range of the hash function is some reasonably large space so the chance of accidental agreement is small. We are also assuming that small changes in the data input produce some large change in the hash value. As a result it is unlikely that an arbitrary change in the input data will result in the same hash value, ...
Get The Modelling and Analysis of Security Protocols: the CSP Approach now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
