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

DOI10.1016/j.ipl.2010.04.011zbMath1234.94044OpenAlexW2049051506MaRDI QIDQ765476

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

cryptographyGalois fieldsmessage authenticationauthenticated encryptionAES-GCM

Mathematics Subject Classification ID

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

Related Items (12)

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

Cites Work

• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Intel’s New AES Instructions for Enhanced Performance and Security
• Unnamed Item
• Unnamed Item

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