Title : 
VLSI implementations of the cryptographic hash functions MD6 and ïrRUPT
         
        
            Author : 
Henzen, L. ; Carbognani, F. ; Aumasson, J. Ph ; O´Neil, S. ; Fichtner, Wolfgang
         
        
            Author_Institution : 
IIS, ETH Zurich, Zurich, Switzerland
         
        
        
        
        
        
            Abstract : 
A public competition organized by the NIST recently started, with the aim of identifying a new standard for cryptographic hashing (SHA-3). Besides a high security level, candidate algorithms should show good performance on various platforms. While an average performance on high-end processors is generally not critical, implementability and flexibility in hardware is crucial, because the new standard will be implemented in a variety of lightweight devices. This paper investigates VLSI architectures of the SHA-3 candidates MD6 and irRUPT. The fastest circuit is the 16timesparallel MD6 core, reaching 16.3 Gbps at a complexity of 69.8 k gate equivalents (GE) on ASIC and 8.4 Gbps using 4465 Slices on FPGA. However, large memory requirements preclude the application of MD6 to resource-constrained systems. The most flexible and efficient circuit turns out to be our 2-irRUPT64times2-256/8 core, which achieves a throughput of 5.0 Gbps at 12.7 kGE on ASIC and 1.7 Gbps using 613 Slices on FPGA.
         
        
            Keywords : 
VLSI; cryptography; field programmable gate arrays; FPGA; MD6; SHA-3; VLSI; cryptographic hash functions; cryptographic hashing; high-end processors; irRUPT; lightweight devices; resource-constrained systems; Application specific integrated circuits; Cryptography; Field programmable gate arrays; Flexible printed circuits; Hardware; NIST; National security; Parallel processing; Throughput; Very large scale integration;
         
        
        
        
            Conference_Titel : 
Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on
         
        
            Conference_Location : 
Taipei
         
        
            Print_ISBN : 
978-1-4244-3827-3
         
        
            Electronic_ISBN : 
978-1-4244-3828-0
         
        
        
            DOI : 
10.1109/ISCAS.2009.5118412