Shay Gueron, Simon Johnson, Jesse Walker

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationProceedings - 2011 8th International Conference on Information Technology
Subtitle of host publicationNew Generations, ITNG 2011
PublisherIEEE Computer Society
Number of pages5
ISBN (Print)9780769543673
StatePublished - 2011

Publication series

NameProceedings - 2011 8th International Conference on Information Technology: New Generations, ITNG 2011


  • SHA-512
  • hash algorithms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems


Dive into the research topics of 'SHA-512/256'. Together they form a unique fingerprint.

Cite this