Galois/Counter Mode (GCM) is a block cipher mode of operation that uses universal hashing
over a binary Galois field to provide authenticated encryption. It can be implemented in …

Representing the field elements with respect to the polynomial (or standard) basis, we
consider bit parallel architectures for multiplication over the finite field GF (2m). In this effect …

Based on Toeplitz matrix-vector products and coordinate transformation techniques, we
present a new scheme for subquadratic space complexity parallel multiplication in GF (2 n) …

Recently, cryptographic applications based on finite fields have attracted much interest. This
paper presents a transformation method to implement low-complexity Montgomery …

The state-of-the-art Galois field GF (2/sup m/) multipliers offer advantageous space and time
complexities when the field is generated by so special irreducible polynomial. To date, the …

This paper introduces Pyjamask, a new block cipher family and authenticated encryption
proposal submitted to the NIST lightweight cryptography standardization process. Pyjamask …

Based on a new representation of GF (2/sup n/), we present two multipliers for all irreducible
trinomials. Space complexities of the multipliers match the best results. The time complexity …

The authors describe how a simple way to split input operands allows for fast VLSI
implementations of subquadratic GF (2)[x] Karatsuba–Ofman multipliers. The theoretical …

The article describes a novel class of arithmetic architectures for Galois fields GF (2/sup k/).
The main applications of the architecture are public key systems which are based on the …

Two of the major branches in secure multi-party computation research are secret sharing
and garbled circuits. This work succeeds in combining these to enable seamlessly switching …