GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte

Shay Gueron; Yehuda Lindell

Paper 2015/102

GCM-SIV: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte

Shay Gueron and Yehuda Lindell

Abstract

Authenticated encryption schemes guarantee both privacy and integrity, and have become the default level of encryption in modern protocols. One of the most popular authenticated encryption schemes today is AES-GCM due to its impressive speed. The current CAESAR competition is considering new modes for authenticated encryption that will improve on existing methods. One property of importance that is being considered more today -- due to multiple real-life cases of faulty sources of randomness -- is that repeating nonces and IVs can have disastrous effects on security. A (full) nonce misuse-resistant authenticated encryption scheme has the property that if the \emph{same} nonce is used to encrypt the \emph{same} message twice, then the same ciphertext is obtained and so the fact that the same message was encrypted is detected. Otherwise, \emph{full security} is obtained -- even if the same nonce is used for different messages. In this paper, we present a new fully nonce misuse-resistant authenticated encryption scheme that is based on carefully combining the GCM building blocks into the SIV paradigm of Rogaway and Shrimpton. We provide a full proof of security of our scheme, and an optimized implementation using the AES-NI and PCLMULQDQ instruction sets. We compare our performance to the highly optimized OpenSSL 1.0.2 implementation of GCM and show that our \emph{nonce misuse-resistant} scheme is only 14\% slower on Haswell architecture and 19\% slower on Broadwell architecture. On Broadwell, GCM-SIV encryption takes only {\em 0.92 cycles per byte}, and GCM-SIV decryption is exactly the same as GCM decryption taking only 0.77 cycles per byte. In addition, we compare to other optimized authenticated-encryption implementations carried out by Bogdanov et al., and conclude that our mode is very competitive. Beyond being very fast, our new mode of operation uses the same building blocks as GCM and so existing hardware and software can be utilized to easily deploy GCM-SIV. We conclude that GCM-SIV is a viable alternative to GCM, providing full nonce misuse-resistance at little cost.

Note: A small typo has been corrected in this revision.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Minor revision. ACM CCS 2015
Keywords: modes of operation authenticated encryption nonce misuse resistance
Contact author(s): lindell @ biu ac il
History: 2017-07-16: last of 6 revisions; 2015-02-23: received; See all versions
Short URL: https://ia.cr/2015/102
License: CC BY

BibTeX

@misc{cryptoeprint:2015/102,
      author = {Shay Gueron and Yehuda Lindell},
      title = {{GCM}-{SIV}: Full Nonce Misuse-Resistant Authenticated Encryption at Under One Cycle per Byte},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/102},
      year = {2015},
      url = {https://eprint.iacr.org/2015/102}
}