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

Author

Ribeiro Junior, F.M. ; Moreno, E.D. ; Dias, W.R.A. ; dos Anjos Lima, F.

Author_Institution

Dept. de Cienc. da Comput., Univ. Fed. de Sergipe, Aracaju, Brazil

fYear

2012

fDate

1-5 Oct. 2012

Firstpage

1

Lastpage

8

Abstract

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).

Keywords

cache storage; cryptography; microprocessor chips; ARM platform; BLAKE algorithm; Blake 384 option; Blake 512 option; CPI; SHA-1 hashing algorithm; SHA-3 hashing algorithm; SimpleScalar tool; cache level replacement method; cache memory; cache performance analysis; cycles per instruction; miss rate; simulation technique; Algorithm design and analysis; Benchmark testing; Hardware; NIST; Performance analysis; Pipelines; Reduced instruction set computing; ARM processors; SHA-1; SHA-3 finalists; cache performance; hashing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Informatica (CLEI), 2012 XXXVIII Conferencia Latinoamericana En

Conference_Location

Medellin

Print_ISBN

978-1-4673-0794-9

Type

conf

DOI

10.1109/CLEI.2012.6427246

Filename

6427246