Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384,512) for Hardware Implementations
- 1 January 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Quasi-Pipelined Hash CircuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A Low-Power and High-Throughput Implementation of the SHA-1 Hash FunctionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An efficient ASIC implementation of SHA-1 engine for TPMPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Single-chip FPGA implementation of a cryptographic co-processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- ASIC hardware focused comparison for hash functions MD5, RIPEMD-160, and SHSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- ASIC implementation of a unified hardware architecture for non-key based cryptographic hash primitivesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An ASIC design for a high speed implementation of the hash function SHA-256 (384, 512)Published by Association for Computing Machinery (ACM) ,2004
- A 1 Gbit/s Partially Unrolled Architecture of Hash Functions SHA-1 and SHA-512Lecture Notes in Computer Science, 2004