Paper 2009/358 Original: eprint.iacr.org/2009/358 ↗

MAC Precomputation with Applications to Secure Memory

Juan A. Garay
Vladimir Kolesnikov
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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
History
2015-09-08: last updated
2009-07-21: published
Short URL
https://ia.cr/2009/358
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2009/358,
      author = {Juan A.  Garay and Vladimir Kolesnikov and Rae McLellan},
      title = {MAC Precomputation with Applications to Secure Memory},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/358},
      year = {2009},
      url = {https://eprint.iacr.org/2009/358}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.