Cryptology ePrint Archive: Report 2009/358
MAC Precomputation with Applications to Secure Memory
Juan A. Garay and Vladimir Kolesnikov and Rae McLellan
Abstract: We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, ShMAC's message-dependent computation is much faster and smaller in hardware than the evaluation of a pseudorandom permutation (PRP), and can be implemented by a small shallow circuit, while its precomputation consists of one PRP evaluation. A main building block for ShMAC is the notion of strong differential uniformity (SDU), which we introduce, and which may be of independent interest. We present an efficient SDU construction built from previously considered differentially uniform functions.
Our motivating application is a system architecture where a hardware-secured processor uses memory controlled by an adversary. We present in technical detail a novel, more efficient approach to encrypting and authenticating memory and discuss the associated trade-offs, while paying special attention to minimizing hardware costs and the reduction of DRAM latency.
Category / Keywords: foundations / Message authentication code (MAC), MAC precomputation, System on a Chip, tamper-resistant hardware
Original Publication (with major differences): ISC 2009
Date: received 18 Jul 2009, last revised 7 Sep 2015
Contact author: kolesnikov at research bell-labs com
Available format(s): PDF | BibTeX Citation
Note: Added concrete analysis and updated references.
Version: 20150908:012155 (All versions of this report)
Short URL: ia.cr/2009/358
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]