Cache performance analysis of SHA-3 hashing algorithm (BLAKE) and SHA-1

Parameters of cache performance may improve or worsen the performance of the all processing and of cache memory itself. Through simulation techniques using the SimpleScalar tool, which simulates the architectural characteristics, we simulate the ARM platform and we performed simulations changing the capacity and replacement methods of cache levels L1 and L2 separately. We observe the cache performance for hashing algorithms: Blake from SHA-3 candidates and traditional SHA-1. It was observed that Blake is better than the SHA-1, and that among the Blake options, the best are the Blake 384 and 512. So, Blake algorithm is better in terms of security, and efficiency of the cache and processor. We show that is clear, using miss rate and CPI (cycles per instruction).