skip to main content
10.1145/2810103.2813613acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

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

Published: 12 October 2015 Publication History
  • Get Citation Alerts
  • 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 same nonce is used to encrypt the same message twice, then the same ciphertext is obtained and so the fact that the same message was encrypted is detected. Otherwise, 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 nonce misuse-resistant scheme is only 14% slower on Haswell architecture and 19% slower on Broadwell architecture. On Broadwell, GCM-SIV encryption takes only 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.

    References

    [1]
    F. Abed, C. Forler and S. Lucks. Classification of the CAESAR Candidates. Cryptology ePrint Archive, 2014/792. http://eprint.iacr.org/2014/792.pdf.
    [2]
    L. Bahack. Julius. http://competitions. cr.yp.to/caesar-submissions.html, 2014.
    [3]
    A. Bogdanov, M.M. Lauridsen and E. Tischhauser.AES-Based Authenticated Encryption Modes in Parallel High-Performance Software. IACR Cryptology ePrint Archive, report 2014:186, 2014.
    [4]
    E. Andreeva, A. Bogdanov, A. Luykx, B. Mennink, E. Tischhauser and K. Yasuda. AES-COPA v.1. CAESAR competition submission.
    [5]
    . Bellare, and C. Namprempre. Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. In ASIACRYPT 2000, Springer (LNCS 1976), pages 531--545, 2000.
    [6]
    E. Fleischmann, C. Forler and S. Lucks. McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes. In FSE 2012, Springer (LNCS 7549), pages 196--215, 2012.
    [7]
    S. Gueron. Intel Advanced Encryption Standard (AES) Instructions Set, Rev 3.01. Intel Software Network. (2012) https://software.intel.com/en-us/articles/intel-advanced-encryption-standard-aes-instructions-set
    [8]
    S. Gueron, AES-GCM for Efficient Authenticated Encryption -- Ending the Reign of HMAC-SHA-1? In Real-World Cryptography, 2013. https://crypto.stanford.edu/RealWorldCrypto/ slides/gueron.pdf
    [9]
    S. Gueron. Intel's New AES Instructions for Enhanced Performance and Security. 16th FSE (FSE 2009), Springer (LNCS 5665), pages 51--66, 2009.
    [10]
    S. Gueron, M. E. Kounavis. Intel Carry-Less Multiplication and Its Usage for Computing The GCM Mode, Rev 2.01. Intel Software Network. http://software.intel.com/sites/default/files/ article/165685/clmul-wp-rev-2.01--2012-09--21.pdf
    [11]
    S. Gueron, M. E. Kounavis. Efficient Implementation of the Galois Counter Mode Using a Carry-less Multiplier and a Fast Reduction Algorithm. Information Processing Letters 110:549--553, 2010.
    [12]
    .T. Hoang, T. Krovetz and P. Rogaway. Robust Authenticated-Encryption: AEZ and the Problem That It Solves. In EUROCRYPT 2015, Springer (LNCS 9056), pages 15--44, 2015.
    [13]
    H. Krawczyk. The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?). In CRYPTO 2001, Springer (LNCS 2139), pages 310--331, 2001.
    [14]
    . Iwata and K. Yasuda. HBS: A Single-Key Mode of Operation for Deterministic Authenticated Encryption. In FSE 2009, Springer (LNCS 5665), pages 394--415, 2009.
    [15]
    . Iwata and K. Yasuda. BTM: A Single-Key, Inverse-Cipher-Free Mode for Deterministic Authenticated Encryption. In Selected Areas in Cryptography 2009, Springer (LNCS 5867), pages 313--330, 2009.
    [16]
    T. Krovetz. HS1-SIV. http://competitions. cr.yp.to/caesar-submissions.html, 2014.
    [17]
    .A. McGrew and J. Viega. The Security and Performance of the Galois/Counter Mode (GCM) of Operation. In INDOCRYPT 2004, Springer (LNCS 3348), pages 343--355, 2004.
    [18]
    . Namprempre, P. Rogaway and T. Shrimpton. Reconsidering Generic Composition. In EUROCRYPT 2014.
    [19]
    R. Reyhanitabar, S. Vaudenay and D. Vizar. Misuse-Resistant Variants of the OMD Authenticated Encryption Mode. In ProvSec 2014, Springer (LNCS 8782), pages 55--70, 2014.
    [20]
    . Rogaway and T. Shrimpton. Deterministic Authenticated Encryption: A Provable-Security Treatment of the Key-Wrap Problem. In EUROCRYPT 2006, Springer (LNCS 4004), pages 373--390, 2006.

    Cited By

    View all
    • (2024)ZLR: a fast online authenticated encryption scheme achieving full securityDesigns, Codes and Cryptography10.1007/s10623-024-01434-6Online publication date: 30-May-2024
    • (2024)Masked Iterate-Fork-Iterate: A New Design Paradigm for Tweakable Expanding Pseudorandom FunctionApplied Cryptography and Network Security10.1007/978-3-031-54773-7_17(433-459)Online publication date: 29-Feb-2024
    • (2024)KIVR: Committing Authenticated Encryption Using Redundancy and Application to GCM, CCM, and MoreApplied Cryptography and Network Security10.1007/978-3-031-54770-6_13(318-347)Online publication date: 1-Mar-2024
    • Show More Cited By

    Index Terms

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

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security
        October 2015
        1750 pages
        ISBN:9781450338325
        DOI:10.1145/2810103
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 12 October 2015

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. GCM
        2. block cipher modes of operation
        3. nonce misuse resistance

        Qualifiers

        • Research-article

        Funding Sources

        • European Commission Horizon2020 Research Programme
        • BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau

        Conference

        CCS'15
        Sponsor:

        Acceptance Rates

        CCS '15 Paper Acceptance Rate 128 of 660 submissions, 19%;
        Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

        Upcoming Conference

        CCS '24
        ACM SIGSAC Conference on Computer and Communications Security
        October 14 - 18, 2024
        Salt Lake City , UT , USA

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)19
        • Downloads (Last 6 weeks)4

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)ZLR: a fast online authenticated encryption scheme achieving full securityDesigns, Codes and Cryptography10.1007/s10623-024-01434-6Online publication date: 30-May-2024
        • (2024)Masked Iterate-Fork-Iterate: A New Design Paradigm for Tweakable Expanding Pseudorandom FunctionApplied Cryptography and Network Security10.1007/978-3-031-54773-7_17(433-459)Online publication date: 29-Feb-2024
        • (2024)KIVR: Committing Authenticated Encryption Using Redundancy and Application to GCM, CCM, and MoreApplied Cryptography and Network Security10.1007/978-3-031-54770-6_13(318-347)Online publication date: 1-Mar-2024
        • (2023)We really need to talk about session ticketsProceedings of the 32nd USENIX Conference on Security Symposium10.5555/3620237.3620510(4877-4894)Online publication date: 9-Aug-2023
        • (2023)$\mathsf{sMGM}$: parameterizable AEAD modeМатематические вопросы криптографииMatematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]10.4213/mvk43514:2(7-24)Online publication date: 17-Aug-2023
        • (2023)GCM-SIV1.5: Optimal Tradeoff between GCM-SIV1 and GCM-SIV2Entropy10.3390/e2501010725:1(107)Online publication date: 4-Jan-2023
        • (2023)Let's Go Eevee! A Friendly and Suitable Family of AEAD Modes for IoT-to-Cloud Secure ComputationProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623091(2546-2560)Online publication date: 15-Nov-2023
        • (2023)A New Construction Method for Keystream GeneratorsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.328741218(3735-3744)Online publication date: 1-Jan-2023
        • (2023)Secure Key Management for Multi-Party Computation in MOZAIK2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)10.1109/EuroSPW59978.2023.00020(133-140)Online publication date: Jul-2023
        • (2023)Offset-Based BBB-Secure Tweakable Block-ciphers with Updatable CachesProgress in Cryptology – INDOCRYPT 202210.1007/978-3-031-22912-1_8(171-194)Online publication date: 1-Jan-2023
        • Show More Cited By

        View Options

        Get Access

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media