The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
L'algorithme de hachage de sécurité 512 (SHA-512), qui est utilisé pour vérifier l'intégrité d'un message, implique des itérations informatiques sur les données. L'énorme retard de calcul généré dans de telles itérations limite le débit total du système et rend difficile le pipeline du calcul. Nous décrivons un moyen de pipeliner le calcul en utilisant un pipeline à granularité fine avec des chemins critiques équilibrés. Dans cette méthode, un chemin critique est divisé en deux étapes en utilisant le transfert de données. L’autre chemin critique est découpé en trois étapes en utilisant le report de calcul. Les chemins critiques qui en résultent comportent tous deux couches additionneurs avec quelques mouvements de données et sont donc équilibrés. De plus, le procédé permet également une réduction de registre. En outre, la similitude entre SHA-384 et SHA-512 est utilisée pour une conception multimode, qui peut générer un résumé de message pour les deux versions avec le même débit, mais avec seulement une légère augmentation de la taille matérielle. Les résultats expérimentaux montrent que notre mise en œuvre a atteint non seulement le meilleur taux de performance de zone (débit divisé par zone), mais également un débit plus élevé que presque tous les travaux associés.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Anh-Tuan HOANG, Katsuhiro YAMAZAKI, Shigeru OYANAGI, "Pipelining a Multi-Mode SHA-384/512 Core with High Area Performance Rate" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 10, pp. 2034-2042, October 2009, doi: 10.1587/transinf.E92.D.2034.
Abstract: The security hash algorithm 512 (SHA-512), which is used to verify the integrity of a message, involves computational iterations on data. The huge computation delay generated in such iterations limits the entire throughput of the system and makes it difficult to pipeline the computation. We describe a way to pipeline the computation using fine-grained pipelining with balanced critical paths. In this method, one critical path is broken into two stages by using data forwarding. The other critical path is broken into three stages by using computation postponement. The resulting critical paths all have two adder-layers with some data movements, and thus are balanced. In addition, the method also allows register reduction. Also, the similarity in SHA-384 and SHA-512 are used for a multi-mode design, which can generate a message digest for both versions with the same throughput, but with only a small increase in hardware size. Experimental results show that our implementation achieved not only the best area performance rate (throughput divided by area), but also a higher throughput than almost all related work.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.2034/_p
Copier
@ARTICLE{e92-d_10_2034,
author={Anh-Tuan HOANG, Katsuhiro YAMAZAKI, Shigeru OYANAGI, },
journal={IEICE TRANSACTIONS on Information},
title={Pipelining a Multi-Mode SHA-384/512 Core with High Area Performance Rate},
year={2009},
volume={E92-D},
number={10},
pages={2034-2042},
abstract={The security hash algorithm 512 (SHA-512), which is used to verify the integrity of a message, involves computational iterations on data. The huge computation delay generated in such iterations limits the entire throughput of the system and makes it difficult to pipeline the computation. We describe a way to pipeline the computation using fine-grained pipelining with balanced critical paths. In this method, one critical path is broken into two stages by using data forwarding. The other critical path is broken into three stages by using computation postponement. The resulting critical paths all have two adder-layers with some data movements, and thus are balanced. In addition, the method also allows register reduction. Also, the similarity in SHA-384 and SHA-512 are used for a multi-mode design, which can generate a message digest for both versions with the same throughput, but with only a small increase in hardware size. Experimental results show that our implementation achieved not only the best area performance rate (throughput divided by area), but also a higher throughput than almost all related work.},
keywords={},
doi={10.1587/transinf.E92.D.2034},
ISSN={1745-1361},
month={October},}
Copier
TY - JOUR
TI - Pipelining a Multi-Mode SHA-384/512 Core with High Area Performance Rate
T2 - IEICE TRANSACTIONS on Information
SP - 2034
EP - 2042
AU - Anh-Tuan HOANG
AU - Katsuhiro YAMAZAKI
AU - Shigeru OYANAGI
PY - 2009
DO - 10.1587/transinf.E92.D.2034
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2009
AB - The security hash algorithm 512 (SHA-512), which is used to verify the integrity of a message, involves computational iterations on data. The huge computation delay generated in such iterations limits the entire throughput of the system and makes it difficult to pipeline the computation. We describe a way to pipeline the computation using fine-grained pipelining with balanced critical paths. In this method, one critical path is broken into two stages by using data forwarding. The other critical path is broken into three stages by using computation postponement. The resulting critical paths all have two adder-layers with some data movements, and thus are balanced. In addition, the method also allows register reduction. Also, the similarity in SHA-384 and SHA-512 are used for a multi-mode design, which can generate a message digest for both versions with the same throughput, but with only a small increase in hardware size. Experimental results show that our implementation achieved not only the best area performance rate (throughput divided by area), but also a higher throughput than almost all related work.
ER -