The residue number system (RNS) has been an important research field in computer
arithmetic for many decades, mainly because of its carry-free nature, which can provide high …

Multipliers requiring large bit lengths have a major impact on the performance of many
applications, such as cryptography, digital signal processing (DSP) and image processing …

Security protocols such as IPSec, SSL and VPNs used in many communication systems
employ various cryptographic algorithms in order to protect the data from malicious attacks …

The floating point arithmetic, specifically multiplication, is a widely used computational
operation in many scientific and signal processing applications. In general, the IEEE-754 …

Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography,
and error correcting codes. Although recent microprocessors typically offer a wide range of …

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 …

In RFID protocols, random numbers are mainly required to anonymize tag answers in order
to guarantee the privacy of the owner of the transponder. Our analysis looks at the feasibility …

(57) ABSTRACT A method is described for use in determining a residue of a message. The
method includes loading at least a portion of each of a set of polynomials derived from a first …

The necessity of hardware security for internet-of-things applications demands a low
hardware area, high speed and secure pseudorandom bit generator (PRBG). Amongst …

This paper presents an implementation of Rivest, Shamir and Adleman (RSA) cryptosystem
based on hardware/software (HW/SW) co-design. The main operation of RSA is the modular …