Please use this identifier to cite or link to this item:
|Title:||Area-throughput trade-offs for SHA-1 and SHA-256 hash functions' pipelined designs||Authors:||Michail, Harris
Athanasiou, George S.
Kelefouras, Vasilios I.
Goutis, Costas E.
|Keywords:||Hash function;Pipeline;Message authentication code||Category:||Electrical Engineering - Electronic Engineering - Information Engineering||Field:||Engineering and Technology||Issue Date:||1-Apr-2016||Publisher:||World Scientific Publishing Co. Pte Ltd||Source:||Journal of Circuits, Systems and Computers, 2016, vol. 25, no. 4, Article no. 16500328||DOI:||10.1142/S0218126616500328||Journal:||Journal of Circuits, Systems and Computers||Abstract:||High-throughput designs of hash functions are strongly demanded due to the need for security in every transmitted packet of worldwide e-transactions. Thus, optimized and non-optimized pipelined architectures have been proposed raising, however, important questions. Which is the optimum number of the pipeline stages? Is it worth to develop optimized designs or could the same results be achieved by increasing only the pipeline stages of the non-optimized designs? The paper answers the above questions studying extensively many pipelined architectures of SHA-1 and SHA-256 hashes, implemented in FPGAS, in terms of throughput/area (T/A) factor. Also, guides for developing efficient security schemes designs are provided.||ISSN:||0218-1266||DOI:||10.1142/S0218126616500328||Rights:||© 2016 World Scientific Publishing Company.||Type:||Article|
|Appears in Collections:||Άρθρα/Articles|
Show full item record
WEB OF SCIENCETM
checked on Aug 19, 2019
checked on Aug 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.