Divide and concatenate: a scalable hardware architecture for universal MAC

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 throughpu...

• Type: Conference
• Year: 2004
• Where: FPGA
• Authors: Bo Yang, Ramesh Karri, David A. McGrew
• Keywords: Collision Probability, Data Paths, FPGA 2004, Hardware, NH Hash