DocumentCode
2123823
Title
SHA-512/256
Author
Gueron, Shay ; Johnson, Simon ; Walker, Jesse
Author_Institution
Dept. of Math., Univ. of Haifa, Haifa, Israel
fYear
2011
fDate
11-13 April 2011
Firstpage
354
Lastpage
358
Abstract
With the emergence of pervasive 64 bit computing we observe that it is more cost effective to compute a SHA-512 than it is to compute a SHA-256 over a given size of data. We propose a standard way to use SHA-512 and truncate its output to 256 bits. For 64 bit architectures, this would yield a more efficient 256 bit hashing algorithm, than the current SHA-256. We call this method SHA-512/256. We also provide a method for reducing the size of the SHA-512 constants table that an implementation will need to store.
Keywords
computer architecture; cryptography; ubiquitous computing; 64 bit architectures; SHA-512/256; hashing algorithm; pervasive 64 bit computing; Algorithm design and analysis; Approximation methods; Computer architecture; NIST; Proposals; Resistance; Security; SHA-512; hash algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: New Generations (ITNG), 2011 Eighth International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
978-1-61284-427-5
Electronic_ISBN
978-0-7695-4367-3
Type
conf
DOI
10.1109/ITNG.2011.69
Filename
5945260
Link To Document