Modular exponentiation with a large modulus and exponent is a fundamental operation in
many public-key cryptosystems. This operation is usually accomplished by repeating …

We describe a hardware implementation of an arithmetic processor which is efficient for bit-
lengths suitable for both commonly used types of public key cryptography (PKC), ie, elliptic …

Many applications require trustworthy generation of public random numbers. It is shown how
this can be achieved using a hash function that is timed to be as slow as desired (sloth) …

Modular exponentiation with large modulus and exponent, which is usually accomplished by
repeated modular multiplications, has been widely used in public key cryptosystems …

Many applications require trustworthy generation of public random numbers. It is shown how
this can be achieved using a hash function that is timed to be as slow as desired (sloth) …

Modular multiplication of long integers is an important building block for cryptographic
algorithms. Although several FPGA accelerators have been proposed for large modular …

Differential Power Analysis (DPA) presents a major challenge to mathematically-secure
cryptographic protocols. Attackers can break the encryption by measuring the energy …

The non-destructive testing (NDT) of components is very important to the aerospace
industry. Welds in these components may contain porosities and other defects. These …

This letter details a fast and efficient implementation of the Montgomery modular
multiplication by taking advantage of parallel multipliers and adders. This implementation …

The arithmetic in a finite field constitutes the core of public key cryptography like RSA, ECC
or pairing-based cryptography. This paper discusses an efficient hardware implementation …