Paper 2010/406 Original: eprint.iacr.org/2010/406 ↗
Unfolding Method for Shabal on Virtex-5 FPGAs: Concrete Results.pdf
Abstract
Recent cryptanalysis on SHA-1 family has led the NIST to call for a public competition named SHA-3 Contest. Efficient implementations on various platforms are a criterion for ranking performance of all the candidates in this competition. It appears that most of the hardware architectures proposed for SHA-3 candidates are basic. In this paper, we focus on an optimized implementation of the Shabal candidate. We improve the state-of-the-art using the unfolding method. This transformation leads to unroll a part of the Shabal core. More precisely, our design can produce a throughput over 3 Gbps on Virtex-5 FPGAs, with a reasonable area usage.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2010-07-21: last updated
- 2010-07-21: published
- Short URL
- https://ia.cr/2010/406
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/406,
author = {Julien Francq and Céline Thuillet},
title = {Unfolding Method for Shabal on Virtex-5 FPGAs: Concrete Results.pdf},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/406},
year = {2010},
url = {https://eprint.iacr.org/2010/406}
}