Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm

DOI10.1016/J.IPL.2010.04.011zbMATH Open1234.94044OpenAlexW2049051506MaRDI QIDQ765476FDOQ765476

Michael E. Kounavis, Shay Gueron

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.011

Recommendations

• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
• Implementing GCM on ARMv8
• Progress in Cryptology - INDOCRYPT 2004
• Implementing fast carryless multiplication

zbMATH Keywords

cryptographymessage authenticationauthenticated encryptionGalois fieldsAES-GCM

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Intel’s New AES Instructions for Enhanced Performance and Security
• Title not available (Why is that?)
• Montgomery multiplication in \(\text{GF}(2^ k)\)

Cited In (15)

• Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
• Evaluating Bernstein-Rabin-Winograd polynomials
• Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
• RIV for Robust Authenticated Encryption
• Progress in Cryptology - INDOCRYPT 2004
• High-Speed Pipelined Hardware Architecture for Galois Counter Mode
• Parallel verification of serial MAC and AE modes
• Online Ciphers from Tweakable Blockciphers
• Efficient public-key operation in multivariate schemes
• \textsf{FAST}: disk encryption and beyond
• Parallelizing the Weil and Tate Pairings
• Secure GCM implementation on AVR
• Implementing GCM on ARMv8
• The Software Performance of Authenticated-Encryption Modes
• How fast can SM4 be in software?

This page was built for publication: Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765476)