In the past several years, there has been an increasing trend in the use of Radio Frequency
Identification (RFID) and Wireless Sensor Networks (WSNs) as well as in the integration of …

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 …

Specific features of Wireless Sensor Networks (WSNs) like the open accessibility to nodes,
or the easy observability of radio communications, lead to severe security challenges. The …

The finite Field multiplication is the basic operation in all cryptographic applications. It can
be performed by using Serial, Booth, Montgomery and Karatsuba-Ofman's divide-and …

This paper shows how to securely authenticate messages using just 29 bit operations per
authenticated bit, plus a constant overhead per message. The authenticator is a standard …

In the constantly evolving field of multiplication architectures, the Karatsuba algorithm and its
extensions have captivated the minds of researchers with their performance metrics. One …

We develop a new and simple way to describe Karatsuba-like algorithms for multiplication of
polynomials over. We restrict the search of small circuits to a class of circuits we call …

The paper presents an architecture to implement Karatsuba Multiplier on an FPGA platform.
Detailed analysis has been carried out on how existing algorithms utilize FPGA resources …

When implementing a cryptographic algorithm, efficient operations have high relevance both
in hardware and in software. Since a number of operations can be performed via polynomial …

In this paper we present an approach for optimizing the implementation of hardware
multipliers in GF (2 k). We investigate two different strategies namely the reduction of the …