**Divide and Concatenate: A Scalable Hardware Architecture for Universal MAC**

*Bo Yang and Ramesh Karri and David Mcgrew*

**Abstract: **We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decreases exponentially and their speeds increase linearly as their operand size is reduced. (ii) in hash functions, message authentication codes and related cryptographic algorithms, two functions are equivalent if they have the same collision probability property. In the proposed approach we divide a 2w-bit data path (with collision probability 2-2w) into two w-bit data paths (each with collision probability 2-w) and concatenate their results to construct an equivalent 2w-bit data path (with a collision probability 2-2w).
We applied this technique on NH hash, a universal hash function that uses multiplications and additions. When compared to the 100% overhead associated with duplicating a straightforward 32-bit pipelined NH hash data path, the divide-and-concatenate approach yields a 94% increase in throughput with only 40% hardware overhead. The NH hash associated message authentication code UMAC architecture with collision probability 2-32 that uses four equivalent 8-bit divide-and-concatenate NH hash data paths yields a throughput of 79.2 Gbps with only 3840 FPGA slices when implemented on a Xilinx XC2VP7-7 Field Programmable Gate Array (FPGA).

**Category / Keywords: **implementation /

**Date: **received 6 Oct 2003

**Contact author: **yangbo at photon poly edu

**Available format(s): **PDF | BibTeX Citation

**Version: **20031007:201821 (All versions of this report)

**Short URL: **ia.cr/2003/215

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]