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

DOI10.1016/J.IPL.2010.04.011MaRDI QIDQ765476zbMATH OpenOpenAlexFDO

Authors Shay Gueron, Michael E. Kounavis

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

zbMATH Keywords

cryptographymessage authenticationauthenticated encryptionGalois fieldsAES-GCM

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1583946 (Why is no real title available?)
• scientific article; zbMATH DE number 1406771 (Why is no real title available?)
• Intel’s New AES Instructions for Enhanced Performance and Security
• Montgomery multiplication in \(\text{GF}(2^ k)\)

Cited in

(16)

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

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)